{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018626695,0.0031110526,0.95073557,0.0030172886,0.00048632425,0.00008821994,0.0002012158,0.00014879004,0.023584876],"genre_scores_gemma":[0.7443806,0.007402448,0.20997418,0.0016466104,0.0020246608,0.00036537537,0.00050742034,0.00034360177,0.0333551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987895,0.0004272535,0.00006878596,0.00017330264,0.00037152373,0.00016971063],"domain_scores_gemma":[0.99339724,0.005119987,0.00043571126,0.00015373742,0.0006673523,0.0002260048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043557286,0.001660288,0.0012429145,0.0017313327,0.001129066,0.0034498412,0.0018644646,0.0015943691,0.0078057046],"category_scores_gemma":[0.01106093,0.0006940042,0.0016587252,0.0023078432,0.0020142798,0.0045121973,0.0011347936,0.0033703456,0.0006390757],"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.0001985313,0.00021018037,0.00083394186,0.00037556354,0.00008237362,0.00027048466,0.00023232654,0.25192192,0.0035439436,0.7127471,0.006854653,0.02272891],"study_design_scores_gemma":[0.000018148145,0.00003110696,0.00039095516,0.000044032775,0.000032960066,0.000057396217,0.000048653877,0.79698634,0.0005660902,0.2002099,0.0015884101,0.000025988804],"about_ca_topic_score_codex":0.0063545345,"about_ca_topic_score_gemma":0.0040248972,"teacher_disagreement_score":0.0078057046,"about_ca_system_score_codex":0.0036827123,"about_ca_system_score_gemma":0.0031191632,"threshold_uncertainty_score":0.026720107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35574543,0.0029744762,0.50204855,0.0057827043,0.0014694489,0.0005111677,0.005368762,0.0036767714,0.12242277],"genre_scores_gemma":[0.9299684,0.00058087497,0.026702054,0.00023335115,0.00011071527,0.00026194725,0.0012793157,0.00028298653,0.040580314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988852,0.00033198795,0.000046410576,0.0002151089,0.00020725465,0.00031397413],"domain_scores_gemma":[0.99413496,0.0033459687,0.00027426518,0.00056889845,0.0008694502,0.0008064646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012565259,0.00094333204,0.0019010088,0.001214007,0.0018364281,0.0027287756,0.0024751988,0.0024990197,0.023644961],"category_scores_gemma":[0.008601711,0.0008422446,0.0015530953,0.0015496963,0.0014007711,0.0025836602,0.0026429156,0.0016607961,0.0019340817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017825946,0.00007593691,0.0013503319,0.000041963227,0.00003418758,0.00010688924,0.0001294463,0.9630631,0.00031793915,0.02446886,0.004296979,0.0059361313],"study_design_scores_gemma":[0.000035781588,0.000025691774,0.00029517364,0.000012401263,0.000007950641,0.000015093148,0.000059621678,0.9899176,0.00023566309,0.0073935105,0.001988766,0.000012747213],"about_ca_topic_score_codex":0.0674569,"about_ca_topic_score_gemma":0.043281045,"teacher_disagreement_score":0.0674569,"about_ca_system_score_codex":0.0036091905,"about_ca_system_score_gemma":0.0026156239,"threshold_uncertainty_score":0.13412851},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005840723,0.00010943331,0.991714,0.00009056305,0.00009581123,0.000068466274,0.00015271902,0.00017681284,0.0017514742],"genre_scores_gemma":[0.259244,0.00058363745,0.7243878,0.0002689982,0.00025983088,0.00045506732,0.0007069897,0.00020248063,0.013891216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997205,0.000049577986,0.000018917402,0.00006169632,0.00010196791,0.000047281665],"domain_scores_gemma":[0.99953115,0.00013645874,0.00004455389,0.00006293138,0.00017260351,0.000052233336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063139416,0.00062632194,0.00056034775,0.0011703126,0.00059815834,0.0007006948,0.00088754785,0.0005356628,0.0063084667],"category_scores_gemma":[0.001926312,0.000286211,0.0009097709,0.0010428146,0.00040459543,0.0009643845,0.000772518,0.0013681236,0.0011442504],"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.000252808,0.00031990095,0.0046137595,0.00036721936,0.00017729978,0.0005441586,0.00047324988,0.19707629,0.059432793,0.43108085,0.016669644,0.28899208],"study_design_scores_gemma":[0.000035018715,0.00003544249,0.0016028106,0.000020257035,0.000034709832,0.00020218697,0.000039118397,0.92574227,0.0031462219,0.06404882,0.005046318,0.00004684199],"about_ca_topic_score_codex":0.0070053446,"about_ca_topic_score_gemma":0.009976555,"teacher_disagreement_score":0.0070053446,"about_ca_system_score_codex":0.00073905755,"about_ca_system_score_gemma":0.0016625688,"threshold_uncertainty_score":0.021103919},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022191104,0.0022180676,0.95031166,0.003153752,0.0014499236,0.00008383334,0.00014159938,0.00052758714,0.019922484],"genre_scores_gemma":[0.7578749,0.0061225556,0.15671025,0.0022384562,0.0029063132,0.00047781496,0.0004942122,0.001165743,0.07200973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875534,0.0006220855,0.000047461523,0.00013254088,0.0003136502,0.00012894478],"domain_scores_gemma":[0.9910749,0.005118487,0.00064735493,0.0007360124,0.0019323057,0.0004909623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003605658,0.001473703,0.0012187423,0.0023536158,0.0010579953,0.002082282,0.0023350583,0.0020179353,0.0062534674],"category_scores_gemma":[0.024422966,0.0006716986,0.001598754,0.0016455498,0.0025498183,0.004073545,0.0023594352,0.004271655,0.0012147947],"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.00006492195,0.000043805856,0.0003398188,0.00015504655,0.000050226823,0.00012274507,0.0001553842,0.07557001,0.0025738997,0.90710485,0.0050420496,0.0087772785],"study_design_scores_gemma":[0.000012390823,0.000013441173,0.00026885653,0.00003282391,0.00001848514,0.00009702152,0.0000288854,0.6678184,0.0005963609,0.3292358,0.0018397802,0.00003779018],"about_ca_topic_score_codex":0.0043201777,"about_ca_topic_score_gemma":0.0016202457,"teacher_disagreement_score":0.0062534674,"about_ca_system_score_codex":0.002542493,"about_ca_system_score_gemma":0.0018866288,"threshold_uncertainty_score":0.020919979},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058380812,0.0009747903,0.92920685,0.00045726667,0.00008037803,0.000035344972,0.00014427619,0.0001924366,0.010527825],"genre_scores_gemma":[0.8582763,0.0019765226,0.12497579,0.0001608898,0.00025199715,0.00013065612,0.00016728695,0.00013553513,0.013925047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996419,0.000120936464,0.000018944222,0.00007641302,0.00008801974,0.000053786513],"domain_scores_gemma":[0.99917066,0.00039002212,0.00017490625,0.0000930856,0.00010147077,0.00006997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000803227,0.00064654456,0.0005279663,0.00078449916,0.00040400386,0.0014382469,0.00081139803,0.0007472859,0.0024436703],"category_scores_gemma":[0.002556,0.00033079923,0.0005178516,0.0006741401,0.0014031382,0.002184676,0.0008408453,0.0012243231,0.00047711426],"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.00003997654,0.000025846757,0.0006437824,0.000030052099,0.000011819781,0.00016438421,0.0001464461,0.12513913,0.0025389986,0.86566114,0.0005220076,0.0050764307],"study_design_scores_gemma":[0.0000066599937,0.000023345548,0.00019356362,0.000012793695,0.000005795249,0.00004498256,0.000021070737,0.66887945,0.00083319185,0.3286218,0.0013446875,0.000012604768],"about_ca_topic_score_codex":0.0021564201,"about_ca_topic_score_gemma":0.0011478727,"teacher_disagreement_score":0.0024436703,"about_ca_system_score_codex":0.0014925231,"about_ca_system_score_gemma":0.0006452134,"threshold_uncertainty_score":0.010829091},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045293786,0.0019316943,0.92673254,0.0026107298,0.00033588984,0.000091628855,0.00072796515,0.00046960486,0.021806186],"genre_scores_gemma":[0.8904237,0.0031849775,0.055802807,0.0004982822,0.0007635851,0.0003165837,0.0005916209,0.0002820949,0.048136305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991953,0.00023429717,0.000031334865,0.00010183312,0.00024239224,0.00019493506],"domain_scores_gemma":[0.9968004,0.0020372828,0.00025404833,0.00018465461,0.0005817282,0.00014177687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018373346,0.0011508957,0.0013115698,0.0012590141,0.0010767089,0.002303907,0.0030825872,0.0024656667,0.006242501],"category_scores_gemma":[0.00809767,0.00079577847,0.00095985754,0.0018441736,0.0010538166,0.0031185343,0.0012459091,0.0022058957,0.0010406064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000392253,0.00004183651,0.0003894617,0.00005373318,0.000018327371,0.00011938634,0.00009523285,0.7192271,0.0005631874,0.26694915,0.004093034,0.008410299],"study_design_scores_gemma":[0.0000032025162,0.000003911737,0.00003987225,0.0000034084007,0.000004870297,0.000013043227,0.0000073116003,0.97169465,0.00005237251,0.027668027,0.0005053773,0.0000038615576],"about_ca_topic_score_codex":0.013583436,"about_ca_topic_score_gemma":0.008246835,"teacher_disagreement_score":0.013583436,"about_ca_system_score_codex":0.0034143266,"about_ca_system_score_gemma":0.0014831278,"threshold_uncertainty_score":0.027008712},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061025186,0.01434633,0.8491243,0.007725423,0.0019240141,0.00009300039,0.00011961466,0.0001991986,0.120365545],"genre_scores_gemma":[0.51351774,0.04472564,0.34782627,0.0037939006,0.005573445,0.0004562286,0.00024333467,0.00023449029,0.08362893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832684,0.00060407,0.000085465545,0.00020612238,0.0006496777,0.00012778673],"domain_scores_gemma":[0.9985078,0.00094845233,0.00007242639,0.00015579409,0.00023607383,0.00007952745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002346731,0.0007479503,0.00084668555,0.0014165227,0.0012907726,0.002559372,0.0013994011,0.0015052725,0.0053658076],"category_scores_gemma":[0.005495127,0.0004582773,0.0011277127,0.001623297,0.0029336459,0.0031162463,0.0021671287,0.00388112,0.0010747106],"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.0000017277536,0.0000061371716,0.00006317561,0.000024201629,0.0000045500537,0.00004944544,0.00008644666,0.004033142,0.00008636565,0.9887737,0.0011021743,0.0057689915],"study_design_scores_gemma":[0.000003246047,0.000007615363,0.00007066996,0.00002623711,0.0000037595594,0.00006592481,0.000031780834,0.024493659,0.000095746655,0.9559741,0.019220192,0.000007004918],"about_ca_topic_score_codex":0.003335461,"about_ca_topic_score_gemma":0.0016688695,"teacher_disagreement_score":0.0053658076,"about_ca_system_score_codex":0.0032957399,"about_ca_system_score_gemma":0.0019556996,"threshold_uncertainty_score":0.02391231},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0100320075,0.117436886,0.57543474,0.010274494,0.0044089276,0.00010516331,0.00083943707,0.0005131888,0.28095523],"genre_scores_gemma":[0.37956384,0.13142236,0.08801843,0.0029461372,0.010198127,0.00066870585,0.0017637754,0.00053142704,0.38488728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939156,0.00019807188,0.00004100868,0.000098541,0.00022851721,0.000042346684],"domain_scores_gemma":[0.99881566,0.0008012336,0.000088721754,0.00010545761,0.00015261579,0.000036272595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008163646,0.0013802573,0.0014016097,0.001408006,0.0005541735,0.002474456,0.0007627789,0.0018655758,0.013615949],"category_scores_gemma":[0.00311231,0.00064187445,0.0006701158,0.0026619076,0.0019299659,0.002969081,0.00082468166,0.0025089036,0.0035582918],"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.0000038335024,0.000016393904,0.00008228093,0.00008412451,0.000010047844,0.000038463142,0.00007934159,0.006107274,0.00011541998,0.9671609,0.011242064,0.015059821],"study_design_scores_gemma":[0.0000033804438,0.0000052115333,0.00011294641,0.000044854325,0.0000055903643,0.00004433954,0.00001848005,0.011753027,0.000050749113,0.9510036,0.036950175,0.0000076130023],"about_ca_topic_score_codex":0.0025227796,"about_ca_topic_score_gemma":0.001754759,"teacher_disagreement_score":0.013615949,"about_ca_system_score_codex":0.0016903509,"about_ca_system_score_gemma":0.0012637652,"threshold_uncertainty_score":0.04554987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90516406,0.00019521544,0.09148955,0.00023698258,0.00015945119,0.00008268362,0.000058019607,0.00015888347,0.002455109],"genre_scores_gemma":[0.984211,0.000044593115,0.014664608,0.000036073983,0.000037072226,0.000028817904,0.000069470996,0.000035327463,0.0008729739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998869,0.00027452013,0.00007594747,0.0002088244,0.00027226462,0.00029938458],"domain_scores_gemma":[0.9935364,0.0033931527,0.0006149429,0.00082812767,0.00092735863,0.0006999289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002693672,0.00042096028,0.0007341855,0.000825831,0.0020253074,0.0017362986,0.0019822433,0.00073804165,0.0011083431],"category_scores_gemma":[0.010984462,0.00064156955,0.0003264585,0.0012072443,0.00084665447,0.0015505605,0.0010640768,0.001001815,0.0001691333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004754274,0.000708281,0.018289244,0.0001573642,0.0001472938,0.0007511339,0.0005479384,0.7998671,0.0462637,0.023496006,0.001910228,0.10310744],"study_design_scores_gemma":[0.00004440458,0.00022419788,0.001975111,0.000003346102,0.000014603442,0.00006155942,0.000054780485,0.9889619,0.0040138587,0.0043221437,0.00031167068,0.000012398107],"about_ca_topic_score_codex":0.0025368603,"about_ca_topic_score_gemma":0.006946035,"teacher_disagreement_score":0.002693672,"about_ca_system_score_codex":0.0010890244,"about_ca_system_score_gemma":0.0023036343,"threshold_uncertainty_score":0.014245629},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7417417,0.0016151876,0.24662922,0.0011088429,0.00019987108,0.00018538332,0.00014316627,0.0012788022,0.0070978436],"genre_scores_gemma":[0.9750074,0.00042855338,0.0228933,0.000092922164,0.000105262276,0.00005081382,0.000094728326,0.000051744428,0.0012751891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970812,0.0011292468,0.00010256793,0.00025934877,0.0007152216,0.0007124227],"domain_scores_gemma":[0.99191624,0.004701262,0.00080063305,0.0006283926,0.0015176561,0.0004358011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046908413,0.0012779618,0.0017241373,0.0010691578,0.00153441,0.0020412947,0.001276119,0.001637083,0.0025090696],"category_scores_gemma":[0.018232837,0.0003650791,0.00089357374,0.0019618147,0.0009139529,0.0025897326,0.0012928803,0.0015666366,0.00053476344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007834013,0.00059823476,0.004851984,0.0002483627,0.00013475111,0.00022111373,0.00048090972,0.89712256,0.01686267,0.026321553,0.0016214715,0.050753035],"study_design_scores_gemma":[0.000057173893,0.0005867445,0.0009914057,0.000013426015,0.0000906937,0.00006393506,0.000101264544,0.9869489,0.0037081414,0.0064882715,0.0009215838,0.000028327406],"about_ca_topic_score_codex":0.0036284437,"about_ca_topic_score_gemma":0.0019987025,"teacher_disagreement_score":0.0046908413,"about_ca_system_score_codex":0.002470373,"about_ca_system_score_gemma":0.001271628,"threshold_uncertainty_score":0.02480781},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019841343,0.0007205109,0.9756117,0.00047673305,0.00017893215,0.00008688397,0.00003221385,0.00030991744,0.0027417326],"genre_scores_gemma":[0.73817563,0.0010018159,0.2537927,0.00029559055,0.00035296168,0.00018517423,0.00008464483,0.00009019921,0.0060212114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984127,0.0006051259,0.00007051827,0.00021244447,0.0004728901,0.0002263991],"domain_scores_gemma":[0.99798006,0.0010788076,0.0001574502,0.00024953458,0.0003896484,0.00014457457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003841239,0.0006114184,0.00087833195,0.0006912938,0.0016196327,0.0024690444,0.0021640202,0.0011229892,0.002190492],"category_scores_gemma":[0.008116543,0.00034446103,0.0003869713,0.0009782214,0.0011661496,0.0028839235,0.0010051874,0.0010658427,0.00040402965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053286913,0.00015813601,0.0015019575,0.00029660575,0.00006392753,0.0003165066,0.0004986457,0.4684717,0.009569137,0.40917182,0.004232107,0.10518655],"study_design_scores_gemma":[0.000031486583,0.000075487165,0.0001429949,0.000015694728,0.000013856945,0.000055372882,0.000054999007,0.93258774,0.0020428628,0.061651193,0.0033130457,0.000015304546],"about_ca_topic_score_codex":0.0048953327,"about_ca_topic_score_gemma":0.0038839877,"teacher_disagreement_score":0.0048953327,"about_ca_system_score_codex":0.0023912077,"about_ca_system_score_gemma":0.0030326464,"threshold_uncertainty_score":0.020314634},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07333816,0.0010877978,0.8960557,0.0014839111,0.00013872438,0.000052434803,0.000106693136,0.00022446329,0.027512128],"genre_scores_gemma":[0.9563716,0.0011308453,0.033364717,0.00028520625,0.00036196562,0.00009408872,0.00017092224,0.00013770344,0.008082809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680626,0.0016091831,0.00007261296,0.00036203736,0.00078404945,0.00036594967],"domain_scores_gemma":[0.9765327,0.018171152,0.0006074173,0.0011113656,0.003195417,0.00038202142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009357954,0.000726795,0.0010394765,0.002374364,0.0008378381,0.0032230525,0.0017871198,0.0010973185,0.0049072844],"category_scores_gemma":[0.037804615,0.00048560713,0.0004995541,0.0018250159,0.0036931057,0.006727025,0.0018180029,0.0018922206,0.0006227045],"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.00009310959,0.00003809461,0.0010187129,0.00004005331,0.000021865882,0.000034146648,0.00015655534,0.09646624,0.0005185189,0.88113475,0.0020325459,0.018445402],"study_design_scores_gemma":[0.000008199651,0.000027708445,0.0006090193,0.000035664227,0.000014134771,0.000033205928,0.00006230513,0.64841247,0.00039550653,0.34947613,0.00090959005,0.000016086475],"about_ca_topic_score_codex":0.0030841406,"about_ca_topic_score_gemma":0.0012696015,"teacher_disagreement_score":0.009357954,"about_ca_system_score_codex":0.002943641,"about_ca_system_score_gemma":0.0017412647,"threshold_uncertainty_score":0.049490213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038263947,0.004192186,0.92647237,0.002315273,0.0005636467,0.00007217534,0.00011005613,0.000064708416,0.027945688],"genre_scores_gemma":[0.736584,0.004980726,0.22563894,0.000584136,0.0017620784,0.00020051586,0.00013187928,0.00033344497,0.02978426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717146,0.0016355315,0.00007132772,0.00028800938,0.00044658163,0.0003871046],"domain_scores_gemma":[0.98899543,0.008319622,0.0004891317,0.00064475153,0.0009295027,0.0006215369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007371667,0.0013963823,0.001911459,0.0012794976,0.0013916503,0.005418601,0.0020378414,0.0014423109,0.0084689595],"category_scores_gemma":[0.017774194,0.001290442,0.0016028747,0.0025549643,0.0030272764,0.0062768855,0.002724796,0.0044303522,0.00050291856],"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.00012944936,0.00008769797,0.00042208788,0.000087377644,0.000040260566,0.00005114455,0.00020591667,0.059880897,0.00051697146,0.9204222,0.0035180885,0.0146380635],"study_design_scores_gemma":[0.000020871883,0.000030543786,0.00018950977,0.00003351218,0.000044475117,0.000053530148,0.000092637194,0.3951912,0.00024309619,0.60194707,0.0021399283,0.000013624937],"about_ca_topic_score_codex":0.002607748,"about_ca_topic_score_gemma":0.0018969569,"teacher_disagreement_score":0.0084689595,"about_ca_system_score_codex":0.0030715973,"about_ca_system_score_gemma":0.0023652383,"threshold_uncertainty_score":0.03898555},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035596036,0.18226208,0.58778805,0.008897049,0.009375047,0.00013686146,0.0015398855,0.0014016673,0.20503975],"genre_scores_gemma":[0.11425441,0.2957314,0.24191888,0.009069691,0.031891696,0.00065313897,0.002154128,0.0019927046,0.30233395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991027,0.00013489884,0.000085006315,0.00016929273,0.00043720234,0.00007087454],"domain_scores_gemma":[0.9964265,0.0024459276,0.00013535214,0.0003015934,0.0005763643,0.000114355185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001588777,0.0017754355,0.0015158117,0.0023952674,0.000694463,0.0029861394,0.0018223155,0.0016664999,0.020912198],"category_scores_gemma":[0.0065895407,0.0011034613,0.0013669794,0.0049387347,0.0019562151,0.007851742,0.001595631,0.0062184567,0.007933831],"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.000027288324,0.00007730973,0.00020624936,0.00039603328,0.000027244172,0.00016626995,0.00017770872,0.0055738064,0.0007037738,0.80129635,0.083929606,0.10741837],"study_design_scores_gemma":[0.000007751691,0.00002060359,0.00025464766,0.00010821813,0.000012169004,0.00040499185,0.000025625275,0.007338121,0.00019141637,0.8101379,0.18147151,0.000026978067],"about_ca_topic_score_codex":0.0011458555,"about_ca_topic_score_gemma":0.001074963,"teacher_disagreement_score":0.020912198,"about_ca_system_score_codex":0.0020943265,"about_ca_system_score_gemma":0.0013651743,"threshold_uncertainty_score":0.06995827},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1270915,0.003376838,0.83257717,0.0049804067,0.0004056714,0.00012718768,0.00065378356,0.000199646,0.03058781],"genre_scores_gemma":[0.8855501,0.0031588296,0.09224314,0.00046604202,0.0006705689,0.00027398454,0.00072094426,0.0001521409,0.016764225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978802,0.0011417007,0.0000572972,0.00023699614,0.00036591833,0.0003178132],"domain_scores_gemma":[0.99177504,0.006746021,0.00045426207,0.00016844035,0.00052500726,0.00033120284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033277455,0.0011776121,0.0015400155,0.0013290175,0.0011682682,0.0020289826,0.0025485135,0.0021395292,0.005715245],"category_scores_gemma":[0.016559333,0.0006996292,0.00086813566,0.001789498,0.0028642903,0.0038677026,0.0016381183,0.002223723,0.00047194862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011824412,0.000060025468,0.0007471334,0.00012935932,0.000037906935,0.00021372644,0.0001906187,0.5759386,0.00021587654,0.41337374,0.002929833,0.0060449084],"study_design_scores_gemma":[0.0000356085,0.000016465683,0.00015207636,0.000024470937,0.0000071775557,0.000040775074,0.00006593419,0.71444464,0.000057005804,0.28371552,0.0014255046,0.000014877645],"about_ca_topic_score_codex":0.010508778,"about_ca_topic_score_gemma":0.0038000762,"teacher_disagreement_score":0.010508778,"about_ca_system_score_codex":0.0032571878,"about_ca_system_score_gemma":0.002237047,"threshold_uncertainty_score":0.023632646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098005176,0.0029985378,0.88397723,0.00196262,0.00025396422,0.00009775593,0.00016442512,0.00057951326,0.011960734],"genre_scores_gemma":[0.967218,0.0013301834,0.02688931,0.00018887354,0.00038865293,0.00011036286,0.000051235325,0.00013780933,0.0036856134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965759,0.001654473,0.00011745085,0.00044951367,0.00057651824,0.0006260184],"domain_scores_gemma":[0.9871148,0.010814103,0.0005980599,0.00048198798,0.00053014734,0.00046099242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005053703,0.001849453,0.0028520068,0.0011879298,0.0013981595,0.003794791,0.0036021462,0.0024443713,0.002315386],"category_scores_gemma":[0.019365195,0.0017005597,0.0007718899,0.0028173083,0.0028655245,0.004944496,0.0024496943,0.0022285974,0.00041107854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022532509,0.000060496914,0.00028847012,0.000121209494,0.00004033489,0.00009335391,0.00011791299,0.9018908,0.0021070428,0.08308266,0.0014863318,0.010486089],"study_design_scores_gemma":[0.000016331802,0.000022324373,0.00007278886,0.000011882024,0.000013114627,0.000021928543,0.000015514841,0.9428586,0.00031627508,0.056397326,0.0002420799,0.000011963458],"about_ca_topic_score_codex":0.0028056724,"about_ca_topic_score_gemma":0.0021330602,"teacher_disagreement_score":0.005053703,"about_ca_system_score_codex":0.0043241787,"about_ca_system_score_gemma":0.0019138257,"threshold_uncertainty_score":0.031374276},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040780893,0.014141868,0.19931005,0.023277694,0.011612409,0.00042370104,0.00085061206,0.003721935,0.74258363],"genre_scores_gemma":[0.15897872,0.024488315,0.14512041,0.014516061,0.010657668,0.00057184434,0.0019810076,0.0011798409,0.6425062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984397,0.00022378481,0.0000761656,0.00017582484,0.00092484785,0.0001596281],"domain_scores_gemma":[0.9976872,0.00023862069,0.000079916485,0.0003499356,0.0015093004,0.00013504268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020281747,0.00055488147,0.0004302742,0.0010945377,0.0014696094,0.0030252063,0.0012024215,0.0020423895,0.027432531],"category_scores_gemma":[0.0034760367,0.0003160998,0.00032211636,0.0012085077,0.001129366,0.003911235,0.0011331302,0.0025688147,0.010196596],"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.000049350525,0.000042442512,0.00017509918,0.00016629361,0.0000052109904,0.00008993953,0.00014213797,0.0023022795,0.0038926126,0.5261961,0.23726179,0.22967671],"study_design_scores_gemma":[0.000011571243,0.000036746413,0.0002817788,0.00012909855,0.000006993332,0.00013730653,0.00005030275,0.0040596467,0.001258411,0.031099673,0.96291184,0.000016516955],"about_ca_topic_score_codex":0.0052297767,"about_ca_topic_score_gemma":0.0037364708,"teacher_disagreement_score":0.027432531,"about_ca_system_score_codex":0.0021039445,"about_ca_system_score_gemma":0.0020746072,"threshold_uncertainty_score":0.09177095},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033690745,0.0065872846,0.8639856,0.00313636,0.0014459604,0.00007772995,0.00037081016,0.0003360005,0.12069122],"genre_scores_gemma":[0.22039059,0.020503417,0.5971814,0.0023581851,0.0043485654,0.0005089375,0.0006378316,0.000643231,0.1534279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993685,0.00018926698,0.000030576073,0.000114969,0.00024401341,0.000052651558],"domain_scores_gemma":[0.9993327,0.00023575028,0.00005497941,0.00016389733,0.00017523633,0.000037363272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008959686,0.0011956419,0.00073269533,0.0018330975,0.0009276382,0.0018397375,0.0010515612,0.00076146,0.019111617],"category_scores_gemma":[0.0026742725,0.0003401557,0.0013490667,0.0012787465,0.0014547318,0.002597462,0.0017533186,0.0030329835,0.006875929],"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.000004027017,0.000010565036,0.00006981062,0.000040925774,0.000010172309,0.000029827792,0.00005769087,0.0024795565,0.0003643558,0.9742076,0.006411253,0.016314173],"study_design_scores_gemma":[0.0000084556,0.000022808796,0.0001557615,0.000042780444,0.0000111225145,0.00021882991,0.00003849111,0.037168395,0.00048403515,0.86123693,0.10059614,0.000016226155],"about_ca_topic_score_codex":0.0023702395,"about_ca_topic_score_gemma":0.0024234082,"teacher_disagreement_score":0.019111617,"about_ca_system_score_codex":0.0011707576,"about_ca_system_score_gemma":0.0010998086,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30886558,0.0053660283,0.46986973,0.009180816,0.0014778514,0.0005605936,0.002584282,0.0022718594,0.19982326],"genre_scores_gemma":[0.9143937,0.0017666231,0.04311721,0.0006109602,0.00037098068,0.00012505859,0.00051990215,0.00011327837,0.038982306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996263,0.00008065104,0.00002270987,0.000078020494,0.00010568723,0.000086588014],"domain_scores_gemma":[0.99953926,0.00011550334,0.0000786462,0.00006151572,0.00013214655,0.0000729841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005977471,0.00030232995,0.00028665233,0.00058019045,0.0011874778,0.0022548481,0.0011277576,0.00076061697,0.0060721724],"category_scores_gemma":[0.0018040884,0.00018047125,0.00020809013,0.0008928176,0.0006197914,0.0010500632,0.0008708079,0.0007242754,0.0016306193],"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.00034617068,0.00016516987,0.0048943586,0.00032406845,0.000024352617,0.0019392708,0.00038834478,0.079029046,0.015588149,0.7032097,0.06912993,0.12496143],"study_design_scores_gemma":[0.00011556055,0.0002479342,0.0031160882,0.00015983274,0.00005639173,0.0018010067,0.0003001247,0.5482883,0.015788674,0.34060627,0.089363225,0.00015658786],"about_ca_topic_score_codex":0.0076682614,"about_ca_topic_score_gemma":0.0048920237,"teacher_disagreement_score":0.0076682614,"about_ca_system_score_codex":0.001756254,"about_ca_system_score_gemma":0.001606245,"threshold_uncertainty_score":0.020313382},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02244575,0.001706777,0.8247786,0.00047814316,0.00026143025,0.0006398024,0.0021632775,0.00048986915,0.14703633],"genre_scores_gemma":[0.57582843,0.0029332438,0.34212765,0.00016904985,0.00022510065,0.0006291221,0.0030260042,0.00056155317,0.07449987],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946654,0.0009639702,0.00016384125,0.00076615944,0.0031460428,0.00029465195],"domain_scores_gemma":[0.99506986,0.0017578887,0.0003104107,0.00063706987,0.0021415702,0.00008310535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021183032,0.0015036395,0.001012329,0.0059606056,0.0007403007,0.0028319198,0.0019135043,0.0009201527,0.025040597],"category_scores_gemma":[0.014543667,0.0005970414,0.0010898988,0.004880839,0.0009022477,0.0027644786,0.0010054532,0.001278425,0.0046544382],"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.00013247243,0.00011869079,0.0064823125,0.00060320523,0.00010166859,0.00034988148,0.0001795635,0.16834915,0.0026989966,0.36262614,0.01917006,0.43918788],"study_design_scores_gemma":[0.000018940771,0.00021760825,0.009359107,0.00036621475,0.00011035508,0.0009385657,0.00038966243,0.6165779,0.014983746,0.23421206,0.122692004,0.00013379734],"about_ca_topic_score_codex":0.008183957,"about_ca_topic_score_gemma":0.0047024568,"teacher_disagreement_score":0.025040597,"about_ca_system_score_codex":0.0035062598,"about_ca_system_score_gemma":0.0024299265,"threshold_uncertainty_score":0.08376914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68180215,0.0008879447,0.2586184,0.010452762,0.002123818,0.00063688087,0.0013292828,0.0015898603,0.04255879],"genre_scores_gemma":[0.92394555,0.00020937638,0.04328777,0.00079558464,0.00043058247,0.00015570366,0.00024770052,0.00008024636,0.03084749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785644,0.0005291406,0.00012798244,0.00035565937,0.00042471322,0.00070610404],"domain_scores_gemma":[0.99599385,0.0014139619,0.000417734,0.0005708489,0.0007200272,0.0008836365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022529445,0.0009701276,0.0012669975,0.001330607,0.0030437706,0.0062111677,0.0030531147,0.0045662913,0.011453837],"category_scores_gemma":[0.007957142,0.0009798188,0.0009359095,0.0014626461,0.0018191767,0.0039975755,0.003592027,0.0023651877,0.0016138171],"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.01248049,0.003324584,0.014411335,0.00051511364,0.00026626058,0.00796106,0.0019285675,0.195696,0.049406156,0.63228065,0.024604032,0.05712582],"study_design_scores_gemma":[0.0007195998,0.0007136819,0.0030445622,0.000050189734,0.00011657239,0.00084229454,0.00036843948,0.8528197,0.017990377,0.116317004,0.0068108123,0.00020676934],"about_ca_topic_score_codex":0.0036964493,"about_ca_topic_score_gemma":0.0027665182,"teacher_disagreement_score":0.011453837,"about_ca_system_score_codex":0.0038500163,"about_ca_system_score_gemma":0.0023363703,"threshold_uncertainty_score":0.038316905},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08969395,0.0009552696,0.8873779,0.0005119291,0.00004816209,0.00008490835,0.00039905938,0.000860293,0.020068595],"genre_scores_gemma":[0.9034201,0.001024268,0.085392796,0.0000970598,0.00004190521,0.00024566308,0.0004558136,0.00018213037,0.009140238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997104,0.00007920306,0.000009802127,0.000030322935,0.00011677568,0.000053486856],"domain_scores_gemma":[0.99951017,0.00022554785,0.0000677777,0.000039391598,0.00013776055,0.000019329007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055751385,0.00058522803,0.0003328806,0.00040655685,0.00029615778,0.00066837965,0.0008415511,0.0004996329,0.0027688937],"category_scores_gemma":[0.0019406897,0.00026783472,0.00034972804,0.0005959507,0.00026366056,0.0010069459,0.00032554442,0.00056424027,0.00058712927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000619183,0.000006039485,0.00009664531,0.000009094728,0.00000272169,0.000006009643,0.0000074178906,0.9910918,0.00042140295,0.006067233,0.00022105672,0.002064404],"study_design_scores_gemma":[0.0000011012618,0.0000033341985,0.000042099266,9.65858e-7,0.0000010752946,0.0000015197513,0.0000018718486,0.99818903,0.00009780563,0.0014984097,0.00016201509,8.2996576e-7],"about_ca_topic_score_codex":0.009778352,"about_ca_topic_score_gemma":0.007791157,"teacher_disagreement_score":0.009778352,"about_ca_system_score_codex":0.0013389552,"about_ca_system_score_gemma":0.0013599783,"threshold_uncertainty_score":0.019442856},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3818784,0.001514937,0.5737665,0.0020530315,0.00026584827,0.0002490542,0.00081713765,0.00070681,0.038748197],"genre_scores_gemma":[0.9875799,0.00024219124,0.007087096,0.00010966742,0.00007561839,0.000070856324,0.00014640622,0.000078157,0.004610278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992601,0.00015026599,0.000026776122,0.00014060357,0.00018777231,0.0002343964],"domain_scores_gemma":[0.9964941,0.0013174491,0.00042017605,0.0001523292,0.0013751216,0.0002408547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001551661,0.00060300436,0.0006999009,0.0012267482,0.0012737712,0.0026289707,0.001436473,0.0008862655,0.0052520684],"category_scores_gemma":[0.0075311395,0.00039349025,0.000403717,0.0007051324,0.0014109476,0.0012741454,0.0014429992,0.0012959137,0.0008379386],"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.001006101,0.000128936,0.0029079283,0.000197444,0.00008076754,0.0006637842,0.0010356639,0.46092108,0.030002115,0.46988264,0.009746626,0.023426862],"study_design_scores_gemma":[0.000023744591,0.000029484974,0.00042635438,0.000010402815,0.000009444388,0.000037531172,0.000081871156,0.961802,0.0013327483,0.035843514,0.0003833283,0.000019652281],"about_ca_topic_score_codex":0.02004899,"about_ca_topic_score_gemma":0.006436416,"teacher_disagreement_score":0.02004899,"about_ca_system_score_codex":0.0024272061,"about_ca_system_score_gemma":0.00252994,"threshold_uncertainty_score":0.03986454},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36475897,0.00088731403,0.586793,0.0010794847,0.0003787675,0.0004958647,0.0042222366,0.00082454033,0.040559784],"genre_scores_gemma":[0.94008,0.0005779302,0.03956993,0.00006889535,0.000034613564,0.00030912313,0.00093508465,0.000040818173,0.0183837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995061,0.000116610165,0.000030813957,0.0001253727,0.00009699062,0.00012404911],"domain_scores_gemma":[0.998928,0.000601137,0.00014747099,0.000029209907,0.00021342553,0.00008081306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008181523,0.00078223285,0.00045585097,0.00084468385,0.0006011036,0.0012331735,0.001472493,0.0008245379,0.005060968],"category_scores_gemma":[0.0016879797,0.00043942322,0.0011244537,0.0007506969,0.0005934719,0.0007370291,0.0005911928,0.0008854209,0.00040667853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056686837,0.000039730305,0.0021649932,0.000035298264,0.000019039551,0.00020155826,0.0000650755,0.9805964,0.0007043379,0.012786777,0.00032075425,0.0030094255],"study_design_scores_gemma":[0.000008681674,0.000023084085,0.00042780876,0.000006463521,0.000014572341,0.000016430064,0.000028919381,0.9962798,0.00017797058,0.0024457716,0.0005641171,0.0000063848383],"about_ca_topic_score_codex":0.09403154,"about_ca_topic_score_gemma":0.061258774,"teacher_disagreement_score":0.09403154,"about_ca_system_score_codex":0.0029061644,"about_ca_system_score_gemma":0.0037894375,"threshold_uncertainty_score":0.18696845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1348182,0.00043698755,0.8561357,0.00034488528,0.000056102745,0.00017995165,0.00022672239,0.001075638,0.006725742],"genre_scores_gemma":[0.7552003,0.00024371676,0.24184296,0.00016097115,0.000039492432,0.00014030073,0.00031158398,0.00013899931,0.0019216399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922097,0.00023109716,0.000028140537,0.00008860461,0.00016768528,0.00026353766],"domain_scores_gemma":[0.9980476,0.0012325069,0.00015575689,0.00016864108,0.00019854713,0.00019691825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013637091,0.0007249256,0.0006020376,0.0008342241,0.00059671514,0.0009962982,0.0014080784,0.00085156236,0.0031146605],"category_scores_gemma":[0.0039558243,0.0005223991,0.0005497013,0.0008485957,0.0004111951,0.00089904846,0.0008153675,0.0008782198,0.00035011585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088149936,0.000073373485,0.0009400288,0.000042083728,0.00002521704,0.00004039383,0.00008127028,0.951812,0.0014473556,0.008028046,0.002265424,0.0351566],"study_design_scores_gemma":[0.000017498838,0.000029364965,0.00026938057,0.000005168598,0.000008170275,0.000018876473,0.000021047746,0.993155,0.0005067389,0.0055477866,0.00041523372,0.0000058308965],"about_ca_topic_score_codex":0.007855591,"about_ca_topic_score_gemma":0.00829572,"teacher_disagreement_score":0.007855591,"about_ca_system_score_codex":0.002264654,"about_ca_system_score_gemma":0.0020439152,"threshold_uncertainty_score":0.016431272},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44622475,0.003499876,0.5306802,0.00067110773,0.0001440763,0.00009093315,0.00012605592,0.00045315933,0.018109825],"genre_scores_gemma":[0.9755996,0.00085007923,0.016452497,0.000070863345,0.00013450604,0.000027974966,0.00003347782,0.00006376475,0.006767299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992716,0.000203912,0.000017294888,0.00009404346,0.0002609082,0.00015234873],"domain_scores_gemma":[0.99772865,0.001701716,0.00014686568,0.00011376695,0.00022699284,0.000082016915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015904633,0.0008496204,0.00081932487,0.0010238591,0.0007710908,0.0014654093,0.0011170518,0.00078271644,0.0036793442],"category_scores_gemma":[0.0046192002,0.0004349984,0.00043166976,0.001407829,0.0010972536,0.0016431927,0.00073808385,0.00087442686,0.00030911068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050732825,0.00014804219,0.0014605391,0.00010320278,0.00008787554,0.0002367425,0.00020296099,0.8138174,0.016090874,0.13874823,0.0014826552,0.02711422],"study_design_scores_gemma":[0.0000051036973,0.000053985197,0.00021427567,0.0000032335256,0.000015970616,0.000030025061,0.000011569688,0.9934695,0.000993608,0.005013432,0.00018207256,0.0000071700797],"about_ca_topic_score_codex":0.0049287016,"about_ca_topic_score_gemma":0.0022150984,"teacher_disagreement_score":0.0049287016,"about_ca_system_score_codex":0.0023035533,"about_ca_system_score_gemma":0.0010177516,"threshold_uncertainty_score":0.01671356},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13092381,0.0013594978,0.71475196,0.0011195717,0.0008043688,0.00062051916,0.0027842526,0.0077858865,0.13985014],"genre_scores_gemma":[0.7530179,0.0012649223,0.11107215,0.0005370539,0.00050461217,0.0005011066,0.0036935562,0.000897848,0.1285109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995609,0.000057466325,0.000015208484,0.00012418113,0.00013711335,0.00010499089],"domain_scores_gemma":[0.9995426,0.000089364155,0.000021746699,0.00016028507,0.00014590753,0.00003995854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033667553,0.000614147,0.0009013209,0.00063638587,0.0014918078,0.00171058,0.0012157878,0.00048058873,0.015566642],"category_scores_gemma":[0.00093714223,0.0003381109,0.0004044684,0.0016504271,0.0002841379,0.0014054578,0.0013766021,0.000686523,0.005424424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007784438,0.00031368836,0.0029108634,0.00041660838,0.00012276226,0.0006801928,0.00054813054,0.3378752,0.038552187,0.21705149,0.12811732,0.2726331],"study_design_scores_gemma":[0.000038521794,0.00012668618,0.0018115998,0.000031056265,0.000042012874,0.00032520734,0.00026616108,0.87400186,0.012555774,0.031290714,0.07946689,0.000043555814],"about_ca_topic_score_codex":0.0050701243,"about_ca_topic_score_gemma":0.0063959556,"teacher_disagreement_score":0.015566642,"about_ca_system_score_codex":0.0013806636,"about_ca_system_score_gemma":0.0009827572,"threshold_uncertainty_score":0.052075624},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4456198,0.0013504274,0.54014945,0.0026494886,0.00027146522,0.00015600893,0.0004899339,0.0005694042,0.008743985],"genre_scores_gemma":[0.98820156,0.00035539764,0.0076141404,0.0001158091,0.00010050363,0.000051256648,0.00009488098,0.00003793548,0.0034285383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848676,0.0004188243,0.00006224579,0.00024968936,0.00032007805,0.0004623485],"domain_scores_gemma":[0.9886191,0.0086015,0.0011435531,0.00035244325,0.0007449904,0.0005384378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041516083,0.0010864498,0.002113883,0.0015882561,0.0013324795,0.0032696861,0.002507305,0.0034891148,0.0031145094],"category_scores_gemma":[0.02143735,0.0011790853,0.0009295935,0.0013976876,0.0028014318,0.00457778,0.0019454364,0.0021753386,0.0002823012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003221143,0.00010168811,0.0015290006,0.00008338742,0.000042627675,0.00027277315,0.00022019875,0.8072574,0.002101485,0.18195888,0.0014555311,0.004654924],"study_design_scores_gemma":[0.000012999547,0.000009827398,0.00014565031,0.000004844922,0.000009974496,0.000016649283,0.000009458525,0.985308,0.00013180487,0.014270737,0.00006702083,0.000013058879],"about_ca_topic_score_codex":0.010249371,"about_ca_topic_score_gemma":0.0041080914,"teacher_disagreement_score":0.010249371,"about_ca_system_score_codex":0.0035487742,"about_ca_system_score_gemma":0.002271103,"threshold_uncertainty_score":0.025748253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6361999,0.0016415712,0.3372725,0.0022126567,0.00027140277,0.0003760368,0.00039811528,0.0047292784,0.016898502],"genre_scores_gemma":[0.9484674,0.00013794222,0.047459126,0.000080141326,0.000044599245,0.00007836972,0.00015784234,0.00014426939,0.0034303572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989999,0.00028558576,0.00005897607,0.00024146703,0.00013324729,0.0002808843],"domain_scores_gemma":[0.99540484,0.002776588,0.00045943257,0.0003442972,0.0005908733,0.00042396924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014723935,0.001040893,0.0021962954,0.0012184741,0.0012028156,0.0016258569,0.0021752974,0.0018566817,0.008676486],"category_scores_gemma":[0.010247194,0.0010304928,0.0006460164,0.0012074617,0.0009798631,0.0034382984,0.0009881387,0.001091791,0.0016261595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017029822,0.00048264524,0.003652481,0.00023715332,0.00006511828,0.00007736632,0.00007546998,0.8693986,0.007002766,0.007177509,0.0053751264,0.10475285],"study_design_scores_gemma":[0.00006844688,0.00014041174,0.00060275925,0.0000048582206,0.00002039929,0.000022083874,0.00004639269,0.99478585,0.0011778156,0.002754436,0.00036662054,0.000009953678],"about_ca_topic_score_codex":0.008095097,"about_ca_topic_score_gemma":0.010388937,"teacher_disagreement_score":0.008676486,"about_ca_system_score_codex":0.0019320044,"about_ca_system_score_gemma":0.0025745546,"threshold_uncertainty_score":0.029025793},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030865239,0.00028728615,0.9676913,0.000030571904,0.000017168119,0.000035957426,0.000021428388,0.00018780124,0.0008632429],"genre_scores_gemma":[0.73158497,0.0005086704,0.26603833,0.000040788476,0.00005170436,0.00021339291,0.00009498521,0.00006387962,0.0014032357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979911,0.0007249693,0.00007581317,0.000119666656,0.0009229709,0.00016558154],"domain_scores_gemma":[0.9968646,0.0017995186,0.00042223083,0.0002336976,0.00056495826,0.000114994065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003642453,0.00096835184,0.00090908847,0.0016529165,0.0006160496,0.0011914758,0.0014991794,0.0012099532,0.0011425763],"category_scores_gemma":[0.009743214,0.0005282608,0.00045707577,0.001362193,0.0010136589,0.0019904778,0.00092739513,0.0009303577,0.00023021678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000634915,0.00008365211,0.0021254376,0.00006457196,0.000049347876,0.000051557512,0.000066456516,0.9313736,0.007465127,0.029364863,0.00020156361,0.02909038],"study_design_scores_gemma":[0.000002968985,0.000019428018,0.00024942326,0.0000025824797,0.0000052524856,0.0000129657055,0.0000051099996,0.99687284,0.00072562945,0.001963409,0.00013416,0.0000061651767],"about_ca_topic_score_codex":0.004758699,"about_ca_topic_score_gemma":0.0030266964,"teacher_disagreement_score":0.004758699,"about_ca_system_score_codex":0.001568445,"about_ca_system_score_gemma":0.0014222581,"threshold_uncertainty_score":0.019263387},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05762303,0.0016854651,0.92141354,0.004354892,0.000543161,0.00020620825,0.00072212535,0.00054271414,0.012908873],"genre_scores_gemma":[0.8752149,0.0030865152,0.11020188,0.0011982572,0.0012070161,0.0005553185,0.00085569563,0.00039569117,0.007284829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99485445,0.0013444142,0.00038445243,0.001129009,0.0014706113,0.00081705104],"domain_scores_gemma":[0.9159773,0.06467992,0.004819574,0.0028833414,0.008515756,0.0031241744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008630675,0.0015705625,0.0031942634,0.0024084672,0.002534082,0.004699844,0.004523776,0.0045811865,0.008698201],"category_scores_gemma":[0.08450648,0.0018579954,0.0026697067,0.0019632222,0.004788361,0.011683321,0.005376889,0.010435809,0.0010752974],"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.00047267,0.00021343814,0.0019239545,0.0005379324,0.00012773556,0.0006466884,0.00089112535,0.09758511,0.0110521875,0.8703353,0.004995851,0.01121809],"study_design_scores_gemma":[0.00014223036,0.00006955468,0.0006587877,0.00013019482,0.000064653956,0.0002450504,0.00018014651,0.6625351,0.003416532,0.32973284,0.0027402304,0.00008473781],"about_ca_topic_score_codex":0.006232316,"about_ca_topic_score_gemma":0.0031069932,"teacher_disagreement_score":0.008698201,"about_ca_system_score_codex":0.0050286213,"about_ca_system_score_gemma":0.005916325,"threshold_uncertainty_score":0.045643926},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06503688,0.020077838,0.86206555,0.009367122,0.002137555,0.00019669255,0.00093650987,0.0012072154,0.03897463],"genre_scores_gemma":[0.87258035,0.015410043,0.072710045,0.0033667316,0.0042649875,0.00070378167,0.0011108879,0.0009821284,0.028871099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9893305,0.0028272988,0.0004271798,0.0012900291,0.0034639866,0.0026610673],"domain_scores_gemma":[0.8778398,0.09495259,0.004242608,0.0061288644,0.011382549,0.005453646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023870783,0.006111391,0.005760282,0.009303924,0.0046927943,0.015504863,0.013323719,0.0052773124,0.01425638],"category_scores_gemma":[0.09675454,0.0036873345,0.0024647545,0.009008217,0.0090797115,0.025158174,0.012894604,0.012076008,0.0020005961],"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.00047782567,0.00013787493,0.0007043317,0.00042006373,0.0001209944,0.0001755477,0.0007075454,0.12062261,0.0015831896,0.8527037,0.008539193,0.013807138],"study_design_scores_gemma":[0.000063897445,0.00007341727,0.0004078315,0.00021055293,0.00013150426,0.00008999004,0.00014793716,0.45346352,0.00059333764,0.5414649,0.0032611948,0.0000918956],"about_ca_topic_score_codex":0.011519438,"about_ca_topic_score_gemma":0.00978382,"teacher_disagreement_score":0.023870783,"about_ca_system_score_codex":0.01866523,"about_ca_system_score_gemma":0.007338302,"threshold_uncertainty_score":0.13542634},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4557852,0.0009788113,0.5280692,0.00341219,0.0009642945,0.000250094,0.00095605187,0.0015020173,0.008082197],"genre_scores_gemma":[0.98407483,0.00009950898,0.012052922,0.0002158498,0.00020666243,0.00003600747,0.00011574429,0.000029769337,0.003168635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977685,0.0004420417,0.00007873427,0.0004862542,0.000343136,0.0008812613],"domain_scores_gemma":[0.9957581,0.0017201734,0.0005484572,0.00057357684,0.00072872435,0.000671002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030889004,0.00079217856,0.0018284798,0.0010738238,0.0018576547,0.0033223191,0.0035131474,0.0023138137,0.0039447774],"category_scores_gemma":[0.007529172,0.0007136212,0.0006301164,0.0018136055,0.0019343382,0.0020626797,0.0020363445,0.002017581,0.0006475143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021693336,0.00038294095,0.009401761,0.00020788446,0.00016527226,0.0014451264,0.00043417758,0.7711257,0.011491934,0.15246403,0.01109757,0.03961437],"study_design_scores_gemma":[0.00007944716,0.00007825529,0.00071106036,0.0000038705552,0.000031169537,0.00009441558,0.000040123945,0.9868934,0.0006972012,0.010857265,0.0004885166,0.00002514597],"about_ca_topic_score_codex":0.013499483,"about_ca_topic_score_gemma":0.014950176,"teacher_disagreement_score":0.013499483,"about_ca_system_score_codex":0.003446158,"about_ca_system_score_gemma":0.0023546338,"threshold_uncertainty_score":0.02684176},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020769237,0.0012201159,0.959433,0.0012328657,0.0004671055,0.00009816354,0.00014767636,0.00034663442,0.016285164],"genre_scores_gemma":[0.67567426,0.0028568758,0.25708327,0.0009489204,0.00090357393,0.00036192194,0.00031831124,0.0004553586,0.061397597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993356,0.00009347738,0.000021928381,0.0001073828,0.00026094157,0.00018073687],"domain_scores_gemma":[0.9988513,0.00052897254,0.00009557992,0.00004326459,0.0003229119,0.0001579584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016666515,0.0011934009,0.0014989903,0.0012637813,0.0014482656,0.0024804554,0.0027010504,0.0034062606,0.0068931784],"category_scores_gemma":[0.0056569255,0.0010726766,0.001148664,0.0019333693,0.0014039028,0.0022204935,0.00214192,0.002338925,0.001235765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007262158,0.0000927666,0.00045672397,0.00015620935,0.000035554134,0.00029909404,0.0002104008,0.7453011,0.0037735575,0.22890277,0.0058222455,0.014876936],"study_design_scores_gemma":[0.000011564875,0.000011603055,0.00004498349,0.000011511079,0.000009891028,0.00004724622,0.000023831342,0.9828599,0.0001733472,0.015966827,0.0008288598,0.000010467611],"about_ca_topic_score_codex":0.0118977325,"about_ca_topic_score_gemma":0.00792138,"teacher_disagreement_score":0.0118977325,"about_ca_system_score_codex":0.0033542614,"about_ca_system_score_gemma":0.0050250557,"threshold_uncertainty_score":0.024336994},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17652763,0.0054116556,0.7929742,0.002060173,0.00030906426,0.00015205417,0.00040139144,0.000699124,0.02146481],"genre_scores_gemma":[0.96658987,0.0022087793,0.020631384,0.00019169382,0.00039803082,0.00008711748,0.00018370974,0.00015159618,0.009557979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842346,0.00050346635,0.00004709601,0.00022654084,0.00046397152,0.00033544388],"domain_scores_gemma":[0.98832357,0.008974781,0.0007274119,0.00035782927,0.0012159873,0.00040040613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004159142,0.0014983367,0.0017624468,0.002169825,0.0010589532,0.0025187966,0.0027221995,0.0019453105,0.004914044],"category_scores_gemma":[0.014721468,0.0010388225,0.0009824885,0.0028825237,0.0020600273,0.003516668,0.0018983262,0.0019487082,0.00061876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014534673,0.000055618166,0.00042885958,0.00007495999,0.000047498434,0.00007872607,0.00006748565,0.9230841,0.0016870302,0.064098574,0.0014708829,0.0087609],"study_design_scores_gemma":[0.0000039755064,0.000027678667,0.00009495339,0.000005949037,0.000012052138,0.000022381568,0.000010262471,0.989183,0.00016682314,0.0103345355,0.00013040984,0.00000801856],"about_ca_topic_score_codex":0.006826641,"about_ca_topic_score_gemma":0.00300112,"teacher_disagreement_score":0.006826641,"about_ca_system_score_codex":0.004358223,"about_ca_system_score_gemma":0.00201254,"threshold_uncertainty_score":0.031621218},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019109119,0.30276325,0.6366862,0.0055922573,0.0026685733,0.00016078974,0.00041340303,0.0006316968,0.04917286],"genre_scores_gemma":[0.07366913,0.4633523,0.42245454,0.002318717,0.008591732,0.00056672946,0.0007427084,0.00054451654,0.027759679],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99692243,0.0011700602,0.00021169227,0.00035967305,0.0012480885,0.00008801634],"domain_scores_gemma":[0.9954032,0.002781906,0.0001935055,0.00030276412,0.0012017352,0.00011694313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003684417,0.0008284892,0.0008439706,0.0042683985,0.0006480668,0.003483345,0.0012845822,0.0013446234,0.006706058],"category_scores_gemma":[0.008091962,0.0005912886,0.0005750188,0.0062445602,0.0021680489,0.002933671,0.0016054567,0.0028858632,0.003929688],"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.00005900973,0.00008706912,0.00070720876,0.0025136985,0.00006289202,0.0002124161,0.00043913766,0.007881632,0.0021616102,0.3803222,0.041184787,0.56436837],"study_design_scores_gemma":[0.000013667692,0.00013403942,0.0010593537,0.0016837133,0.000029028475,0.0010146027,0.00025519033,0.028336883,0.0022038603,0.2655807,0.69958144,0.000107522785],"about_ca_topic_score_codex":0.0014138591,"about_ca_topic_score_gemma":0.00075226027,"teacher_disagreement_score":0.006706058,"about_ca_system_score_codex":0.0011700507,"about_ca_system_score_gemma":0.001682177,"threshold_uncertainty_score":0.022433996},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22532468,0.00076013675,0.7644388,0.0012962063,0.00025635603,0.0001497742,0.00004191639,0.0014648396,0.0062673],"genre_scores_gemma":[0.9827944,0.000096244876,0.01626343,0.00012523678,0.000036450154,0.000039896902,0.000008718121,0.000035888297,0.00059989525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906987,0.00037871528,0.000053739634,0.00011231942,0.00019920061,0.00018616955],"domain_scores_gemma":[0.9941069,0.004316432,0.00046387676,0.00026907361,0.0005045501,0.00033916772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018811857,0.00050400366,0.000741673,0.00048704838,0.00047085108,0.0013955162,0.0014122361,0.00089537667,0.0017942608],"category_scores_gemma":[0.013832502,0.00025484723,0.00017026467,0.00047450315,0.00066673884,0.0010471141,0.00083563355,0.0013623312,0.0002071909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001703035,0.0013193323,0.0031728041,0.00022046058,0.00010174996,0.00018448784,0.0004956578,0.6563323,0.027447272,0.10436064,0.004644953,0.20001733],"study_design_scores_gemma":[0.00013971282,0.00021748322,0.0005753177,0.000012706612,0.000031300428,0.0000275967,0.00005095176,0.96297264,0.003659836,0.0318208,0.00047408973,0.000017523655],"about_ca_topic_score_codex":0.001452295,"about_ca_topic_score_gemma":0.0014418619,"teacher_disagreement_score":0.0018811857,"about_ca_system_score_codex":0.00096929196,"about_ca_system_score_gemma":0.0019095878,"threshold_uncertainty_score":0.00994879},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019789888,0.00060491514,0.97605944,0.00053373445,0.000058631704,0.000036101006,0.00006725018,0.00013632383,0.0027137555],"genre_scores_gemma":[0.9260001,0.0010943986,0.06776552,0.0001271128,0.00017159402,0.00017185572,0.000111848596,0.00006609182,0.0044915276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919075,0.00026528095,0.00003349986,0.0001449345,0.00021187266,0.00015366584],"domain_scores_gemma":[0.9984865,0.0010042123,0.00020181696,0.000050890612,0.00015366945,0.000102785394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013792049,0.0011795936,0.0012822816,0.0007976316,0.0005661206,0.0015212775,0.0015282234,0.0013918935,0.0018917982],"category_scores_gemma":[0.0023326678,0.0010281359,0.0012428778,0.0010309883,0.0014219357,0.00114185,0.0008174532,0.0011731744,0.00015831616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001148151,0.000011809606,0.000060716455,0.000015100438,0.000013324997,0.00002176656,0.000010198805,0.9897385,0.00019005685,0.0074951295,0.0001177128,0.0023141578],"study_design_scores_gemma":[0.000005515912,0.000010713454,0.000030507941,0.0000022363606,0.000004704661,0.000002998609,0.000002918829,0.9961826,0.000083924424,0.0035486226,0.000121846875,0.0000033410201],"about_ca_topic_score_codex":0.019175783,"about_ca_topic_score_gemma":0.0091829235,"teacher_disagreement_score":0.019175783,"about_ca_system_score_codex":0.0024623254,"about_ca_system_score_gemma":0.0022708413,"threshold_uncertainty_score":0.038128316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6527015,0.0013308411,0.31960946,0.002157132,0.00026368615,0.0001424147,0.0008974794,0.00085434195,0.02204309],"genre_scores_gemma":[0.98716545,0.00034169425,0.0058008824,0.0001506218,0.00015812389,0.00006421249,0.00023237012,0.00013046995,0.0059560603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735814,0.0006462106,0.00013311955,0.00040714,0.00059584423,0.0008593635],"domain_scores_gemma":[0.98674405,0.0057246964,0.0019094,0.0012119813,0.0022503466,0.0021595561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004375154,0.0011017722,0.0014828595,0.0025510727,0.0024245013,0.0042301994,0.0032406885,0.0013107256,0.0048073637],"category_scores_gemma":[0.018234547,0.0009999322,0.0011405527,0.0014346384,0.003700336,0.0037888722,0.0034915842,0.0026701041,0.0009192707],"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.00058422785,0.0001591933,0.003684863,0.00012479292,0.00009326701,0.00069581,0.0005935982,0.10305569,0.008285706,0.8705257,0.0041064713,0.008090608],"study_design_scores_gemma":[0.00004741982,0.000073822004,0.001551243,0.000029140347,0.000041751257,0.00019947837,0.0001357103,0.8084352,0.001963851,0.18666048,0.0007793024,0.00008259389],"about_ca_topic_score_codex":0.011188535,"about_ca_topic_score_gemma":0.0057251006,"teacher_disagreement_score":0.011188535,"about_ca_system_score_codex":0.00447785,"about_ca_system_score_gemma":0.0041634794,"threshold_uncertainty_score":0.03248918},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30863124,0.0006460367,0.6869151,0.00023808978,0.00006589373,0.00004909965,0.00007958936,0.00028325367,0.003091632],"genre_scores_gemma":[0.98376447,0.0001278328,0.015099426,0.000020719539,0.000022381937,0.000019606803,0.000033948447,0.000021772285,0.0008897335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805367,0.00062398333,0.000055005792,0.00022407087,0.00067135703,0.00037188927],"domain_scores_gemma":[0.9939023,0.003910956,0.0006570091,0.00043521254,0.0009032919,0.00019125325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00519611,0.0008216939,0.0007011948,0.0011797177,0.0006698671,0.0015283427,0.00149762,0.00061587675,0.0013527973],"category_scores_gemma":[0.014771564,0.00040096717,0.00046041628,0.001015809,0.0013229803,0.0021307648,0.0009961278,0.0007109,0.0001484967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016568256,0.000033206677,0.0015704435,0.000028440556,0.000042557705,0.00007012338,0.000088857894,0.94132686,0.0032978633,0.042628996,0.00022033538,0.010526627],"study_design_scores_gemma":[0.0000038416906,0.00001844548,0.00017037161,0.0000017902736,0.0000049353694,0.000008542074,0.00000813445,0.9946214,0.00036370594,0.004733513,0.000059889848,0.000005429487],"about_ca_topic_score_codex":0.008320758,"about_ca_topic_score_gemma":0.0032670018,"teacher_disagreement_score":0.008320758,"about_ca_system_score_codex":0.0026508297,"about_ca_system_score_gemma":0.001513024,"threshold_uncertainty_score":0.027480006},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034104545,0.0005599258,0.7853185,0.0033606954,0.0004698715,0.0003629222,0.00028274843,0.00046239787,0.17507847],"genre_scores_gemma":[0.71898717,0.0007130466,0.24713056,0.0008642705,0.00022404763,0.0010263583,0.00033466838,0.0003465534,0.030373309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692625,0.0010322693,0.00028501012,0.0004669031,0.0008635117,0.0004260292],"domain_scores_gemma":[0.99306124,0.003360431,0.00043115998,0.0015825296,0.0011370829,0.0004275045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002949184,0.00064549234,0.00072578,0.003633707,0.0035226333,0.00848507,0.0018100835,0.0032646428,0.01651853],"category_scores_gemma":[0.011663994,0.0005062676,0.0012739034,0.0032989555,0.0059650536,0.008578775,0.0035818662,0.0025430818,0.0015545401],"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.0000058215937,0.00000841483,0.00021232059,0.000017797418,0.0000028145296,0.00009968268,0.00029934067,0.0016234905,0.00017666,0.9930468,0.00067614194,0.0038306906],"study_design_scores_gemma":[0.000012548282,0.000016401465,0.00012378486,0.00004738292,0.000008767175,0.00026435306,0.0011561833,0.027071353,0.00048200224,0.9472227,0.023579836,0.0000146998245],"about_ca_topic_score_codex":0.0019913816,"about_ca_topic_score_gemma":0.0017104807,"teacher_disagreement_score":0.01651853,"about_ca_system_score_codex":0.0037411223,"about_ca_system_score_gemma":0.0026070299,"threshold_uncertainty_score":0.055260003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0471921,0.0012214351,0.9364382,0.0020268257,0.0005255432,0.00011289352,0.0003836083,0.00029539893,0.011804041],"genre_scores_gemma":[0.94097936,0.0009137168,0.03574132,0.0003407515,0.0003196622,0.00015331215,0.00020820923,0.00010466103,0.021238957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888855,0.00033857863,0.000037802904,0.00020971161,0.000248417,0.0002770005],"domain_scores_gemma":[0.9984724,0.0007513468,0.00013242122,0.00011709693,0.00030079595,0.00022589523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021508026,0.0007683376,0.0015298306,0.00064185675,0.001228522,0.0032645885,0.00379091,0.0020478072,0.0065031913],"category_scores_gemma":[0.005439729,0.0007028955,0.00073424424,0.0012324988,0.0017846285,0.0030329218,0.0012177472,0.0019670508,0.000709337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001417961,0.00007949938,0.0003823748,0.000060799797,0.00002883121,0.00017709797,0.00015578233,0.69977754,0.0017718879,0.28855637,0.0033281024,0.0055398988],"study_design_scores_gemma":[0.000014364272,0.000011247583,0.000047088484,0.000003718232,0.0000067994006,0.000014793738,0.000011094685,0.9820939,0.000061739294,0.01710337,0.00062322314,0.00000871154],"about_ca_topic_score_codex":0.020420672,"about_ca_topic_score_gemma":0.010221184,"teacher_disagreement_score":0.020420672,"about_ca_system_score_codex":0.003799073,"about_ca_system_score_gemma":0.0041589662,"threshold_uncertainty_score":0.040603638},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063815996,0.0009398701,0.9273625,0.00055525545,0.00024935647,0.00004340805,0.000048051905,0.00025189048,0.0067335116],"genre_scores_gemma":[0.7741107,0.001891039,0.20892781,0.00036126302,0.0004502745,0.00013563097,0.0002238067,0.00027261712,0.013626854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980261,0.0010615311,0.000068400215,0.00017063084,0.0004330429,0.00024029256],"domain_scores_gemma":[0.97719896,0.018556932,0.0006975318,0.0010807763,0.0015524784,0.0009132879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058285547,0.0018646732,0.0017717658,0.0025620172,0.0011468012,0.0028388184,0.0021316349,0.002126541,0.002809242],"category_scores_gemma":[0.031876445,0.0009005518,0.0011158958,0.0021127537,0.0034948925,0.0057846243,0.0041595,0.0032863612,0.00038286744],"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.00021474923,0.00010373657,0.0014256823,0.00011358452,0.000042531527,0.00012889852,0.00040470486,0.30670342,0.0012872108,0.6685613,0.0014369218,0.019577293],"study_design_scores_gemma":[0.0000086163855,0.00003141447,0.0001039567,0.00001041004,0.000008253928,0.00002198937,0.00003500249,0.81821764,0.00027994593,0.18065217,0.0006188679,0.000011588081],"about_ca_topic_score_codex":0.0070962273,"about_ca_topic_score_gemma":0.0032143765,"teacher_disagreement_score":0.0070962273,"about_ca_system_score_codex":0.002366097,"about_ca_system_score_gemma":0.0015978501,"threshold_uncertainty_score":0.03082472},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02621848,0.0002525867,0.9660195,0.00049266865,0.000118775955,0.00002491817,0.000024655643,0.0001543238,0.0066940985],"genre_scores_gemma":[0.84662646,0.00088173547,0.13453583,0.00032947247,0.0004954584,0.00017529944,0.000085172425,0.00024700564,0.016623568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994966,0.00020569484,0.000018399887,0.000050729264,0.000166263,0.00006239187],"domain_scores_gemma":[0.99739885,0.0019111485,0.00014052998,0.00011864786,0.00029131988,0.00013950154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011549878,0.000702486,0.00090269215,0.0012660235,0.0008897464,0.001622407,0.0015159473,0.0012723652,0.0029820052],"category_scores_gemma":[0.006070021,0.00060091226,0.0009937491,0.0010123801,0.0013875419,0.0023560636,0.001288029,0.0017926798,0.00036941475],"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.00003117111,0.00011166828,0.00034010896,0.00004608597,0.00004171752,0.00013991816,0.00013438395,0.44016019,0.002715858,0.54701066,0.0012533149,0.008014949],"study_design_scores_gemma":[0.0000034456953,0.0000059688014,0.000036411868,0.0000022482657,0.0000038357334,0.000011097147,0.000012712232,0.91713506,0.000099334124,0.08247802,0.00020590538,0.0000060023026],"about_ca_topic_score_codex":0.0037826605,"about_ca_topic_score_gemma":0.0020406381,"teacher_disagreement_score":0.0037826605,"about_ca_system_score_codex":0.0013234131,"about_ca_system_score_gemma":0.0013190259,"threshold_uncertainty_score":0.009975731},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19667843,0.0011459461,0.78725004,0.0010284521,0.00014706893,0.0001592884,0.00017851964,0.00067121466,0.012741141],"genre_scores_gemma":[0.975104,0.0003149268,0.02035781,0.00007201081,0.000036238675,0.000054648208,0.00006350593,0.000040728268,0.003956112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992543,0.00031778618,0.000025075513,0.00012149382,0.00013676744,0.00014454119],"domain_scores_gemma":[0.99856013,0.0008842192,0.00018141035,0.00010663893,0.0001466477,0.00012093089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019788314,0.0007408166,0.0010428365,0.00068673695,0.00034138584,0.0015626268,0.0010139366,0.0013013013,0.004643437],"category_scores_gemma":[0.0048444993,0.00055988005,0.000479608,0.0004521652,0.0009770138,0.0017927685,0.0006588032,0.001171521,0.00034388358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023067718,0.00010611196,0.00048973813,0.00007816128,0.000029050374,0.00007623478,0.00006660117,0.9195233,0.0028588017,0.047511525,0.001173233,0.027856553],"study_design_scores_gemma":[0.000029291592,0.00008234969,0.00026694077,0.000009931465,0.000011252245,0.000013048016,0.000014143377,0.97974914,0.0006202881,0.018622523,0.0005716401,0.000009509687],"about_ca_topic_score_codex":0.0018801589,"about_ca_topic_score_gemma":0.00089408696,"teacher_disagreement_score":0.004643437,"about_ca_system_score_codex":0.0015902006,"about_ca_system_score_gemma":0.0011196,"threshold_uncertainty_score":0.0155338645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077518605,0.0008784591,0.90780514,0.0012621118,0.000100684374,0.00006857793,0.00037864782,0.00045677542,0.011530955],"genre_scores_gemma":[0.98981655,0.00025762987,0.0059190234,0.00006920234,0.00006124967,0.000104712075,0.00013745674,0.000042818134,0.0035913961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977398,0.0006177931,0.00012259468,0.0004490085,0.000650025,0.00042077532],"domain_scores_gemma":[0.994703,0.0026227457,0.0014359424,0.00019472865,0.0008576898,0.00018591047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024114859,0.0017369946,0.0017697808,0.000769993,0.0006983914,0.0024551712,0.0015031319,0.001859294,0.0021719837],"category_scores_gemma":[0.008158375,0.00082730426,0.00077572686,0.0008382258,0.0018635197,0.0017574732,0.0019158033,0.0014293996,0.00034573197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000572998,0.000020545489,0.00023261526,0.00007242593,0.000031136253,0.00012065274,0.000053485794,0.94536495,0.0008688659,0.049689803,0.00038827473,0.0030998352],"study_design_scores_gemma":[0.000012125228,0.000026551152,0.00012517851,0.0000049851083,0.000005564845,0.000012080468,0.0000096386575,0.9876605,0.00018417781,0.011775089,0.00017572443,0.00000835089],"about_ca_topic_score_codex":0.011401913,"about_ca_topic_score_gemma":0.00419001,"teacher_disagreement_score":0.011401913,"about_ca_system_score_codex":0.0024469495,"about_ca_system_score_gemma":0.0015164958,"threshold_uncertainty_score":0.022671103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09808946,0.00061141833,0.88960737,0.0006940635,0.00013256575,0.000064253945,0.000103789615,0.00024001098,0.010457079],"genre_scores_gemma":[0.9764215,0.0002504666,0.019735845,0.00005737633,0.000048131384,0.00006439904,0.000042722884,0.000025044928,0.0033545443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993874,0.00017691102,0.00001971043,0.00015227792,0.00011282789,0.00015092411],"domain_scores_gemma":[0.99906224,0.00048781701,0.00018712558,0.000030289175,0.00012997187,0.00010258752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010580261,0.00073301943,0.00094711717,0.00055021973,0.00081762346,0.0016147477,0.00091450434,0.0009384722,0.0014343495],"category_scores_gemma":[0.0025667106,0.00044306368,0.0003749825,0.0005463395,0.0012132862,0.0011527714,0.00095492415,0.00079525425,0.00013345425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043111755,0.000014313693,0.000112549846,0.000019954045,0.000009275805,0.00003168716,0.000023851822,0.97293687,0.0005968216,0.021584706,0.00038138285,0.004245483],"study_design_scores_gemma":[0.0000052046657,0.0000061015717,0.000024660045,0.0000012653431,0.0000016412074,0.0000019833856,0.000004210668,0.9959329,0.0000583807,0.0038057005,0.00015580605,0.0000021322967],"about_ca_topic_score_codex":0.017824179,"about_ca_topic_score_gemma":0.008033567,"teacher_disagreement_score":0.017824179,"about_ca_system_score_codex":0.0024084982,"about_ca_system_score_gemma":0.0015983408,"threshold_uncertainty_score":0.035440862},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1305262,0.002161209,0.84525484,0.0040018647,0.00034570735,0.00008704026,0.00015055695,0.00028766698,0.017185016],"genre_scores_gemma":[0.9334146,0.0015932892,0.051963564,0.0004887508,0.00031108738,0.00014583474,0.00019558161,0.00014369693,0.011743614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982394,0.00064850174,0.00007674669,0.00026481028,0.0004665422,0.0003039678],"domain_scores_gemma":[0.9704213,0.023187691,0.0015635462,0.00072151585,0.002784841,0.001321023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061301994,0.00081533566,0.0014733683,0.0018717679,0.0014760315,0.0031061117,0.0022356447,0.0021697825,0.004028236],"category_scores_gemma":[0.04864143,0.0011460651,0.00095605565,0.0010774913,0.0032566201,0.0055511487,0.0032264641,0.005225705,0.00038673455],"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.00019580961,0.000069493624,0.0010652245,0.00014516157,0.000041843665,0.00015663587,0.00054427335,0.114343606,0.0032867535,0.8685653,0.0022157137,0.009370172],"study_design_scores_gemma":[0.000022174494,0.000017361923,0.00022860777,0.000032093994,0.000014030993,0.000048856356,0.000073630676,0.84511447,0.0005381419,0.15303585,0.0008558448,0.000018938328],"about_ca_topic_score_codex":0.004573712,"about_ca_topic_score_gemma":0.0025293988,"teacher_disagreement_score":0.0061301994,"about_ca_system_score_codex":0.0044572745,"about_ca_system_score_gemma":0.002398089,"threshold_uncertainty_score":0.03241998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8702715,0.0026793836,0.11765881,0.0016222984,0.00011872215,0.000065574604,0.00039789872,0.00073975814,0.006446015],"genre_scores_gemma":[0.9866773,0.00039526902,0.012123681,0.00006661785,0.000025996134,0.000026205647,0.00028372338,0.000065184904,0.00033601213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960329,0.0022976678,0.00021252465,0.00033239074,0.0009266218,0.00019788594],"domain_scores_gemma":[0.8662071,0.11839166,0.004427191,0.005952732,0.0042539556,0.0007673162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01106083,0.00060810056,0.00070525735,0.0018434997,0.00053298264,0.0015676327,0.001363654,0.0019299163,0.0012342117],"category_scores_gemma":[0.10697199,0.00038600876,0.0003601932,0.0019653908,0.0011499018,0.0034814319,0.0010510129,0.0012932732,0.00017528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068334653,0.0002265312,0.024033777,0.00014826756,0.000081832724,0.00010367529,0.0005905032,0.9088465,0.0011763931,0.0294472,0.0013727817,0.033289224],"study_design_scores_gemma":[0.000016185599,0.000054771575,0.0023636445,0.00003535769,0.000008669073,0.00005054174,0.00008387403,0.99238425,0.00046733822,0.004020752,0.000500792,0.000013686967],"about_ca_topic_score_codex":0.009182667,"about_ca_topic_score_gemma":0.00396056,"teacher_disagreement_score":0.01106083,"about_ca_system_score_codex":0.0023960606,"about_ca_system_score_gemma":0.00063689036,"threshold_uncertainty_score":0.058496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8088068,0.008952187,0.145631,0.008369301,0.00025908827,0.00040532727,0.001559678,0.0004994541,0.025517303],"genre_scores_gemma":[0.97791445,0.0038064355,0.015144189,0.0003502276,0.00013755495,0.00014271648,0.0007453972,0.000090044414,0.0016688654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99275935,0.0037117756,0.0005662592,0.00069439167,0.0018203936,0.00044785734],"domain_scores_gemma":[0.898429,0.07988643,0.006809889,0.006799039,0.0070927483,0.0009828875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011651215,0.00075432693,0.00073862425,0.0022268149,0.0011618459,0.003199308,0.0024090137,0.002140531,0.002942835],"category_scores_gemma":[0.10387173,0.0005809762,0.0008154825,0.0058519077,0.001701862,0.007615921,0.0013158758,0.0027046003,0.0007247681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054214086,0.0019192657,0.27916962,0.0009001219,0.00034827183,0.00071120734,0.0054515777,0.29354128,0.0014670863,0.28117236,0.021443699,0.11333346],"study_design_scores_gemma":[0.000105211424,0.0004851128,0.05690848,0.00039443775,0.00013743977,0.0007264212,0.00296568,0.8078067,0.0015685409,0.09913593,0.029622626,0.00014340735],"about_ca_topic_score_codex":0.01407955,"about_ca_topic_score_gemma":0.0065185633,"teacher_disagreement_score":0.01407955,"about_ca_system_score_codex":0.0035715252,"about_ca_system_score_gemma":0.0019628913,"threshold_uncertainty_score":0.06161827},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005453807,0.00008550627,0.99335194,0.00002581683,0.000013111398,0.000025016136,0.000011445458,0.00015555842,0.00087768724],"genre_scores_gemma":[0.5067191,0.0003225816,0.48776633,0.00009376565,0.000049791674,0.00035388608,0.00011404245,0.00014239721,0.0044381735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992155,0.0002972088,0.000027790054,0.000059749233,0.00032910568,0.0000706194],"domain_scores_gemma":[0.9981006,0.0011681903,0.0001329085,0.00025321572,0.00028636376,0.000058798083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013188901,0.00033386517,0.00062211487,0.0005864934,0.0004557803,0.00063999364,0.0012027766,0.00066438556,0.003293538],"category_scores_gemma":[0.0048962617,0.0003408653,0.0005480332,0.00080847065,0.0008122764,0.0010972249,0.0007206959,0.000899428,0.00048536676],"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.00013493116,0.000035036166,0.0006675601,0.00006914579,0.000026461776,0.000067437126,0.00011310957,0.8713234,0.0040814327,0.07509867,0.0008086256,0.047574226],"study_design_scores_gemma":[0.0000055073797,0.000014245167,0.00004546436,0.0000031024867,0.0000034209536,0.000015572214,0.000004817858,0.9911107,0.00039016615,0.0077252793,0.00067854114,0.0000031345708],"about_ca_topic_score_codex":0.0031747222,"about_ca_topic_score_gemma":0.0018897842,"teacher_disagreement_score":0.003293538,"about_ca_system_score_codex":0.0012631177,"about_ca_system_score_gemma":0.00094367814,"threshold_uncertainty_score":0.011017978},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02507153,0.0030726797,0.9601087,0.0005215101,0.00016857598,0.00006595829,0.000112735965,0.0005635866,0.010314719],"genre_scores_gemma":[0.8305032,0.005081576,0.1561887,0.00041620387,0.0007889711,0.00031852289,0.0002231153,0.0003154443,0.006164316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980421,0.00040659783,0.000052990243,0.00020966103,0.001053367,0.00023527433],"domain_scores_gemma":[0.9895331,0.007648203,0.0005805025,0.00090878934,0.0009438224,0.0003856096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029931178,0.0017670804,0.0012156616,0.0021778375,0.0008864888,0.002300827,0.0022865532,0.0016173704,0.0052359174],"category_scores_gemma":[0.018849984,0.0006984187,0.00050938805,0.001460105,0.00267563,0.0039641825,0.0020588934,0.0028748878,0.0014307909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021255399,0.00018621178,0.0018983226,0.0004934293,0.000082315506,0.00043473492,0.00029277784,0.61420846,0.022298666,0.2732595,0.004908314,0.08172472],"study_design_scores_gemma":[0.000016025015,0.0000461075,0.00072819693,0.00006337509,0.00003162721,0.0002244833,0.000019138177,0.8671342,0.0035535325,0.12497462,0.0031623438,0.00004634357],"about_ca_topic_score_codex":0.0011375704,"about_ca_topic_score_gemma":0.0010889118,"teacher_disagreement_score":0.0052359174,"about_ca_system_score_codex":0.0014323143,"about_ca_system_score_gemma":0.00070565403,"threshold_uncertainty_score":0.017515838},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21964979,0.001088068,0.7747829,0.00042039042,0.000113021844,0.00006280291,0.000057950736,0.00033807216,0.0034870626],"genre_scores_gemma":[0.971787,0.00037574046,0.025224905,0.0000857051,0.000045965855,0.000023805758,0.000035717665,0.000021366855,0.0023998294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985208,0.0006650189,0.00007828857,0.00018940713,0.00031667436,0.00022989366],"domain_scores_gemma":[0.9941454,0.003772936,0.0006866088,0.0004237384,0.00067594455,0.00029526508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037978261,0.00064512616,0.0006906096,0.00045962518,0.00042479936,0.0011144541,0.001067972,0.001176993,0.0014235853],"category_scores_gemma":[0.009378593,0.00048181065,0.00035219477,0.00046372082,0.0009120261,0.001752737,0.0007425298,0.0016203815,0.0002454027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002492214,0.00007142982,0.0012821927,0.0000587874,0.00002546836,0.00013620945,0.00009893868,0.9198578,0.005495346,0.050522335,0.00062012364,0.021582149],"study_design_scores_gemma":[0.000016697799,0.00013907143,0.0004727022,0.000006996003,0.000010532093,0.000045359244,0.000014206121,0.9778389,0.0028245323,0.018119456,0.0004961846,0.00001540772],"about_ca_topic_score_codex":0.00074195437,"about_ca_topic_score_gemma":0.0005054585,"teacher_disagreement_score":0.0037978261,"about_ca_system_score_codex":0.0011609204,"about_ca_system_score_gemma":0.000671777,"threshold_uncertainty_score":0.020085096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019009434,0.00017838068,0.9798947,0.000041772957,0.000009258543,0.000014987839,0.000018777479,0.00024713183,0.00058554433],"genre_scores_gemma":[0.6745425,0.00038816544,0.32350475,0.000043938748,0.000054510834,0.00009403415,0.0001373304,0.00010134591,0.0011335914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990753,0.00033051785,0.00003155889,0.00011287864,0.00038414233,0.0000655976],"domain_scores_gemma":[0.99666685,0.0026024908,0.00018830225,0.00022347631,0.00027463006,0.000044252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019773957,0.00034273363,0.00052917475,0.0010361257,0.00030841128,0.0007992263,0.00056923553,0.0003548495,0.0010690754],"category_scores_gemma":[0.009507273,0.00021314021,0.00042584745,0.0010652336,0.0005295118,0.0010478981,0.0004623959,0.0007073062,0.00016932016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014307347,0.000042423726,0.004090583,0.00009113769,0.000059650887,0.00013708266,0.0001668384,0.71981406,0.008374294,0.052636776,0.0011258237,0.21331823],"study_design_scores_gemma":[0.0000026545526,0.00002428102,0.00055140525,0.00000440681,0.0000046348214,0.000029550156,0.000014237818,0.97800577,0.0014633719,0.019410603,0.00048224494,0.000006845531],"about_ca_topic_score_codex":0.0015344446,"about_ca_topic_score_gemma":0.0010584384,"teacher_disagreement_score":0.0019773957,"about_ca_system_score_codex":0.0005685144,"about_ca_system_score_gemma":0.0005820692,"threshold_uncertainty_score":0.010457635},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07352656,0.00028590282,0.90829986,0.0006539321,0.0001622521,0.00013476543,0.0002657423,0.0009696415,0.015701363],"genre_scores_gemma":[0.6639645,0.00024605714,0.3230982,0.0003237415,0.00019421146,0.0003384412,0.00038870084,0.00045490908,0.010991203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967253,0.000085767526,0.000015056365,0.00006419165,0.00009761741,0.00006496095],"domain_scores_gemma":[0.9982134,0.0011599332,0.00011351199,0.000250985,0.00020107774,0.00006104085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007113222,0.00089680305,0.00074938394,0.0004622223,0.00064837415,0.0010056582,0.0012992907,0.0009108112,0.0074896677],"category_scores_gemma":[0.0060630683,0.00033284567,0.0011190478,0.0006964477,0.0006451295,0.002164149,0.0012892798,0.0017048921,0.000923779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006438889,0.00016873729,0.0015960702,0.00012103561,0.000045096727,0.0002696769,0.00019042446,0.85225666,0.0029144972,0.095521554,0.0040543634,0.042797502],"study_design_scores_gemma":[0.0000039898523,0.000007092245,0.000086270564,0.0000024054855,0.0000031944335,0.00001687364,0.000012931042,0.9866862,0.00022617476,0.012524719,0.00042591212,0.0000042810293],"about_ca_topic_score_codex":0.0056139,"about_ca_topic_score_gemma":0.0072785374,"teacher_disagreement_score":0.0074896677,"about_ca_system_score_codex":0.0009901003,"about_ca_system_score_gemma":0.0015969245,"threshold_uncertainty_score":0.025055468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035798948,0.0003353691,0.99249214,0.00027935914,0.000082019265,0.00003332685,0.00003256129,0.00008728774,0.0030780674],"genre_scores_gemma":[0.60388213,0.0013305863,0.38403288,0.000417635,0.00064745237,0.00059992616,0.000117340096,0.00011756614,0.008854331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985207,0.0005210432,0.000069122034,0.00030665158,0.000439318,0.00014312],"domain_scores_gemma":[0.9977512,0.0012353783,0.00023202343,0.0002261227,0.00037065256,0.00018469433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032619827,0.00096559717,0.0010468598,0.0005797073,0.0010769048,0.0024219735,0.0030902678,0.0014314777,0.0032617531],"category_scores_gemma":[0.005152398,0.0005392388,0.0009888673,0.0008928347,0.0030789538,0.002950567,0.0014084546,0.002945769,0.0004402232],"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.000021264335,0.000034306315,0.00012567196,0.000041248455,0.000014043144,0.00005959392,0.0001487773,0.17692849,0.0014459603,0.8084734,0.0007827093,0.011924543],"study_design_scores_gemma":[0.000017396482,0.00004791555,0.000055822806,0.000018965602,0.000012164245,0.00002243064,0.00002493243,0.6980308,0.0004203959,0.29581296,0.005518971,0.00001718705],"about_ca_topic_score_codex":0.0034640422,"about_ca_topic_score_gemma":0.0021200578,"teacher_disagreement_score":0.0034640422,"about_ca_system_score_codex":0.0021027145,"about_ca_system_score_gemma":0.0017555242,"threshold_uncertainty_score":0.017251194},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35784206,0.0006278797,0.62764186,0.0012354727,0.00015095032,0.0001405523,0.00038206388,0.00034983546,0.011629325],"genre_scores_gemma":[0.9898024,0.0001394626,0.0063627763,0.000052536227,0.000036848054,0.00007289315,0.00008885494,0.00002272144,0.0034214756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981609,0.0005195364,0.00007857639,0.0003502063,0.0004101073,0.00048062872],"domain_scores_gemma":[0.9949838,0.0023993938,0.0010206517,0.00014109453,0.0010013697,0.00045370858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022568742,0.0007693883,0.0012543501,0.0010231911,0.000982974,0.0018625816,0.002140477,0.0012676676,0.0039176918],"category_scores_gemma":[0.007334764,0.00055965676,0.0010337264,0.0005329189,0.0017199093,0.0023299383,0.0014968051,0.0016398544,0.00035123446],"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.0002038473,0.00010151898,0.0030185736,0.00011335741,0.00007699844,0.00052946404,0.00037739027,0.834232,0.0046765916,0.15308194,0.001205926,0.0023823837],"study_design_scores_gemma":[0.000015034551,0.000023248691,0.00019230522,0.0000050453564,0.000008842994,0.000028606144,0.000025436182,0.9880823,0.00015785969,0.011310314,0.00014064454,0.000010437037],"about_ca_topic_score_codex":0.012878676,"about_ca_topic_score_gemma":0.0041570687,"teacher_disagreement_score":0.012878676,"about_ca_system_score_codex":0.0031009847,"about_ca_system_score_gemma":0.0022908691,"threshold_uncertainty_score":0.025607467},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.962933,0.00031892015,0.029981362,0.00024466126,0.00004485315,0.000045239954,0.00011955378,0.0004711204,0.0058412766],"genre_scores_gemma":[0.9972294,0.00005960483,0.0017912659,0.000013202921,0.0000049467585,0.000006109765,0.000038181777,0.000013398284,0.00084375736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930155,0.00022223241,0.000022346643,0.000080657606,0.00019539357,0.00017781458],"domain_scores_gemma":[0.99695337,0.0017982556,0.00017301276,0.000118403084,0.00073568046,0.00022125755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013437292,0.00054059457,0.000571148,0.0007241988,0.0007217811,0.0010301404,0.0010246636,0.00064550806,0.0032416543],"category_scores_gemma":[0.0036753262,0.00016020358,0.00024229799,0.00092288025,0.0006781423,0.0008577601,0.0005193019,0.00040469496,0.00026275788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010282736,0.0001260444,0.0029659672,0.00010231498,0.0000573668,0.00017704038,0.00011546558,0.9491422,0.023563663,0.007047441,0.0008375346,0.014836634],"study_design_scores_gemma":[0.000010764965,0.00023393107,0.00041409576,0.0000040319565,0.000016912327,0.000025572119,0.000035579906,0.9938792,0.004795079,0.00046571245,0.00011017995,0.000008835643],"about_ca_topic_score_codex":0.0116103785,"about_ca_topic_score_gemma":0.0046476503,"teacher_disagreement_score":0.0116103785,"about_ca_system_score_codex":0.0025795887,"about_ca_system_score_gemma":0.0009071304,"threshold_uncertainty_score":0.023085594},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01198566,0.00013508102,0.98597425,0.0001263278,0.000040688345,0.00003245647,0.000031795636,0.00026486476,0.0014087462],"genre_scores_gemma":[0.2574133,0.00035959532,0.73743206,0.00014033358,0.000056119592,0.00036087123,0.00017094782,0.00027042974,0.0037963148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999645,0.00013278704,0.000018402165,0.00003221581,0.00014138894,0.000030368643],"domain_scores_gemma":[0.9982211,0.0012290013,0.000080859514,0.00008565917,0.00031455694,0.00006883931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015491496,0.00046693863,0.0009948347,0.00095374975,0.0007642064,0.00091175456,0.0012957656,0.0014977433,0.0032828269],"category_scores_gemma":[0.004307356,0.0006340438,0.0005557972,0.0010792413,0.0009912141,0.0011484179,0.0008967897,0.0015513203,0.00065400597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081521124,0.000064895954,0.00056756043,0.000083256564,0.000023451701,0.000040957282,0.00009779904,0.9380172,0.0023501012,0.020259911,0.0006357097,0.037777644],"study_design_scores_gemma":[0.000004469084,0.0000049961523,0.000019732126,0.0000037082002,0.0000014076701,0.0000037072564,0.0000063209527,0.99768436,0.00025639625,0.0017799209,0.00023226737,0.0000027290766],"about_ca_topic_score_codex":0.0065379953,"about_ca_topic_score_gemma":0.0065481802,"teacher_disagreement_score":0.0065379953,"about_ca_system_score_codex":0.00083081063,"about_ca_system_score_gemma":0.0018366581,"threshold_uncertainty_score":0.012999892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9666948,0.0003061757,0.028922314,0.00011046876,0.000035959474,0.000030470394,0.000050170493,0.00030206598,0.0035475802],"genre_scores_gemma":[0.9983039,0.000042884778,0.0013660167,0.000006338325,0.000005275821,0.0000042132046,0.000022187689,0.000006247865,0.00024284555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910045,0.00033753,0.000027448177,0.00007507432,0.00027556147,0.00018398922],"domain_scores_gemma":[0.9976597,0.0013759746,0.00016262109,0.00010651676,0.0005786808,0.00011653614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012864107,0.0005136369,0.00040073448,0.00047350937,0.00039891258,0.00060457166,0.0005478345,0.00049609813,0.0016622292],"category_scores_gemma":[0.0030756446,0.00011920339,0.0001847104,0.00055046496,0.00041785475,0.00060437893,0.00028149708,0.00035522232,0.00013714981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002406463,0.00041799116,0.010735143,0.0001599007,0.00013785141,0.0002590464,0.00014349421,0.83999395,0.066696174,0.0045146905,0.0010335076,0.07350175],"study_design_scores_gemma":[0.000029848286,0.0008253898,0.0027240203,0.0000041656604,0.000036934667,0.00006822737,0.000032669668,0.9846335,0.011037018,0.00036983783,0.00022553229,0.0000128779175],"about_ca_topic_score_codex":0.0032888395,"about_ca_topic_score_gemma":0.0014992008,"teacher_disagreement_score":0.0032888395,"about_ca_system_score_codex":0.0010899393,"about_ca_system_score_gemma":0.00038552424,"threshold_uncertainty_score":0.007908165},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15731622,0.00077611813,0.8251543,0.00050205097,0.000070912196,0.000064180385,0.000085572174,0.00045007505,0.015580523],"genre_scores_gemma":[0.9487891,0.0003392078,0.045151252,0.00008461429,0.000034209108,0.000049252292,0.00008539756,0.000029826653,0.0054371264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991934,0.00019360539,0.000019240224,0.00011372988,0.00026760536,0.0002123751],"domain_scores_gemma":[0.9994305,0.0002670279,0.00006466199,0.000043183172,0.00013573132,0.000058878442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076870556,0.00042562684,0.00066707254,0.0006030978,0.000713232,0.0018799414,0.0010534904,0.0008983193,0.0025584372],"category_scores_gemma":[0.0023270317,0.00036893453,0.00029339662,0.0012447893,0.0007581536,0.0014485691,0.00088748574,0.0007467694,0.00027144174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010691291,0.000055072007,0.00036588262,0.00002370484,0.000014146616,0.0000988813,0.00004645106,0.93420327,0.0018588196,0.0414341,0.0010797593,0.020712988],"study_design_scores_gemma":[0.0000093278,0.00001710486,0.00008284194,0.0000026362159,0.000005189471,0.000018079465,0.000011484699,0.9899776,0.0002411354,0.009115639,0.0005156442,0.0000032847904],"about_ca_topic_score_codex":0.009564366,"about_ca_topic_score_gemma":0.007301948,"teacher_disagreement_score":0.009564366,"about_ca_system_score_codex":0.0025671695,"about_ca_system_score_gemma":0.0014782315,"threshold_uncertainty_score":0.019017398},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19907843,0.0004519385,0.79629046,0.00062208105,0.000020988871,0.00008806853,0.0001807647,0.00017240302,0.0030948964],"genre_scores_gemma":[0.9503055,0.00025428287,0.048069865,0.00002719214,0.000012632681,0.00007939939,0.00010804105,0.000022188857,0.0011208322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910647,0.0003718483,0.000043250762,0.00014177294,0.00019899619,0.00013760435],"domain_scores_gemma":[0.9987219,0.0007949055,0.00020073401,0.000043023032,0.000116357325,0.00012311085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019440906,0.00072939805,0.0010447984,0.0006578455,0.00062407466,0.0011998689,0.00092095794,0.0009266341,0.0011588058],"category_scores_gemma":[0.002460328,0.00063508743,0.0005220576,0.0009298349,0.0012282295,0.0015200633,0.00067631225,0.00070327707,0.00010824539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045248296,0.000010792347,0.00021174035,0.000024849887,0.000010246219,0.000052583986,0.000028108248,0.9803609,0.0004801164,0.015644211,0.00010555759,0.0030256533],"study_design_scores_gemma":[0.000013651533,0.000035924935,0.0001397565,0.000004549706,0.000006335331,0.000009125173,0.000013892138,0.9883078,0.00026338836,0.0110494625,0.0001497185,0.0000063923735],"about_ca_topic_score_codex":0.008943426,"about_ca_topic_score_gemma":0.0065287813,"teacher_disagreement_score":0.008943426,"about_ca_system_score_codex":0.0024457984,"about_ca_system_score_gemma":0.0022277134,"threshold_uncertainty_score":0.017782748},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16068484,0.0005918086,0.8203609,0.00060541404,0.00022792036,0.0001904771,0.00023376412,0.0005407461,0.016564155],"genre_scores_gemma":[0.83653355,0.00021337255,0.15671158,0.00031474448,0.00020881042,0.000108476095,0.0001523598,0.000092580616,0.0056645833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858093,0.00018046403,0.00005754115,0.00014237607,0.00057289086,0.00046585605],"domain_scores_gemma":[0.9974976,0.0010100707,0.0004688068,0.00025889798,0.0005350747,0.00022939235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018078156,0.0007942149,0.0008903764,0.0009496128,0.0014374405,0.0020674858,0.002168809,0.0011680875,0.0026113444],"category_scores_gemma":[0.0062834616,0.00040773867,0.0008157596,0.0010389958,0.001294572,0.0018077502,0.0012452613,0.0019360901,0.00030662373],"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.0004970736,0.0003185296,0.0044651544,0.00022799328,0.000062316765,0.0008308077,0.0002657619,0.641833,0.015726771,0.2963467,0.00404238,0.035383493],"study_design_scores_gemma":[0.000021519727,0.00003238857,0.0003644079,0.0000053107165,0.000008621731,0.00006483613,0.000018130659,0.9887029,0.0011330799,0.008944639,0.0006905671,0.0000136885465],"about_ca_topic_score_codex":0.015165229,"about_ca_topic_score_gemma":0.010658804,"teacher_disagreement_score":0.015165229,"about_ca_system_score_codex":0.0033963735,"about_ca_system_score_gemma":0.003581863,"threshold_uncertainty_score":0.03015393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0087845465,0.00096225936,0.97636014,0.0011783234,0.00038242884,0.000016789152,0.00006030837,0.00006515444,0.012190104],"genre_scores_gemma":[0.7597983,0.0047277985,0.20194933,0.0011039864,0.002629975,0.00015847004,0.00014618617,0.00014199894,0.029343922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996767,0.00008692632,0.000016613547,0.00006724503,0.00012104372,0.000031500316],"domain_scores_gemma":[0.99969614,0.0001569732,0.000048015685,0.000037277507,0.000042795276,0.000018837618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005949997,0.0007440729,0.00055558374,0.00070674595,0.00038988492,0.0014118011,0.000856964,0.000993265,0.0032423523],"category_scores_gemma":[0.001533944,0.00026619044,0.0009217541,0.0005229987,0.0014776362,0.0016074008,0.0008048974,0.0014702239,0.00036927758],"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.000011215958,0.000022468708,0.0002038392,0.00006121576,0.000019561854,0.000098322715,0.00009952517,0.07837886,0.0029204425,0.9052267,0.0016252316,0.01133259],"study_design_scores_gemma":[0.000012727081,0.00007560215,0.00024724062,0.000026985945,0.000015004448,0.00007419256,0.00003074186,0.61039335,0.000872354,0.37482768,0.0134068215,0.000017338632],"about_ca_topic_score_codex":0.0013756832,"about_ca_topic_score_gemma":0.000774272,"teacher_disagreement_score":0.0032423523,"about_ca_system_score_codex":0.0009482941,"about_ca_system_score_gemma":0.00049019785,"threshold_uncertainty_score":0.010846734},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23440419,0.001140409,0.74130815,0.0026320894,0.00054796407,0.00023590554,0.0010253144,0.0012624627,0.017443595],"genre_scores_gemma":[0.965952,0.0004807517,0.024196377,0.00029415102,0.00028414736,0.000096396776,0.0002904104,0.000059455655,0.008346369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804723,0.0005366551,0.00006484983,0.00046508404,0.00044408033,0.00044208756],"domain_scores_gemma":[0.99564135,0.001974463,0.0006043847,0.00068221136,0.0007944301,0.00030321197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022513866,0.0010442615,0.0016614825,0.0013521365,0.001687541,0.0029983702,0.0031440165,0.0027196489,0.0037493762],"category_scores_gemma":[0.011353507,0.0007762845,0.0007497822,0.0019607898,0.0018596143,0.0028040719,0.00191361,0.0026673109,0.00086543616],"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.0005268862,0.00023627873,0.0039618197,0.0001680168,0.000083679886,0.00067616923,0.0004502418,0.32823536,0.0072640846,0.61610967,0.010232288,0.03205558],"study_design_scores_gemma":[0.000029572766,0.000042342013,0.00061832473,0.000009031165,0.00002380553,0.000074430776,0.000029192019,0.9267268,0.0009151502,0.0705094,0.0009884551,0.000033438508],"about_ca_topic_score_codex":0.007197024,"about_ca_topic_score_gemma":0.005697735,"teacher_disagreement_score":0.007197024,"about_ca_system_score_codex":0.0036998542,"about_ca_system_score_gemma":0.002061201,"threshold_uncertainty_score":0.026844442},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3492758,0.0011234714,0.6415472,0.00094449054,0.00013673042,0.00009804195,0.00030726363,0.00025151152,0.0063155536],"genre_scores_gemma":[0.9051035,0.00073201134,0.09080659,0.00014838619,0.00027864048,0.00009803623,0.0004676304,0.000039301816,0.0023260743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992337,0.00019456998,0.00004488372,0.00013102824,0.00023301638,0.00016283868],"domain_scores_gemma":[0.9935986,0.0029650233,0.0013063932,0.00040934279,0.0011484808,0.00057222066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017589034,0.00040982975,0.0005482433,0.002364299,0.00088737824,0.0014287838,0.00094416965,0.0014050838,0.0016074512],"category_scores_gemma":[0.008810389,0.00019908932,0.00062148523,0.0018002378,0.0013456938,0.0018381998,0.00063124317,0.0011349849,0.0002384819],"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.0000813687,0.000090982736,0.008618736,0.000111093155,0.000030354991,0.0002287879,0.00036724904,0.08596367,0.0040927553,0.86188394,0.0023405463,0.036190465],"study_design_scores_gemma":[0.000008720022,0.000045288976,0.0019298252,0.00002054827,0.000007077493,0.00014389624,0.0000590803,0.6387965,0.0007060997,0.35711122,0.0011454266,0.000026315847],"about_ca_topic_score_codex":0.0021399437,"about_ca_topic_score_gemma":0.0013428106,"teacher_disagreement_score":0.002364299,"about_ca_system_score_codex":0.0012933478,"about_ca_system_score_gemma":0.0008334911,"threshold_uncertainty_score":0.009383917},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027635638,0.00012993457,0.9911883,0.00020617785,0.00005179493,0.00007613369,0.00018090056,0.00011323373,0.0052899974],"genre_scores_gemma":[0.15991129,0.0014774224,0.8045085,0.0005067464,0.00040078835,0.0009875584,0.0007503868,0.00050590426,0.030951459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991559,0.00015787431,0.000040024413,0.00012111584,0.00042602414,0.000099008954],"domain_scores_gemma":[0.9986896,0.0006362475,0.000113680566,0.000095787815,0.0004082698,0.000056401794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019326195,0.0011784139,0.0011846324,0.0015120612,0.0007910041,0.001600312,0.001863298,0.0016659517,0.008659588],"category_scores_gemma":[0.006881773,0.0009593789,0.0013999162,0.0011279022,0.0010312275,0.0025142697,0.0015816377,0.0026087475,0.002252292],"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.000024820309,0.00005504148,0.00050520705,0.00019161082,0.000032401742,0.00016858392,0.00016458196,0.57779557,0.0025518718,0.37588173,0.0068039857,0.03582459],"study_design_scores_gemma":[0.000016461541,0.000018996585,0.00018712532,0.00003275951,0.000011625675,0.00007159247,0.000034984478,0.85577023,0.00054896506,0.13793397,0.00534825,0.000025046476],"about_ca_topic_score_codex":0.0036789146,"about_ca_topic_score_gemma":0.0041453047,"teacher_disagreement_score":0.008659588,"about_ca_system_score_codex":0.0014759493,"about_ca_system_score_gemma":0.0043254173,"threshold_uncertainty_score":0.028969228},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72281826,0.00071113184,0.24776068,0.002984046,0.0004039083,0.0002281427,0.00044461768,0.00070053956,0.023948647],"genre_scores_gemma":[0.9822634,0.00021167005,0.011641688,0.00025277407,0.00022995725,0.00006488092,0.00008223083,0.000026177713,0.0052272016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990181,0.00016839377,0.00003880396,0.00015178505,0.00016039114,0.00046254598],"domain_scores_gemma":[0.99850047,0.00052800565,0.00039977164,0.000112929294,0.00024456132,0.000214181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015286715,0.0011211343,0.0010905426,0.00096067315,0.0013537639,0.002277724,0.0022260384,0.0021539212,0.0022668312],"category_scores_gemma":[0.0035793772,0.0005236429,0.00075963547,0.0012879034,0.0022460576,0.0019677726,0.0014833679,0.001674888,0.00052647205],"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.0013473894,0.00069234375,0.010159447,0.00034893685,0.00012382069,0.004891488,0.0008585541,0.46663874,0.0235541,0.46374375,0.007417822,0.020223586],"study_design_scores_gemma":[0.0001290089,0.00020746245,0.0010987037,0.00001669562,0.00005671854,0.0005009312,0.00016776852,0.951999,0.0022788846,0.041947845,0.0015352356,0.00006163612],"about_ca_topic_score_codex":0.008438618,"about_ca_topic_score_gemma":0.004854588,"teacher_disagreement_score":0.008438618,"about_ca_system_score_codex":0.0019565132,"about_ca_system_score_gemma":0.0015097269,"threshold_uncertainty_score":0.016779006},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49451715,0.00048243345,0.4955511,0.00077245577,0.000097199314,0.00007260388,0.0001261732,0.00025964892,0.008121213],"genre_scores_gemma":[0.9898553,0.00008990354,0.008592493,0.000029394701,0.00003022327,0.000015401714,0.000035606758,0.000019376308,0.0013321945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994549,0.000104399696,0.000011164763,0.00005574944,0.00023118168,0.00014260631],"domain_scores_gemma":[0.99773586,0.0011181113,0.000392389,0.000069581336,0.00044486104,0.00023917435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013518358,0.00032983406,0.00055656,0.00078382145,0.00042205624,0.0010068004,0.00090699946,0.00032709466,0.0017350536],"category_scores_gemma":[0.003896277,0.00031432047,0.00032112657,0.00043812933,0.0008246707,0.0007398094,0.00050478877,0.0007674993,0.00014344617],"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.00017246784,0.000062641666,0.0026558524,0.00005883186,0.00004228413,0.00030680312,0.00017542271,0.86728334,0.007667423,0.11087443,0.0012591265,0.009441423],"study_design_scores_gemma":[0.0000022793117,0.000006685483,0.00018956787,0.000001117249,0.0000018284975,0.00000889367,0.0000072571065,0.9972869,0.00018709828,0.00222777,0.00007776631,0.0000028030292],"about_ca_topic_score_codex":0.008853198,"about_ca_topic_score_gemma":0.0041297595,"teacher_disagreement_score":0.008853198,"about_ca_system_score_codex":0.0019689782,"about_ca_system_score_gemma":0.0012593948,"threshold_uncertainty_score":0.017603338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5429505,0.001468349,0.4300064,0.0032153244,0.0004161794,0.00015899123,0.0006551484,0.000553309,0.020575795],"genre_scores_gemma":[0.96436864,0.00026491808,0.030422918,0.00018830491,0.00017102211,0.00007571768,0.00022047095,0.00007174223,0.0042161895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995741,0.00013765196,0.000012955811,0.000055663324,0.00009606265,0.00012352274],"domain_scores_gemma":[0.9965031,0.002572879,0.00017145454,0.00010373807,0.00042203424,0.0002267657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015478927,0.0004914362,0.0010628003,0.0008299347,0.0009912825,0.0013722073,0.0019447429,0.0010616564,0.0052514006],"category_scores_gemma":[0.0057076444,0.0004022158,0.0007483485,0.0007307345,0.000757373,0.0016229731,0.0011605595,0.001187746,0.0002124289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012192532,0.00011730398,0.0012585584,0.00007441604,0.000021682838,0.00010727393,0.000053004165,0.955317,0.00054915034,0.03659386,0.0019019101,0.0038839593],"study_design_scores_gemma":[0.000003953671,0.000002992213,0.000040978957,7.964846e-7,0.0000015495605,0.0000028471547,0.000005449331,0.99850047,0.00001942666,0.0013954758,0.000024996882,0.0000011216315],"about_ca_topic_score_codex":0.03092026,"about_ca_topic_score_gemma":0.016385125,"teacher_disagreement_score":0.03092026,"about_ca_system_score_codex":0.0019902636,"about_ca_system_score_gemma":0.0034652378,"threshold_uncertainty_score":0.06148058},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23183526,0.004921209,0.7226577,0.007008196,0.0007303474,0.00021747554,0.00070133776,0.0023354539,0.029593002],"genre_scores_gemma":[0.94737834,0.0019402055,0.024412038,0.0010923136,0.0009962113,0.00024111696,0.0005030662,0.00055549445,0.022881208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699926,0.0008185334,0.00011716483,0.00042485454,0.0008010093,0.00083910435],"domain_scores_gemma":[0.95445496,0.029432522,0.004394843,0.0029098014,0.006057709,0.0027501432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01186277,0.0020608227,0.0023845977,0.0045577683,0.0023903104,0.004442648,0.0067507615,0.0033723852,0.009886392],"category_scores_gemma":[0.065613545,0.0016548935,0.0016058169,0.0031352038,0.005795101,0.007726649,0.0050642444,0.0068106144,0.001843068],"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.000732836,0.00037845323,0.0056825434,0.00043717428,0.00010823702,0.00079519255,0.0011793292,0.20712219,0.0071625332,0.7411067,0.013644954,0.021649871],"study_design_scores_gemma":[0.000040164057,0.000059146212,0.0011889571,0.00006879066,0.00004132617,0.00014982192,0.00015032184,0.8922803,0.00074426696,0.10455316,0.0006569659,0.00006675423],"about_ca_topic_score_codex":0.012682265,"about_ca_topic_score_gemma":0.008093584,"teacher_disagreement_score":0.012682265,"about_ca_system_score_codex":0.00633778,"about_ca_system_score_gemma":0.003962596,"threshold_uncertainty_score":0.06273705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63863474,0.0044495002,0.34225455,0.0015937517,0.00017512303,0.00022566858,0.0006626755,0.0013290887,0.0106749],"genre_scores_gemma":[0.98885196,0.0007274767,0.0077962014,0.00014358951,0.000090899426,0.0000724618,0.00013415398,0.00005626114,0.0021270874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99589384,0.00074134587,0.0001638819,0.00059022504,0.0010700288,0.00154072],"domain_scores_gemma":[0.98504144,0.007434744,0.003920681,0.0012259517,0.001365093,0.0010120006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006506088,0.0012743828,0.0015049988,0.002733997,0.0013672627,0.0030830912,0.0041859215,0.002188789,0.003082036],"category_scores_gemma":[0.02164819,0.00075182994,0.0008896967,0.0021064489,0.004388276,0.004509814,0.0024376276,0.0020081287,0.0005204977],"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.0017256641,0.00035858166,0.014512834,0.00031589178,0.000114330986,0.0018427131,0.0008687103,0.7119829,0.009239519,0.22747205,0.005988296,0.025578525],"study_design_scores_gemma":[0.00006117823,0.00014048004,0.0032948994,0.000041225576,0.00004892975,0.00040467028,0.00020818468,0.9570585,0.0019437897,0.036185324,0.0005454707,0.00006735384],"about_ca_topic_score_codex":0.011170549,"about_ca_topic_score_gemma":0.0043237745,"teacher_disagreement_score":0.011170549,"about_ca_system_score_codex":0.0053767613,"about_ca_system_score_gemma":0.0020790466,"threshold_uncertainty_score":0.0390113},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066436715,0.00005314146,0.9912675,0.00006483869,0.000018554587,0.000036408444,0.000042013624,0.0011541898,0.0007196296],"genre_scores_gemma":[0.3172708,0.00017142615,0.67937165,0.00009594306,0.000059398415,0.0003223817,0.00032196153,0.00041165942,0.0019748444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824727,0.00034306073,0.00014076466,0.00027934072,0.0007821814,0.00020740634],"domain_scores_gemma":[0.99188626,0.004007517,0.00079878647,0.0010866966,0.0019860116,0.00023475758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035074025,0.001203396,0.0011680112,0.0018745225,0.0009806047,0.0023042602,0.002280198,0.0013053213,0.002859219],"category_scores_gemma":[0.025089776,0.00068913755,0.00070460036,0.0011011064,0.001069078,0.002338452,0.0022684291,0.0022231024,0.0014508174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014761252,0.000073016585,0.00246335,0.00007044084,0.000044318233,0.00012128607,0.00016028552,0.8398935,0.0040042237,0.046812758,0.0019387569,0.104270376],"study_design_scores_gemma":[0.000013724912,0.000010177267,0.00011921187,0.000007098924,0.000004388582,0.00002010843,0.000007915261,0.9829557,0.0015083078,0.014950308,0.0003932668,0.000009817933],"about_ca_topic_score_codex":0.0036046132,"about_ca_topic_score_gemma":0.0026931802,"teacher_disagreement_score":0.0036046132,"about_ca_system_score_codex":0.0019325579,"about_ca_system_score_gemma":0.0035017626,"threshold_uncertainty_score":0.018549144},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2040852,0.0003589135,0.7941168,0.00012155554,0.000020485128,0.000041343465,0.000027742291,0.00015332887,0.0010746176],"genre_scores_gemma":[0.96735793,0.00021426716,0.031686492,0.000035889414,0.000008686929,0.00002364696,0.000024704168,0.000019675737,0.000628702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996331,0.00010651859,0.000016698023,0.00006899325,0.000107924054,0.00006670807],"domain_scores_gemma":[0.9985436,0.0009811915,0.00018038985,0.00006798236,0.00016290773,0.000063876614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012595778,0.0005014414,0.0004616767,0.00054374017,0.0002989632,0.0010891074,0.0013511769,0.00061787217,0.00082951365],"category_scores_gemma":[0.003820391,0.00030105977,0.00033135634,0.00037292036,0.0007793003,0.0017652418,0.00064397464,0.000565134,0.000078647536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019450334,0.00007219012,0.0028925925,0.000078509525,0.00002943902,0.00034303914,0.00015846372,0.94406885,0.008216115,0.030097138,0.00024204807,0.013607126],"study_design_scores_gemma":[0.000004344569,0.000016170783,0.00015281767,0.0000031766726,0.0000048235506,0.000030509103,0.000014433266,0.9963431,0.00093363156,0.002455213,0.000038292143,0.0000036175197],"about_ca_topic_score_codex":0.0018085988,"about_ca_topic_score_gemma":0.0009880587,"teacher_disagreement_score":0.0018085988,"about_ca_system_score_codex":0.0011899718,"about_ca_system_score_gemma":0.0006920914,"threshold_uncertainty_score":0.008633912},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31233066,0.0006300221,0.6769244,0.00095251284,0.00042051089,0.00059689354,0.00030700976,0.002151028,0.005686895],"genre_scores_gemma":[0.9117186,0.0001220063,0.08337844,0.00013856315,0.000102384445,0.00008018999,0.00009353788,0.000052197596,0.0043140333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768865,0.0006528444,0.00016877589,0.00032050925,0.0008001922,0.00036903372],"domain_scores_gemma":[0.9925425,0.0031325724,0.00047850623,0.0008808617,0.0019526394,0.0010129706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068506002,0.0007173277,0.0010684986,0.001203674,0.0016268983,0.0037807205,0.0028432314,0.0018038591,0.0041909595],"category_scores_gemma":[0.011341967,0.0004722873,0.00055675366,0.0011923318,0.0010748764,0.0022733372,0.0009727636,0.0013958798,0.0006949307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01681996,0.003637985,0.015609289,0.00050653593,0.00021845278,0.002311441,0.000959035,0.48393804,0.08922714,0.14299265,0.008392151,0.23538727],"study_design_scores_gemma":[0.0004951967,0.0014981244,0.0009924833,0.000017012317,0.00009669205,0.0002586338,0.00006838477,0.97691536,0.011589124,0.0062266323,0.001781531,0.00006095158],"about_ca_topic_score_codex":0.0075870655,"about_ca_topic_score_gemma":0.0047154007,"teacher_disagreement_score":0.0075870655,"about_ca_system_score_codex":0.0021615906,"about_ca_system_score_gemma":0.004693986,"threshold_uncertainty_score":0.03622985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022464914,0.00021279008,0.9950852,0.00016797769,0.00007905511,0.000022579987,0.000027811733,0.00015479214,0.0020033645],"genre_scores_gemma":[0.36743227,0.0023409713,0.59713995,0.00049295125,0.0007504866,0.0003362689,0.0003245844,0.0008113921,0.030371081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982552,0.00079087174,0.00007629487,0.0001856309,0.00044734974,0.0002446293],"domain_scores_gemma":[0.9959692,0.0025168129,0.00015237328,0.0005044291,0.00068256614,0.00017473733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003858355,0.0008219798,0.0008995595,0.0020163408,0.0011426378,0.0022605031,0.0023362583,0.00096242165,0.0053954907],"category_scores_gemma":[0.012040636,0.0006596825,0.001419906,0.0020035477,0.0018153863,0.00412505,0.0024850862,0.003919335,0.0012192979],"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.00016213935,0.00009283561,0.00077677955,0.00010068488,0.000064929474,0.000059911974,0.00023858681,0.15705793,0.0019164638,0.6927321,0.005171534,0.1416261],"study_design_scores_gemma":[0.000014356218,0.000013787253,0.00019987341,0.000020634367,0.000019818572,0.000033536733,0.000027910843,0.7785964,0.0009108644,0.21496463,0.005174287,0.000023818558],"about_ca_topic_score_codex":0.0053497073,"about_ca_topic_score_gemma":0.00400617,"teacher_disagreement_score":0.0053954907,"about_ca_system_score_codex":0.0023061265,"about_ca_system_score_gemma":0.0032809288,"threshold_uncertainty_score":0.020405173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009612184,0.0011013226,0.98511976,0.0007098213,0.00008480898,0.00003264356,0.000047138616,0.00006721616,0.0032250793],"genre_scores_gemma":[0.66065353,0.00600397,0.3136032,0.000585639,0.0007244785,0.0005614461,0.00030517773,0.0001772944,0.017385308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987276,0.0007101588,0.0000623053,0.00013215476,0.00026097614,0.000106842715],"domain_scores_gemma":[0.99033874,0.0074424366,0.0009025287,0.00025632954,0.00074644503,0.00031345588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003816914,0.0011027177,0.00089067343,0.0014909728,0.00089679786,0.0013954398,0.0011470885,0.0017130141,0.0032038868],"category_scores_gemma":[0.016437534,0.0006611169,0.0011552464,0.0013805111,0.0024841228,0.0023580494,0.0020937608,0.0026636866,0.00045229064],"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.00001610782,0.000033568605,0.0005552521,0.00009010005,0.00003975846,0.0001507639,0.00021000394,0.14164351,0.0005481663,0.849279,0.00071743544,0.0067163366],"study_design_scores_gemma":[0.000008040671,0.000011180732,0.00008436815,0.000023324505,0.0000061016144,0.000030198456,0.000035951824,0.67478764,0.00013161973,0.3239561,0.00090933184,0.000016067213],"about_ca_topic_score_codex":0.004893519,"about_ca_topic_score_gemma":0.004095228,"teacher_disagreement_score":0.004893519,"about_ca_system_score_codex":0.0015265747,"about_ca_system_score_gemma":0.0019843113,"threshold_uncertainty_score":0.020186007},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19603221,0.00046987113,0.73672855,0.0032786794,0.0005012539,0.00056599063,0.008719834,0.006685371,0.04701819],"genre_scores_gemma":[0.7756195,0.00032326675,0.17890763,0.0003684791,0.00017284643,0.00025554208,0.0067883674,0.0011965566,0.03636786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975937,0.00028506524,0.000110409004,0.0003839553,0.0010878028,0.0005391083],"domain_scores_gemma":[0.9926736,0.0031718854,0.000471751,0.0009178439,0.002425096,0.0003398023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027664893,0.0007106487,0.00066358317,0.0028518005,0.0015827714,0.0033387423,0.001703487,0.0007538591,0.025486467],"category_scores_gemma":[0.012964325,0.00036697314,0.0017183674,0.001695043,0.00089704787,0.002600229,0.0015979063,0.001470784,0.0028789667],"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.001228249,0.00067271275,0.041386247,0.0006139564,0.00030564136,0.0015325567,0.00093485054,0.21649775,0.024623662,0.45544648,0.06867944,0.18807855],"study_design_scores_gemma":[0.000040211315,0.000119978526,0.0066452683,0.000072296134,0.000060565115,0.00021473427,0.00019413764,0.88766825,0.011218849,0.08254936,0.011178341,0.0000379847],"about_ca_topic_score_codex":0.017217876,"about_ca_topic_score_gemma":0.015532379,"teacher_disagreement_score":0.025486467,"about_ca_system_score_codex":0.003335068,"about_ca_system_score_gemma":0.0044483775,"threshold_uncertainty_score":0.08526075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012818414,0.011134135,0.9289098,0.009556451,0.005471848,0.00005021501,0.0001605099,0.00023512721,0.031663556],"genre_scores_gemma":[0.5767365,0.029606659,0.31555802,0.0096264975,0.019018948,0.00027790424,0.00041813246,0.0005871546,0.048170067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998206,0.00063814386,0.0001434111,0.0003285193,0.0005731205,0.00011089044],"domain_scores_gemma":[0.990418,0.0065785027,0.00037655907,0.00073278625,0.001352122,0.0005420801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061179893,0.0013905433,0.0018710723,0.002910989,0.001490759,0.0035346902,0.0028388342,0.0036179568,0.003973098],"category_scores_gemma":[0.023742255,0.0008573253,0.0028028493,0.0031859647,0.005839009,0.007724598,0.0038929065,0.0073910337,0.0009907524],"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.000030411906,0.000032049225,0.00020975532,0.00009316397,0.000021713196,0.0002545719,0.00016196645,0.0064918315,0.0009816227,0.9802623,0.0035959694,0.00786464],"study_design_scores_gemma":[0.000008345787,0.000033922828,0.00017322112,0.000033389322,0.000014119739,0.0002011072,0.00003832247,0.08894867,0.0003825129,0.9004285,0.009698291,0.00003957604],"about_ca_topic_score_codex":0.0024779001,"about_ca_topic_score_gemma":0.0011604002,"teacher_disagreement_score":0.0061179893,"about_ca_system_score_codex":0.0020493788,"about_ca_system_score_gemma":0.0016832391,"threshold_uncertainty_score":0.03235537},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2672079,0.0029792176,0.6991018,0.0048702364,0.00033594662,0.00011300175,0.00018234452,0.0002967771,0.024912713],"genre_scores_gemma":[0.98310536,0.0009618173,0.013491636,0.0002571959,0.0002848852,0.000058447873,0.00003566505,0.000039833856,0.0017652179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702615,0.0013799438,0.00007489453,0.0002449431,0.0004757198,0.0007983479],"domain_scores_gemma":[0.9906115,0.006962248,0.0006559263,0.00062325585,0.0005265034,0.00062064937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033009711,0.0015602992,0.0014205032,0.0010790064,0.0016019646,0.002498939,0.0018746172,0.0026619227,0.002304167],"category_scores_gemma":[0.014426453,0.00070283987,0.0009997112,0.002017411,0.0034650352,0.004098477,0.0026671852,0.0024198995,0.00032555813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008710993,0.000057557652,0.0005793801,0.00005878244,0.000030028117,0.0001932106,0.00017549077,0.8609706,0.000968613,0.13098197,0.00079902157,0.0050981822],"study_design_scores_gemma":[0.00001874059,0.00006773596,0.00021538169,0.000013709065,0.000014785224,0.00006466326,0.00007263231,0.8949859,0.00013944348,0.10355427,0.0008283445,0.000024358658],"about_ca_topic_score_codex":0.005824768,"about_ca_topic_score_gemma":0.002565922,"teacher_disagreement_score":0.005824768,"about_ca_system_score_codex":0.0027518272,"about_ca_system_score_gemma":0.0014419759,"threshold_uncertainty_score":0.019966006},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48812735,0.0004964847,0.50416595,0.00024554928,0.000037666403,0.000046115703,0.00009912605,0.00017530084,0.0066065947],"genre_scores_gemma":[0.99335045,0.00013352807,0.0056129643,0.000010697166,0.000009402694,0.000023522849,0.000022913191,0.000010098091,0.00082641904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975806,0.00008380499,0.0000073829915,0.000026411988,0.00006549123,0.000058798352],"domain_scores_gemma":[0.9989753,0.0006018715,0.00017253532,0.000078420766,0.00012143869,0.00005046801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061610655,0.00043804932,0.0004109222,0.00046286843,0.00020760085,0.0004825065,0.0005367389,0.00038408552,0.0010447074],"category_scores_gemma":[0.0019573057,0.00023318853,0.00067757344,0.00025809894,0.0006711659,0.00068848336,0.0004788908,0.0005721786,0.00012293982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005972098,0.000012407425,0.00047884547,0.00002159735,0.000014564385,0.00007576436,0.000050857394,0.97149414,0.002164223,0.02245507,0.00015495629,0.003017808],"study_design_scores_gemma":[0.0000038399717,0.000033333556,0.0001766292,0.000003088946,0.0000061277137,0.000022216944,0.0000067945953,0.99411666,0.00031675526,0.0052028825,0.000107115804,0.0000045494153],"about_ca_topic_score_codex":0.0019292285,"about_ca_topic_score_gemma":0.0010478128,"teacher_disagreement_score":0.0019292285,"about_ca_system_score_codex":0.000622706,"about_ca_system_score_gemma":0.00042465786,"threshold_uncertainty_score":0.004518032},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011805398,0.00019112328,0.98572505,0.0001992526,0.00007287832,0.000019942549,0.00000889471,0.000070639595,0.0019067153],"genre_scores_gemma":[0.55916744,0.0004744691,0.43209675,0.00023661084,0.0001996011,0.00024913542,0.00004904687,0.00024172608,0.0072853263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989981,0.00057165365,0.000044172135,0.000093750554,0.00023195143,0.000060337985],"domain_scores_gemma":[0.99565685,0.0033731991,0.00016885356,0.00019237926,0.00047171168,0.00013705278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002588031,0.00077018054,0.0007488021,0.0011409873,0.000896941,0.0014955734,0.001038633,0.001298478,0.003220134],"category_scores_gemma":[0.012266925,0.0005039974,0.0006428864,0.00086949626,0.0017498594,0.0024838287,0.0016194099,0.0017716553,0.0004656929],"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.00012366196,0.00012565033,0.00053986185,0.00019130668,0.000046207162,0.000089089575,0.0003024799,0.29289547,0.0043060468,0.65291196,0.0013455698,0.04712272],"study_design_scores_gemma":[0.000006794758,0.0000108239365,0.000043132382,0.000009003687,0.000003874469,0.000007690862,0.00002165445,0.9138245,0.00036116474,0.08537835,0.00032617888,0.000006885246],"about_ca_topic_score_codex":0.0018462965,"about_ca_topic_score_gemma":0.0015590243,"teacher_disagreement_score":0.003220134,"about_ca_system_score_codex":0.00089051056,"about_ca_system_score_gemma":0.001011951,"threshold_uncertainty_score":0.013687015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6036475,0.0007491268,0.3873052,0.0009302216,0.00006300809,0.00008556108,0.00016801582,0.00040196266,0.0066494304],"genre_scores_gemma":[0.99413884,0.00024919718,0.004169478,0.000054855125,0.00004036563,0.000033704982,0.00004916183,0.00003011945,0.0012343399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914944,0.00022900262,0.00003623444,0.00016716763,0.00019237665,0.00022584993],"domain_scores_gemma":[0.9916345,0.0044655516,0.001682477,0.00039993456,0.0007734719,0.0010440362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023518775,0.0008084464,0.001205391,0.0016138954,0.0010177003,0.0021739253,0.0015169673,0.0010356515,0.0021170366],"category_scores_gemma":[0.0151240425,0.0005440128,0.0009474421,0.00082556513,0.003284489,0.0024824843,0.0019123082,0.0019162585,0.00019656986],"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.00019279617,0.00019519794,0.005035052,0.00018398301,0.00016918659,0.0009408263,0.00085180614,0.40632412,0.016851591,0.5603802,0.001988207,0.0068870764],"study_design_scores_gemma":[0.000024699608,0.000049224393,0.0012520918,0.000010087517,0.00002091849,0.000084175466,0.00011393752,0.93138766,0.00058114674,0.06613302,0.000308536,0.000034600573],"about_ca_topic_score_codex":0.0071301525,"about_ca_topic_score_gemma":0.00218007,"teacher_disagreement_score":0.0071301525,"about_ca_system_score_codex":0.0024099627,"about_ca_system_score_gemma":0.0010345156,"threshold_uncertainty_score":0.017485619},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.352279,0.0011417397,0.5543593,0.0071668364,0.00076780375,0.00027082383,0.0023699556,0.00079834694,0.080846235],"genre_scores_gemma":[0.9441286,0.00052935025,0.019483076,0.0005259827,0.0002750681,0.00017492916,0.00034167236,0.00006300104,0.034478296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989642,0.00027552308,0.00004196498,0.00023791792,0.00016195483,0.00031846776],"domain_scores_gemma":[0.9986615,0.00044232805,0.00030522599,0.00012285759,0.00020425099,0.00026371636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014427912,0.0010097052,0.0012442868,0.00076460565,0.0009734524,0.002282259,0.0032848122,0.0027085443,0.008161968],"category_scores_gemma":[0.0027886648,0.00058912736,0.0007547145,0.0011663106,0.001732468,0.0032132557,0.0015480239,0.0022640356,0.0010147942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030226863,0.0001774639,0.001633399,0.00011065328,0.000051239072,0.00093689014,0.00012215797,0.80620086,0.002694281,0.17531145,0.0046392563,0.007820045],"study_design_scores_gemma":[0.00004295487,0.00004892845,0.00035882217,0.0000083913,0.000017118953,0.00007623092,0.000038102247,0.97695655,0.00016552646,0.020819943,0.0014480938,0.000019445733],"about_ca_topic_score_codex":0.016245773,"about_ca_topic_score_gemma":0.010969128,"teacher_disagreement_score":0.016245773,"about_ca_system_score_codex":0.0028747728,"about_ca_system_score_gemma":0.0013625473,"threshold_uncertainty_score":0.03230244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024892922,0.0011687763,0.9605685,0.0022347677,0.00020221499,0.00010879953,0.000062199135,0.00011207541,0.010649779],"genre_scores_gemma":[0.54569364,0.0020103434,0.41035703,0.0007644919,0.00074456446,0.0006798436,0.00025465607,0.00040570236,0.039089795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99589926,0.0024231502,0.00018804026,0.00045103353,0.0006002982,0.00043829277],"domain_scores_gemma":[0.9794698,0.017037349,0.0006434671,0.0012022156,0.001064546,0.00058262865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011816761,0.0011708406,0.0021400822,0.0020716507,0.0021300593,0.0027301137,0.004414221,0.0032685364,0.011040216],"category_scores_gemma":[0.03608686,0.0010441855,0.0017200165,0.0025282297,0.0043103085,0.008399654,0.0046761376,0.0050707376,0.0007787562],"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.00017952308,0.00012659148,0.0008483941,0.00013076271,0.00007888412,0.00011693382,0.00036096587,0.10160758,0.0004526128,0.84479535,0.0043523293,0.046950158],"study_design_scores_gemma":[0.000051548017,0.00004795625,0.00017313691,0.000043194617,0.000027069844,0.00005036188,0.00005665758,0.47477514,0.00040832144,0.5204233,0.003918333,0.000025059971],"about_ca_topic_score_codex":0.003493647,"about_ca_topic_score_gemma":0.0019976983,"teacher_disagreement_score":0.011816761,"about_ca_system_score_codex":0.002638991,"about_ca_system_score_gemma":0.0024948213,"threshold_uncertainty_score":0.06249374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5739654,0.00039573247,0.41490668,0.00042788943,0.000062127474,0.00012049596,0.0000707435,0.00037087558,0.009680146],"genre_scores_gemma":[0.97924495,0.000077246565,0.019094419,0.000031481115,0.000009622254,0.000020619416,0.000033267086,0.000027078262,0.0014613325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926704,0.00025195823,0.000018620089,0.00011858475,0.000099287296,0.0002445617],"domain_scores_gemma":[0.9992071,0.00033315123,0.000108872024,0.00006504494,0.00015575162,0.00013005445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014397784,0.00050224765,0.0006329788,0.0005695902,0.00062973035,0.00135509,0.0010726501,0.00068840204,0.0013682063],"category_scores_gemma":[0.0028536413,0.00040000907,0.0002720778,0.0006254903,0.0004436985,0.0015155575,0.0006049391,0.0005753787,0.00024992856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001455456,0.0001203089,0.0021899918,0.000024077826,0.000026194672,0.00004202761,0.0000669938,0.9581743,0.0057657883,0.0064456314,0.0005887704,0.026410345],"study_design_scores_gemma":[0.000006571536,0.000025667678,0.00034686827,0.0000014103093,0.000007198833,0.0000111285135,0.000045410372,0.99717087,0.00071116537,0.0014834446,0.00018639391,0.0000039452366],"about_ca_topic_score_codex":0.012715971,"about_ca_topic_score_gemma":0.010575942,"teacher_disagreement_score":0.012715971,"about_ca_system_score_codex":0.0021424927,"about_ca_system_score_gemma":0.001535695,"threshold_uncertainty_score":0.025283873},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08466684,0.00093184103,0.905326,0.001154689,0.00016101974,0.00006870469,0.00008918793,0.0004053011,0.00719635],"genre_scores_gemma":[0.95503336,0.00071970816,0.03871958,0.00026005195,0.00012533268,0.00017874829,0.00006694456,0.00009756785,0.0047986764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963037,0.0014405182,0.00011437456,0.0003801394,0.00105831,0.0007029904],"domain_scores_gemma":[0.9886002,0.0077393167,0.0012591867,0.00054013496,0.0012888334,0.00057233457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044811186,0.00094662094,0.0016778326,0.0011806486,0.0010350681,0.003427955,0.0022907343,0.0015564122,0.0014122885],"category_scores_gemma":[0.0258061,0.0010517004,0.0011216145,0.00083299767,0.003293161,0.004210445,0.0025995,0.0023602578,0.00025731415],"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.000114705035,0.000048923088,0.0005000468,0.000056747278,0.00002507144,0.00014593468,0.00028559452,0.75576043,0.0015637832,0.23690386,0.0005507404,0.004044188],"study_design_scores_gemma":[0.000008354667,0.000012432614,0.000038288465,0.0000067107308,0.0000049438527,0.000012399366,0.000013025118,0.96957874,0.00015588646,0.029938241,0.0002205405,0.00001034444],"about_ca_topic_score_codex":0.008271172,"about_ca_topic_score_gemma":0.0023873786,"teacher_disagreement_score":0.008271172,"about_ca_system_score_codex":0.0033483352,"about_ca_system_score_gemma":0.0024478037,"threshold_uncertainty_score":0.024294019},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42740825,0.0007919086,0.56330854,0.0010949181,0.0001663331,0.000079603175,0.0001339123,0.00046080872,0.0065556895],"genre_scores_gemma":[0.9888601,0.00014173871,0.0088219,0.00004207579,0.00006511502,0.00002563478,0.000039730206,0.000038045637,0.0019657079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879444,0.00031213497,0.000034432647,0.00012888602,0.0004539783,0.00027614727],"domain_scores_gemma":[0.9943387,0.0035463837,0.0008062569,0.0002131685,0.00073762325,0.00035785005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031147064,0.0006308567,0.0009977748,0.001202197,0.00087966403,0.0019306237,0.002438762,0.0009768528,0.0021553433],"category_scores_gemma":[0.0077126166,0.0006200694,0.000727602,0.00085131207,0.0015376762,0.0015539179,0.000954961,0.0013872029,0.00019358327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012447675,0.000075727905,0.0014556436,0.0000615795,0.000047499896,0.00035554325,0.0001449235,0.9347655,0.003168959,0.054826993,0.0006418201,0.00433129],"study_design_scores_gemma":[0.0000055058067,0.000008703301,0.00010814068,0.0000020725272,0.000004884801,0.000014191289,0.000009443416,0.9974861,0.0000949783,0.0022010987,0.00006066848,0.0000041919175],"about_ca_topic_score_codex":0.015135604,"about_ca_topic_score_gemma":0.0060808673,"teacher_disagreement_score":0.015135604,"about_ca_system_score_codex":0.0037205205,"about_ca_system_score_gemma":0.0024134745,"threshold_uncertainty_score":0.03009504},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053874504,0.0059467694,0.90191513,0.0026251255,0.0004804246,0.00006385686,0.00032673034,0.00030713703,0.034460235],"genre_scores_gemma":[0.8707113,0.008007743,0.10108372,0.0012680745,0.002008018,0.00020711016,0.00043523166,0.0003225179,0.01595613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991035,0.00022057412,0.00007527285,0.00017216693,0.00033957054,0.00008892032],"domain_scores_gemma":[0.99777716,0.0012676205,0.00034153712,0.00016443564,0.00033747507,0.00011188391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017784804,0.00072164874,0.00065792387,0.0012994917,0.00064540503,0.0011194977,0.0010114812,0.0010604974,0.004625683],"category_scores_gemma":[0.0068827374,0.00031388146,0.0014418344,0.0008873952,0.001601751,0.0032673762,0.0011751446,0.0021118312,0.0004692584],"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.000031641357,0.000035097615,0.00058825704,0.00019168928,0.000055914992,0.00029586136,0.00041713633,0.08120302,0.0057208454,0.8921577,0.002956128,0.016346704],"study_design_scores_gemma":[0.000011298054,0.00004134281,0.00029331585,0.000047900397,0.000024936102,0.00019327865,0.000054376756,0.38038653,0.0013265301,0.6096615,0.007932375,0.000026612526],"about_ca_topic_score_codex":0.0015100554,"about_ca_topic_score_gemma":0.00087110425,"teacher_disagreement_score":0.004625683,"about_ca_system_score_codex":0.0009442196,"about_ca_system_score_gemma":0.0006372456,"threshold_uncertainty_score":0.015474439},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18183938,0.00066403445,0.80567676,0.001370052,0.00020679228,0.00018032132,0.00045705758,0.00028966763,0.009315983],"genre_scores_gemma":[0.9372742,0.0005993119,0.046862476,0.00030505552,0.00017839472,0.00024726873,0.0002646628,0.000060955164,0.014207603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991364,0.00027078154,0.000037895672,0.00013943813,0.00022118447,0.00019440283],"domain_scores_gemma":[0.9988951,0.00049207057,0.00022275237,0.00007572829,0.00018016857,0.00013416038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019762602,0.0005475899,0.0008804552,0.00069817185,0.00094405265,0.001959301,0.003168436,0.0013246256,0.0036363096],"category_scores_gemma":[0.0031503788,0.0005189617,0.0007074323,0.00073644466,0.0016717535,0.002054899,0.0008945994,0.0013742829,0.000525526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020080848,0.00017391855,0.0013992165,0.00010685453,0.00003660096,0.0008036416,0.00042500068,0.51321965,0.0035234482,0.47157568,0.0017302695,0.0068049096],"study_design_scores_gemma":[0.000047445188,0.000034057175,0.00023645235,0.0000052624605,0.000010721411,0.000057183828,0.000037339585,0.96268266,0.00018069777,0.035951976,0.00074043556,0.000015783173],"about_ca_topic_score_codex":0.009643374,"about_ca_topic_score_gemma":0.0064337146,"teacher_disagreement_score":0.009643374,"about_ca_system_score_codex":0.0029124443,"about_ca_system_score_gemma":0.0020426237,"threshold_uncertainty_score":0.021131396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39609766,0.001044403,0.59045535,0.00080252375,0.000068352274,0.00013113233,0.0003217926,0.00047998474,0.010598761],"genre_scores_gemma":[0.9804786,0.00027930483,0.01633273,0.000043798507,0.00003171064,0.000050779887,0.000112457004,0.00007690199,0.0025937092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955183,0.0001520918,0.000014892273,0.00005832919,0.000112164606,0.00011068587],"domain_scores_gemma":[0.9966995,0.0023691347,0.00031294758,0.00008085546,0.00040741975,0.00013005732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016302895,0.0005859595,0.0006432695,0.0008559092,0.00057266717,0.0010860731,0.0011339579,0.00080923253,0.002672419],"category_scores_gemma":[0.005785074,0.00029264844,0.0005064819,0.00066421495,0.0007768284,0.0011223326,0.0006895606,0.0010755181,0.00031586332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014408387,0.000105650615,0.0032816723,0.00008932474,0.000041957075,0.0002827373,0.00035052854,0.8943617,0.006942561,0.085020676,0.0012399248,0.008139174],"study_design_scores_gemma":[0.0000022585677,0.000008022398,0.00018590277,0.0000021285662,0.000001956776,0.000011410275,0.000022088767,0.9970504,0.00015862363,0.0024772503,0.00007486336,0.000005006954],"about_ca_topic_score_codex":0.013346688,"about_ca_topic_score_gemma":0.0056836405,"teacher_disagreement_score":0.013346688,"about_ca_system_score_codex":0.0023610597,"about_ca_system_score_gemma":0.0013313758,"threshold_uncertainty_score":0.026538014},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08180218,0.0014811902,0.90640426,0.0011953095,0.00017711952,0.000083337334,0.00013957388,0.00018852102,0.008528442],"genre_scores_gemma":[0.96284765,0.0009458118,0.02687072,0.00017172094,0.00037873394,0.00007984174,0.00014619886,0.000081688064,0.0084776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703014,0.0011317548,0.00009697898,0.0003493425,0.00085062033,0.00054111844],"domain_scores_gemma":[0.99028695,0.0071290685,0.00052582275,0.00036595945,0.0012365412,0.00045561834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005378281,0.0013000359,0.0015876202,0.0017234981,0.0011357102,0.0033108157,0.0024451027,0.0015294921,0.0032433805],"category_scores_gemma":[0.015496475,0.0008801294,0.0012028454,0.0015152387,0.0023062923,0.0030912021,0.0019115774,0.0023326767,0.0003404167],"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.000053715623,0.00007535316,0.00088057574,0.000053685562,0.00005701978,0.00012013893,0.0001181084,0.68450505,0.0011781731,0.30670744,0.001045577,0.005205125],"study_design_scores_gemma":[0.000004433623,0.000008152395,0.00013335086,0.0000038209214,0.000008234087,0.000010526616,0.0000138226005,0.9649728,0.00010698727,0.034534533,0.00019658892,0.0000066969146],"about_ca_topic_score_codex":0.010828424,"about_ca_topic_score_gemma":0.004034288,"teacher_disagreement_score":0.010828424,"about_ca_system_score_codex":0.0042392616,"about_ca_system_score_gemma":0.0038076579,"threshold_uncertainty_score":0.030758142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6892188,0.00089845725,0.30458882,0.0008056311,0.00022034814,0.000111138346,0.00015258587,0.0002463277,0.003757812],"genre_scores_gemma":[0.98675936,0.00017067825,0.00942601,0.000081756385,0.00006867266,0.00003317798,0.000067406865,0.000028180704,0.0033646817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616385,0.0012128358,0.00024101425,0.0005594048,0.000515794,0.0013071604],"domain_scores_gemma":[0.99347854,0.003031695,0.0009582731,0.00059175096,0.0009540326,0.0009856516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039629135,0.0010889408,0.0020173811,0.0010301679,0.0012567412,0.0025115435,0.002416398,0.002034634,0.0019218187],"category_scores_gemma":[0.008257009,0.0007385608,0.0017655435,0.0010480083,0.002178839,0.0039151916,0.0020294704,0.0020204305,0.0002568303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014925799,0.00037314693,0.011915551,0.00024385004,0.00020365788,0.0028017187,0.0011120558,0.8180849,0.0123755215,0.13577516,0.0014662425,0.014155649],"study_design_scores_gemma":[0.000055225453,0.0001644011,0.0011040199,0.000006908243,0.00004068382,0.00022205124,0.00015870498,0.98548293,0.0007433623,0.011665191,0.00031522184,0.000041307274],"about_ca_topic_score_codex":0.008817858,"about_ca_topic_score_gemma":0.004810086,"teacher_disagreement_score":0.008817858,"about_ca_system_score_codex":0.002383771,"about_ca_system_score_gemma":0.0015856813,"threshold_uncertainty_score":0.020958185},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08255882,0.004006413,0.8870977,0.003996781,0.00081774517,0.00016532168,0.0006108115,0.00043751005,0.02030883],"genre_scores_gemma":[0.8736786,0.0056830854,0.08806476,0.0012986932,0.0017592303,0.00039891477,0.00075036584,0.00052182435,0.027844423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721587,0.0011626505,0.000102717946,0.00039682657,0.0007205821,0.00040126516],"domain_scores_gemma":[0.98927796,0.006959994,0.0007670021,0.00053133676,0.0017306845,0.0007330877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074985055,0.0016937597,0.0025604314,0.0029767177,0.001898608,0.0033315907,0.0044261566,0.0022328724,0.0065557593],"category_scores_gemma":[0.020627638,0.00093566877,0.0015093919,0.0028367632,0.0044813356,0.006362304,0.0027533823,0.0040345658,0.0008742656],"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.00017770407,0.000080885315,0.00062725134,0.0001429631,0.000046398323,0.00019599698,0.00024288573,0.14514828,0.0010895416,0.84219325,0.004667546,0.0053872424],"study_design_scores_gemma":[0.000027355392,0.000026590735,0.00025445595,0.000030997806,0.00002283979,0.000045773493,0.000040155977,0.86402076,0.00015139223,0.1345422,0.00080647285,0.000031143652],"about_ca_topic_score_codex":0.029232169,"about_ca_topic_score_gemma":0.016591497,"teacher_disagreement_score":0.029232169,"about_ca_system_score_codex":0.0068299747,"about_ca_system_score_gemma":0.006338816,"threshold_uncertainty_score":0.058124065},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9661464,0.00009356087,0.03208907,0.00012945887,0.000010439116,0.00004393339,0.000095143245,0.0001374692,0.0012544252],"genre_scores_gemma":[0.99824655,0.000018142491,0.0014510658,0.000014282693,0.0000033164881,0.000007980348,0.000031883545,0.0000099137515,0.00021676156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962708,0.0014998264,0.00016590732,0.00061819947,0.00055340107,0.000891863],"domain_scores_gemma":[0.9672762,0.01943799,0.0075793304,0.0025792222,0.0014671611,0.0016600732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076323617,0.00086348975,0.0011716472,0.00082495017,0.0010414682,0.0024811896,0.0018227068,0.0012129702,0.0024981033],"category_scores_gemma":[0.026611038,0.0007530126,0.00091286853,0.0010388849,0.0015386612,0.0024998412,0.0025420988,0.0013857901,0.00034037046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083452073,0.0002703949,0.05266028,0.000054495536,0.00016743534,0.00046175104,0.0003599557,0.9170608,0.0054682437,0.008504622,0.00054556096,0.01361193],"study_design_scores_gemma":[0.000025032332,0.00024180849,0.015569715,0.000012441875,0.00007305086,0.00011317663,0.00028374806,0.9757396,0.0028081336,0.004902089,0.00018164986,0.000049511298],"about_ca_topic_score_codex":0.006505197,"about_ca_topic_score_gemma":0.005773175,"teacher_disagreement_score":0.0076323617,"about_ca_system_score_codex":0.0025305983,"about_ca_system_score_gemma":0.0012614898,"threshold_uncertainty_score":0.040364265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5460651,0.0014313406,0.4366745,0.0014295229,0.00016356683,0.00013504119,0.00038337737,0.0005253597,0.013192215],"genre_scores_gemma":[0.98824537,0.00024404036,0.00856102,0.00009297713,0.000050891173,0.000053339238,0.0001093944,0.00003909717,0.0026039013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931884,0.00013989944,0.000019124165,0.000098609686,0.00014837824,0.00027510017],"domain_scores_gemma":[0.9985281,0.0006648069,0.00026038036,0.00007648681,0.00032186645,0.00014840865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016507477,0.0007293143,0.0009026083,0.0010472084,0.000727429,0.0014112359,0.0018558565,0.0008276417,0.0035678078],"category_scores_gemma":[0.0043818,0.0005,0.0007824166,0.0009484645,0.0010817812,0.0017665582,0.0010959442,0.0015503427,0.00036318702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029476653,0.00013750023,0.00392211,0.0001660174,0.000099229335,0.000703643,0.0004070207,0.8532368,0.009001286,0.12019804,0.0026255024,0.009208112],"study_design_scores_gemma":[0.000008507524,0.000025701696,0.00061623217,0.000005449298,0.000015064272,0.00004005502,0.00003825191,0.99389523,0.00030312332,0.004881344,0.00015779612,0.0000132137075],"about_ca_topic_score_codex":0.013817549,"about_ca_topic_score_gemma":0.0077655427,"teacher_disagreement_score":0.013817549,"about_ca_system_score_codex":0.0027903693,"about_ca_system_score_gemma":0.0017724836,"threshold_uncertainty_score":0.027474225},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10066569,0.0006959767,0.8844822,0.0009795072,0.0002489951,0.00028277768,0.00049572735,0.00041430394,0.011734739],"genre_scores_gemma":[0.8976749,0.001031185,0.08406021,0.00018190789,0.00024243646,0.00036912665,0.00048930885,0.00013240533,0.01581839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986047,0.0005194007,0.00005528857,0.000184026,0.00031781438,0.00031876357],"domain_scores_gemma":[0.9979455,0.0010118681,0.00033180945,0.00007278287,0.0003213573,0.0003166915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025133481,0.00092818856,0.0009447622,0.00090502005,0.000691619,0.0014800105,0.001390023,0.0010043622,0.0064499388],"category_scores_gemma":[0.0049674367,0.00050114037,0.0008004702,0.00093362597,0.001059437,0.0011429002,0.0008208448,0.0012013693,0.0006802963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004084059,0.000097103104,0.0013107759,0.00021137262,0.00004488228,0.000613871,0.00015970985,0.74617887,0.003084311,0.22551282,0.0062311953,0.016146583],"study_design_scores_gemma":[0.000025355648,0.00006559617,0.00025802426,0.000009367573,0.000015305191,0.000048944676,0.000020620426,0.97891104,0.00020249894,0.019803187,0.0006225452,0.000017630924],"about_ca_topic_score_codex":0.008212101,"about_ca_topic_score_gemma":0.006091049,"teacher_disagreement_score":0.008212101,"about_ca_system_score_codex":0.002687005,"about_ca_system_score_gemma":0.0022322184,"threshold_uncertainty_score":0.02157718},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4771971,0.0002646303,0.50664735,0.0015875433,0.0002290821,0.00025390703,0.0002447052,0.0006472412,0.012928395],"genre_scores_gemma":[0.9922281,0.00006527912,0.0047612726,0.000043035005,0.00002250895,0.00004489778,0.00003507989,0.0000122233005,0.0027875719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896073,0.00024293605,0.00004282951,0.00020552655,0.00025898957,0.0002888626],"domain_scores_gemma":[0.997983,0.00095946284,0.00033066256,0.00009661265,0.000263225,0.00036704337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016692367,0.00089252717,0.0010886203,0.0003904756,0.0014147661,0.0020544063,0.0014235853,0.0010891883,0.00290591],"category_scores_gemma":[0.0034209802,0.000395336,0.00042180103,0.0005155735,0.0015464188,0.000974976,0.001493842,0.0013039713,0.00024107254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023621615,0.00013284916,0.0005066231,0.000032988606,0.000015590607,0.00019449038,0.000085687614,0.9793873,0.003172349,0.011852767,0.00052499864,0.0038580834],"study_design_scores_gemma":[0.000029659059,0.00004196226,0.00013043243,0.0000012489335,0.000004588472,0.00000921291,0.000018746254,0.9974239,0.0002444475,0.001936291,0.0001515226,0.000007975056],"about_ca_topic_score_codex":0.02400151,"about_ca_topic_score_gemma":0.00880794,"teacher_disagreement_score":0.02400151,"about_ca_system_score_codex":0.0018610408,"about_ca_system_score_gemma":0.0028099727,"threshold_uncertainty_score":0.04772359},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7188162,0.00066316914,0.2696205,0.0006089925,0.000071345145,0.000054441738,0.000087217544,0.00019538403,0.009882681],"genre_scores_gemma":[0.9931184,0.000111600944,0.005417264,0.000028355036,0.000021036474,0.000013274385,0.000018726705,0.000014795462,0.0012565377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937505,0.00017632639,0.00002700679,0.000100496116,0.0001164683,0.00020464229],"domain_scores_gemma":[0.9986847,0.00065082766,0.00021760789,0.00011461435,0.00014471308,0.00018750568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008482852,0.0005063127,0.00096366525,0.0004269331,0.00077804335,0.0013437541,0.0011014453,0.00064450235,0.0014160838],"category_scores_gemma":[0.0028204245,0.00038539877,0.00032487907,0.00088419724,0.00082836807,0.0015041657,0.001085738,0.0006801919,0.00019878756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010836583,0.000041420466,0.000557728,0.000014660391,0.0000132619525,0.00012368627,0.000027366556,0.9848801,0.0017522499,0.008796462,0.00022293424,0.0034616978],"study_design_scores_gemma":[0.00001234222,0.000021211332,0.00025844632,0.0000013954599,0.0000048301863,0.000011970843,0.000023424187,0.9953492,0.0002958691,0.0038926941,0.0001248202,0.0000037288319],"about_ca_topic_score_codex":0.0049250526,"about_ca_topic_score_gemma":0.0041461745,"teacher_disagreement_score":0.0049250526,"about_ca_system_score_codex":0.001124512,"about_ca_system_score_gemma":0.00077323086,"threshold_uncertainty_score":0.009792745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096347205,0.0018364001,0.8950635,0.00033206702,0.00004419204,0.000050449737,0.00009819104,0.0004962963,0.0057317303],"genre_scores_gemma":[0.9429385,0.0014730371,0.052398555,0.00013920265,0.00010288101,0.00009844358,0.00013063876,0.00015277632,0.002566024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983481,0.0003584528,0.00007728951,0.00022162648,0.0006934986,0.00030114336],"domain_scores_gemma":[0.9814718,0.01350202,0.0015970871,0.0013291605,0.0017310132,0.00036897315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042642076,0.0015199671,0.0013296828,0.0021273284,0.0008934091,0.002226926,0.0015678447,0.0010797072,0.0018523602],"category_scores_gemma":[0.029119592,0.0005551912,0.0005480914,0.0015893256,0.0019938156,0.0045553437,0.0020548159,0.0021946377,0.00048805785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031189044,0.00008176635,0.0018620382,0.0002051556,0.000054497854,0.00025426227,0.0002684143,0.778879,0.024045015,0.16642551,0.0007479897,0.026864486],"study_design_scores_gemma":[0.0000056323283,0.000022898266,0.00031772198,0.000021947415,0.000015582533,0.00005915729,0.000024041707,0.96888655,0.0037732127,0.02652272,0.00032802598,0.000022530921],"about_ca_topic_score_codex":0.0039192345,"about_ca_topic_score_gemma":0.0026295434,"teacher_disagreement_score":0.0042642076,"about_ca_system_score_codex":0.0031964462,"about_ca_system_score_gemma":0.0015373601,"threshold_uncertainty_score":0.023191988},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3942204,0.00036303198,0.59909487,0.00063646596,0.00003060361,0.00009621256,0.00013262375,0.00038238044,0.005043484],"genre_scores_gemma":[0.9753318,0.00008715527,0.023757722,0.000041572614,0.0000129757655,0.00003442782,0.00002839235,0.00003538293,0.0006704775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755496,0.00081748364,0.000083511455,0.00034470114,0.0005573266,0.0006420825],"domain_scores_gemma":[0.9943023,0.003064314,0.0010718777,0.0005856441,0.00046244217,0.00051357155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053193583,0.0006863791,0.0011325862,0.0007581417,0.00072326534,0.0018932546,0.0018238132,0.0010079411,0.0021101646],"category_scores_gemma":[0.01743295,0.00052594644,0.0005802499,0.0010505434,0.0013370088,0.0024749518,0.0013124495,0.0012972944,0.00024730666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027693028,0.00006710238,0.0023516738,0.000052133102,0.00003302812,0.000095525094,0.00020475485,0.9405212,0.002293219,0.037853945,0.0007447481,0.01550575],"study_design_scores_gemma":[0.000013293869,0.000044183605,0.0004803324,0.000005111508,0.0000066912235,0.000026707576,0.000047892016,0.9843407,0.0005802322,0.0142585905,0.00018648991,0.000009625314],"about_ca_topic_score_codex":0.004705656,"about_ca_topic_score_gemma":0.0027292091,"teacher_disagreement_score":0.0053193583,"about_ca_system_score_codex":0.0034076695,"about_ca_system_score_gemma":0.0026599132,"threshold_uncertainty_score":0.028131783},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031120207,0.00020105949,0.9648497,0.0003449706,0.000041244202,0.000050436585,0.00010933094,0.00013609233,0.0031468517],"genre_scores_gemma":[0.91808814,0.00045531752,0.07515258,0.00018294333,0.00013258547,0.00018156607,0.00019654544,0.00007440989,0.00553595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906546,0.00023450052,0.000042359803,0.0001922532,0.00025221705,0.00021316054],"domain_scores_gemma":[0.9977685,0.0011784985,0.00034703498,0.00015797868,0.0004294988,0.000118489734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015615878,0.0007933344,0.00090690877,0.0006024687,0.00060745963,0.0013265143,0.0009889803,0.0012967582,0.002843855],"category_scores_gemma":[0.005912593,0.00045603546,0.0011896051,0.0004900152,0.0014573566,0.0029717514,0.0012073629,0.0013499914,0.00037580833],"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.00008800901,0.000045554785,0.0010888363,0.0000996881,0.000029603849,0.000274917,0.00025439684,0.6612008,0.0059568733,0.31776258,0.0016719078,0.01152674],"study_design_scores_gemma":[0.0000048086226,0.000011253563,0.000077941826,0.0000037808336,0.0000038664502,0.00002247166,0.000009268536,0.97537655,0.00027853594,0.023925953,0.0002789727,0.0000066353423],"about_ca_topic_score_codex":0.008985819,"about_ca_topic_score_gemma":0.0026437896,"teacher_disagreement_score":0.008985819,"about_ca_system_score_codex":0.0017340314,"about_ca_system_score_gemma":0.0014363916,"threshold_uncertainty_score":0.017867029},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045437854,0.026801784,0.8148063,0.0076210424,0.0010926394,0.000058629263,0.0004643974,0.0004686136,0.10324874],"genre_scores_gemma":[0.8834859,0.020670578,0.051506713,0.0014613519,0.0034432758,0.00019968873,0.00042882876,0.00019736886,0.038606264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991147,0.00024687275,0.000044102908,0.000121855555,0.00034896642,0.00012356516],"domain_scores_gemma":[0.9963123,0.0022590181,0.00030667274,0.00026492795,0.000653151,0.00020393712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002486829,0.00087643,0.0009761094,0.002038201,0.00082462473,0.0021075746,0.0015666382,0.0015514318,0.005073587],"category_scores_gemma":[0.011636936,0.00042070972,0.00091654906,0.0018625143,0.0027289921,0.0044526807,0.0015503353,0.0031473837,0.0012981516],"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.000008382739,0.000006186812,0.000134973,0.000027288304,0.0000051822562,0.000021357459,0.000043309632,0.0058610565,0.00013555195,0.98725593,0.0014798946,0.005020907],"study_design_scores_gemma":[0.0000055837154,0.0000073292895,0.0002282207,0.000016623952,0.000005052074,0.00004564562,0.000016465741,0.04043539,0.00011179921,0.95579994,0.0033203496,0.0000075771704],"about_ca_topic_score_codex":0.0032932907,"about_ca_topic_score_gemma":0.0012622842,"teacher_disagreement_score":0.005073587,"about_ca_system_score_codex":0.0029851713,"about_ca_system_score_gemma":0.0011478318,"threshold_uncertainty_score":0.021658957},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011977834,0.00031932787,0.9727404,0.00050050154,0.00018368628,0.00010985158,0.00014809902,0.00077489996,0.013245388],"genre_scores_gemma":[0.43919683,0.0009095484,0.5222727,0.0005425669,0.00049368874,0.00035435875,0.00032742054,0.0011990821,0.034703802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944645,0.00013490986,0.00002131551,0.00008114444,0.00022893485,0.000087148816],"domain_scores_gemma":[0.99899,0.00056382455,0.000056021898,0.00014425445,0.00019549426,0.000050352748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096883584,0.00094511244,0.00121789,0.000993592,0.0010581939,0.0014131961,0.0017435929,0.00089870836,0.013007701],"category_scores_gemma":[0.0054143467,0.0003865403,0.0010667685,0.0007519969,0.0009829332,0.0031186338,0.0016703184,0.002088325,0.0025002742],"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.00008506462,0.00015167458,0.00057192333,0.00025113096,0.00004852936,0.00023204672,0.00025109397,0.23394117,0.0072242264,0.677139,0.010109291,0.069994785],"study_design_scores_gemma":[0.000015948588,0.000019785028,0.00012556984,0.00001298918,0.000011596683,0.00003916969,0.000028003007,0.8468945,0.00096325774,0.14913723,0.002731373,0.000020543412],"about_ca_topic_score_codex":0.004592791,"about_ca_topic_score_gemma":0.005374765,"teacher_disagreement_score":0.013007701,"about_ca_system_score_codex":0.0012115627,"about_ca_system_score_gemma":0.0024645294,"threshold_uncertainty_score":0.043515086},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11649441,0.00064550183,0.87538165,0.00060446444,0.00012881406,0.00003128797,0.000046027762,0.00017086831,0.006497006],"genre_scores_gemma":[0.94406015,0.0006472743,0.048615593,0.0001713335,0.00011567901,0.00009072151,0.000092294744,0.000049352846,0.0061575533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992059,0.00031550872,0.000026359163,0.00009933605,0.00021774306,0.00013521199],"domain_scores_gemma":[0.9976673,0.0012662129,0.00042868248,0.00013949412,0.00025339564,0.00024489872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023803625,0.0007887934,0.0007168367,0.00095557445,0.0005224745,0.0012619429,0.0017216793,0.0014430068,0.0015197564],"category_scores_gemma":[0.0106527265,0.00048737164,0.00067147583,0.0005673389,0.0021456217,0.002169955,0.0014190368,0.0017307559,0.00026593145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028755969,0.00002635421,0.00042549483,0.000027969336,0.000015444262,0.00009790638,0.00012480273,0.5865816,0.0009857505,0.4083205,0.00041063497,0.002954872],"study_design_scores_gemma":[0.000004620992,0.0000068156874,0.00003255678,0.0000031382,0.0000016092932,0.000008058808,0.0000074690456,0.96806705,0.00006467876,0.03163041,0.00017048387,0.0000030861868],"about_ca_topic_score_codex":0.0035123911,"about_ca_topic_score_gemma":0.0015744781,"teacher_disagreement_score":0.0035123911,"about_ca_system_score_codex":0.0015519836,"about_ca_system_score_gemma":0.00072681304,"threshold_uncertainty_score":0.01258868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36628383,0.001672627,0.620777,0.0012970116,0.00007541943,0.00010497197,0.00014538779,0.00041149466,0.009232228],"genre_scores_gemma":[0.98090047,0.00049969146,0.016950618,0.000058381054,0.000049873048,0.000035537545,0.00004094776,0.00004071016,0.0014236772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987451,0.00040249687,0.00003825469,0.00011199117,0.00027526676,0.00042686224],"domain_scores_gemma":[0.9984285,0.0008475014,0.00034548735,0.00006555388,0.00017959836,0.00013324131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002272525,0.0008017409,0.0009929035,0.0010137723,0.0015063214,0.0029596684,0.0014247545,0.0013336703,0.0020464659],"category_scores_gemma":[0.005354878,0.0006141988,0.0009108901,0.0014232899,0.001724308,0.0030324329,0.0011221627,0.0012310487,0.00021002944],"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.0001603842,0.00006153248,0.0017198618,0.00009073736,0.000056145836,0.00036900555,0.00020162377,0.89569485,0.00512629,0.08636784,0.0007722972,0.009379409],"study_design_scores_gemma":[0.000019785472,0.00007829404,0.0006249102,0.000017712357,0.000035783934,0.00009069085,0.00016016171,0.96447355,0.0010628529,0.03279905,0.00061040476,0.000026777656],"about_ca_topic_score_codex":0.010956734,"about_ca_topic_score_gemma":0.008301395,"teacher_disagreement_score":0.010956734,"about_ca_system_score_codex":0.0038921617,"about_ca_system_score_gemma":0.0023947034,"threshold_uncertainty_score":0.028239787},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21092406,0.001998389,0.76926565,0.0013858359,0.00036921294,0.00012715247,0.00038821143,0.00057563506,0.014965843],"genre_scores_gemma":[0.96264565,0.00054714055,0.029624067,0.00017633973,0.0001809217,0.000046434812,0.00021439197,0.00009626308,0.006468742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991961,0.00015867117,0.000025629286,0.00014191282,0.00025824967,0.00021946146],"domain_scores_gemma":[0.99812657,0.0008751902,0.00018991792,0.00010399668,0.0005438412,0.00016051611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00159307,0.00047015303,0.00064575294,0.0011658075,0.0010201747,0.0017039696,0.0014211783,0.0006158674,0.004416107],"category_scores_gemma":[0.005329912,0.00024002648,0.00066701084,0.0008982526,0.0006418631,0.0016526625,0.0007556133,0.0010582675,0.00035960428],"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.00031628244,0.0002302782,0.007940879,0.00025757294,0.0000887352,0.00042161683,0.0003375258,0.36557633,0.021573085,0.55796736,0.009204054,0.036086228],"study_design_scores_gemma":[0.0000055310857,0.000026945349,0.000891657,0.000006440664,0.000012407082,0.000039658084,0.000029277142,0.98114854,0.0007937069,0.016498426,0.0005377021,0.000009774643],"about_ca_topic_score_codex":0.009286578,"about_ca_topic_score_gemma":0.004621623,"teacher_disagreement_score":0.009286578,"about_ca_system_score_codex":0.002422341,"about_ca_system_score_gemma":0.00264134,"threshold_uncertainty_score":0.018465042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90827775,0.0016705089,0.062084902,0.0069914623,0.00041519644,0.000024394047,0.0002735084,0.00043892418,0.019823322],"genre_scores_gemma":[0.99875283,0.000090851296,0.00066631817,0.000081924816,0.00004070428,0.0000036443419,0.000023192777,0.000016289765,0.0003241543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973454,0.0012105057,0.000065144915,0.00021732415,0.0005151539,0.00064654625],"domain_scores_gemma":[0.9682842,0.02333145,0.0017131373,0.0018442145,0.0034891616,0.0013378022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050925533,0.0003724521,0.00057840865,0.00066695584,0.0009069372,0.002854997,0.0014462975,0.0015208978,0.004839334],"category_scores_gemma":[0.042501107,0.00033487444,0.00022219212,0.0015332461,0.0015237659,0.0030665784,0.000849531,0.0019936573,0.00045535367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018625859,0.00024906677,0.020301508,0.000127713,0.000058631817,0.0008623621,0.0005986094,0.66921854,0.010291392,0.25016743,0.007558008,0.03870418],"study_design_scores_gemma":[0.000043669075,0.00020551066,0.0072147017,0.0000302017,0.00004132274,0.00023224445,0.00062611315,0.86426955,0.0032200236,0.12288716,0.00117479,0.00005465391],"about_ca_topic_score_codex":0.0025519438,"about_ca_topic_score_gemma":0.001472965,"teacher_disagreement_score":0.0050925533,"about_ca_system_score_codex":0.002422977,"about_ca_system_score_gemma":0.0013129021,"threshold_uncertainty_score":0.0269323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6697949,0.00023380252,0.29302388,0.0023390066,0.00016384508,0.00038901216,0.0007563371,0.00079861085,0.0325006],"genre_scores_gemma":[0.9635685,0.00016028143,0.02316926,0.00021397053,0.00007646814,0.00020431059,0.00023925658,0.00017469212,0.012193221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979061,0.0005487295,0.00008779478,0.00030982084,0.000321754,0.00082574383],"domain_scores_gemma":[0.98861045,0.0078255795,0.0007866231,0.00049607345,0.00088920887,0.001392066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039076605,0.000619303,0.0015657367,0.002014459,0.0023125943,0.0043957056,0.0032384403,0.0026790216,0.015968837],"category_scores_gemma":[0.014525734,0.00092836673,0.0012188612,0.0011491921,0.0019801822,0.0039000618,0.0021125276,0.002358994,0.0015630092],"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.0010588894,0.0005943104,0.004913144,0.000172165,0.00006997167,0.00047420914,0.0011561556,0.26119202,0.008422538,0.69748294,0.009355131,0.015108424],"study_design_scores_gemma":[0.00012432945,0.00014691563,0.0013509116,0.000026899183,0.00004651247,0.00014030315,0.00034416834,0.8739599,0.0016385894,0.12124051,0.0009077444,0.00007307362],"about_ca_topic_score_codex":0.005577312,"about_ca_topic_score_gemma":0.0057498403,"teacher_disagreement_score":0.015968837,"about_ca_system_score_codex":0.0031721368,"about_ca_system_score_gemma":0.0026438334,"threshold_uncertainty_score":0.05342108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16181758,0.0006801647,0.83493644,0.00021671288,0.0000605133,0.000074065,0.000121313715,0.00040538257,0.0016878261],"genre_scores_gemma":[0.9676817,0.0001503883,0.030732028,0.000028664743,0.00005418302,0.00006605727,0.00008086901,0.00004623377,0.0011598361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766016,0.0007563968,0.00023738583,0.00037129674,0.00072204665,0.0002527246],"domain_scores_gemma":[0.98379517,0.009402849,0.0022114469,0.0010543613,0.0030581653,0.00047794636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058762175,0.0010296612,0.0008681481,0.0029919087,0.00060043053,0.0018841353,0.0019407333,0.0011121093,0.0018113693],"category_scores_gemma":[0.016772833,0.00038876463,0.0006987922,0.0013112456,0.0012309937,0.0026641302,0.001257168,0.0009983316,0.00029398408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004867533,0.00011014572,0.0049986993,0.0002187453,0.00012726124,0.00021223935,0.0003896904,0.8570015,0.012125179,0.08250906,0.0008821718,0.040938564],"study_design_scores_gemma":[0.00000442373,0.0000965903,0.0009518159,0.000012222479,0.00003208065,0.00006190498,0.000026012302,0.98807937,0.0011286307,0.009395825,0.00018941046,0.000021860564],"about_ca_topic_score_codex":0.003051355,"about_ca_topic_score_gemma":0.0015755586,"teacher_disagreement_score":0.0058762175,"about_ca_system_score_codex":0.0017802175,"about_ca_system_score_gemma":0.00089665945,"threshold_uncertainty_score":0.03107673},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008420683,0.00014215209,0.98915124,0.0001275257,0.00006910723,0.00003267942,0.000025375411,0.000085203494,0.0019460337],"genre_scores_gemma":[0.58588433,0.0006300137,0.40393597,0.00029654478,0.00024811603,0.00028753388,0.00012730621,0.000109485976,0.008480657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784315,0.000594063,0.00010269124,0.00021514983,0.0010134664,0.00023151674],"domain_scores_gemma":[0.9952586,0.0028881326,0.0002961352,0.00043486815,0.0009203991,0.00020177726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031137322,0.0012235454,0.001524724,0.0022528793,0.000701149,0.003044484,0.0034537043,0.0017990061,0.0035828175],"category_scores_gemma":[0.009429098,0.000488284,0.0014472012,0.001861745,0.0016653991,0.0038671826,0.0014116485,0.0018700395,0.0004010209],"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.00011026135,0.00021473774,0.0012874597,0.00012837969,0.00011371218,0.00012535651,0.00016957468,0.40063563,0.006241431,0.56187946,0.0010248726,0.028069176],"study_design_scores_gemma":[0.000008105652,0.000026161873,0.0000919971,0.0000070947453,0.000015791426,0.00001583877,0.000012598539,0.95313644,0.00053763913,0.04570495,0.00043358988,0.0000098025475],"about_ca_topic_score_codex":0.005525506,"about_ca_topic_score_gemma":0.0030673526,"teacher_disagreement_score":0.005525506,"about_ca_system_score_codex":0.0021523836,"about_ca_system_score_gemma":0.00239379,"threshold_uncertainty_score":0.016467214},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45467848,0.00068933103,0.5345583,0.0012444549,0.00015926393,0.00011500038,0.0005971506,0.0006598172,0.0072982535],"genre_scores_gemma":[0.9774122,0.00021525398,0.018922968,0.00020259306,0.000113874186,0.00006824828,0.00024122276,0.00007737727,0.00274624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938705,0.0024716503,0.00026924576,0.0010011662,0.0011582895,0.0012291735],"domain_scores_gemma":[0.94944966,0.031585578,0.0034802759,0.00819601,0.003564669,0.0037237895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010683865,0.000991019,0.0027148265,0.0015111832,0.0017041805,0.004244321,0.0045510517,0.0022451475,0.0024099203],"category_scores_gemma":[0.06860367,0.0016815253,0.0012258616,0.0015273461,0.005592627,0.0059019807,0.0044744955,0.0024788256,0.00035735543],"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.0012717822,0.00018815549,0.0059125726,0.00012846457,0.00013291322,0.0002785226,0.0005117163,0.37881732,0.003199365,0.5958585,0.0025627248,0.01113792],"study_design_scores_gemma":[0.000058026413,0.000048748356,0.0009991963,0.000018495573,0.000022417904,0.00007927247,0.000073696254,0.80066764,0.0007299246,0.19702508,0.00024352755,0.000034024048],"about_ca_topic_score_codex":0.005419289,"about_ca_topic_score_gemma":0.0032353525,"teacher_disagreement_score":0.010683865,"about_ca_system_score_codex":0.002645022,"about_ca_system_score_gemma":0.0036256057,"threshold_uncertainty_score":0.056502342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08661919,0.0005046903,0.8981745,0.0018536802,0.00013741103,0.00020499171,0.001085649,0.00050505035,0.010914678],"genre_scores_gemma":[0.944008,0.00086680247,0.03861098,0.00025402743,0.00013888883,0.0006180209,0.0008312103,0.000079212514,0.01459285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891794,0.0003232588,0.000045591736,0.00022290218,0.00022339441,0.00026694644],"domain_scores_gemma":[0.9973943,0.001549654,0.00041176094,0.00009717525,0.0003515179,0.00019565981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018210696,0.0011583412,0.0013093525,0.000955092,0.00086075504,0.002220407,0.00224109,0.0021184182,0.0075892704],"category_scores_gemma":[0.0038091652,0.00074139,0.0010196738,0.0010949026,0.0016420261,0.0022376264,0.0010839088,0.00199076,0.00088197883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034962166,0.000024100083,0.00046662882,0.000019099038,0.00001478708,0.00009431614,0.000049084385,0.96294504,0.00034978078,0.034617353,0.0004408876,0.00094402226],"study_design_scores_gemma":[0.0000132233345,0.000010379095,0.00009081676,0.000003542315,0.000005176263,0.0000084601415,0.000007985564,0.99536043,0.000048019047,0.0042590504,0.00018553388,0.0000073176216],"about_ca_topic_score_codex":0.03213227,"about_ca_topic_score_gemma":0.013077879,"teacher_disagreement_score":0.03213227,"about_ca_system_score_codex":0.0027985813,"about_ca_system_score_gemma":0.0029458655,"threshold_uncertainty_score":0.06389046},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75837713,0.00047654106,0.20086196,0.0041269064,0.00009300596,0.00031389637,0.0011697653,0.00019942023,0.03438133],"genre_scores_gemma":[0.98136216,0.00018601783,0.015334682,0.00008128735,0.00002176986,0.00011592563,0.00012711665,0.000029370723,0.00274171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817157,0.0009153776,0.000038771926,0.0001945345,0.00011211253,0.00056764064],"domain_scores_gemma":[0.9961261,0.0023122474,0.0005591627,0.00016947581,0.00026883627,0.00056417263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021581743,0.0010916741,0.0014155094,0.0012172492,0.0013042508,0.0024691666,0.0017054505,0.0026437757,0.008336511],"category_scores_gemma":[0.007898943,0.0010851786,0.0011258052,0.0010144057,0.0021094258,0.0026572794,0.0019260187,0.0012973006,0.00045352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034563744,0.0001517228,0.0011199503,0.00007858959,0.00006932651,0.00028112953,0.00008190524,0.9046937,0.0006518734,0.08695733,0.0020385766,0.0035302965],"study_design_scores_gemma":[0.00016988305,0.00011035867,0.0007925209,0.00002632564,0.00004016195,0.00006173804,0.0003091731,0.9509096,0.0004425424,0.046001457,0.0010984836,0.000037704343],"about_ca_topic_score_codex":0.015618094,"about_ca_topic_score_gemma":0.012224163,"teacher_disagreement_score":0.015618094,"about_ca_system_score_codex":0.005406059,"about_ca_system_score_gemma":0.002811233,"threshold_uncertainty_score":0.03922385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17322835,0.0020580154,0.7937638,0.004590768,0.00015641472,0.0001318982,0.00033645393,0.00052351697,0.02521068],"genre_scores_gemma":[0.9322737,0.0016927747,0.054594915,0.00073609885,0.00022627784,0.00018629944,0.00024122486,0.00019399125,0.009854756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705243,0.0012445379,0.00009756438,0.0003169269,0.00063917035,0.00064923964],"domain_scores_gemma":[0.9693433,0.02310694,0.0026276216,0.0021307375,0.0015320336,0.0012593947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071293865,0.0010968596,0.0015746984,0.001513813,0.0018687521,0.002511564,0.0036283128,0.0018672299,0.005405146],"category_scores_gemma":[0.0617547,0.0009285812,0.0016577526,0.0019206883,0.0043376694,0.0071146614,0.00494696,0.004586722,0.0005174054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019156303,0.00011888828,0.0045892578,0.00010637094,0.000052636395,0.00032013425,0.00056083145,0.5221867,0.00068600115,0.45686573,0.003940905,0.010380945],"study_design_scores_gemma":[0.000018521781,0.00001958958,0.0004158645,0.000025378253,0.000020862644,0.00006197394,0.00014004589,0.8626637,0.00033869632,0.13504389,0.0012332919,0.000018227985],"about_ca_topic_score_codex":0.017313832,"about_ca_topic_score_gemma":0.009175568,"teacher_disagreement_score":0.017313832,"about_ca_system_score_codex":0.006296885,"about_ca_system_score_gemma":0.0028365825,"threshold_uncertainty_score":0.045687318},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021359302,0.0002811858,0.9753948,0.00018256325,0.000047373243,0.000038218426,0.0000428526,0.00013575969,0.0025178152],"genre_scores_gemma":[0.88402164,0.000510807,0.11044806,0.00014520803,0.000072871735,0.00020578613,0.00012561148,0.000102824444,0.0043672686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947864,0.00021573484,0.000021409423,0.00005374701,0.00015347764,0.00007701834],"domain_scores_gemma":[0.99769956,0.0017686668,0.00019813504,0.000102804726,0.00015449988,0.000076378754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016031463,0.00080047245,0.00081909687,0.0007669375,0.00054612494,0.00092279626,0.0011893762,0.0011988996,0.0014708423],"category_scores_gemma":[0.005587627,0.00042289248,0.0011757234,0.00063082785,0.0010190479,0.0013378756,0.00088840537,0.0015114998,0.0001777931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018757635,0.000015868967,0.00048333942,0.000028643251,0.000017503557,0.00007117596,0.00006425608,0.95568347,0.0010003672,0.03994914,0.0001976833,0.0024697725],"study_design_scores_gemma":[0.0000017805866,0.0000047283706,0.00002671559,0.0000017645409,0.0000017029279,0.0000069046105,0.0000046663586,0.99488777,0.00006330715,0.0048560295,0.00014297964,0.0000016590831],"about_ca_topic_score_codex":0.008146568,"about_ca_topic_score_gemma":0.0029609236,"teacher_disagreement_score":0.008146568,"about_ca_system_score_codex":0.0014160473,"about_ca_system_score_gemma":0.0010707802,"threshold_uncertainty_score":0.016198277},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40121976,0.0012645106,0.53913707,0.003253813,0.00028843188,0.00023912356,0.00054515124,0.0003183126,0.05373385],"genre_scores_gemma":[0.9666503,0.00068471965,0.015557322,0.00022157417,0.00016450627,0.00013017429,0.00020580746,0.00006665171,0.016318774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993668,0.00021766683,0.000029012752,0.00009331543,0.00014155668,0.00015162675],"domain_scores_gemma":[0.99752647,0.0015407533,0.00031905714,0.00007102763,0.00031307526,0.00022962487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014067902,0.0009660425,0.0011445251,0.0014917786,0.001874437,0.0038260806,0.0017948603,0.002742428,0.006593575],"category_scores_gemma":[0.00806299,0.0007090184,0.0010684925,0.0010536857,0.0020524452,0.0029108606,0.0019159128,0.0022320705,0.0004993796],"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.000057655197,0.000088278306,0.0006860192,0.00004879922,0.000025866375,0.0001953997,0.00021712165,0.045524694,0.0011396096,0.9472417,0.0020666705,0.0027081852],"study_design_scores_gemma":[0.00007088013,0.000038077254,0.00029916308,0.000024278068,0.000023048726,0.00008542221,0.00014988148,0.5480292,0.00046367862,0.44954008,0.0012500889,0.000026227905],"about_ca_topic_score_codex":0.0074911066,"about_ca_topic_score_gemma":0.0044696466,"teacher_disagreement_score":0.0074911066,"about_ca_system_score_codex":0.0025895908,"about_ca_system_score_gemma":0.0014494343,"threshold_uncertainty_score":0.022057712},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027846482,0.0024179672,0.9506171,0.0017689585,0.0005232638,0.00014990373,0.00035460983,0.000314885,0.016007025],"genre_scores_gemma":[0.53731656,0.006174259,0.40022263,0.0018716665,0.0019342249,0.0011781459,0.0018942774,0.0013021077,0.048106167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9903486,0.0052030603,0.00031828898,0.0011629534,0.0021689606,0.00079809787],"domain_scores_gemma":[0.8874378,0.09470772,0.003034967,0.0032794636,0.008586194,0.002953887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.025782846,0.0027237365,0.0034023682,0.0067097396,0.0024718165,0.0035724891,0.007645954,0.0034972643,0.021848278],"category_scores_gemma":[0.07970169,0.0015371756,0.0027084616,0.0060569304,0.0050164755,0.02138921,0.008191849,0.008516455,0.0012067409],"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.0006361944,0.0002152538,0.001181164,0.0003919486,0.00017745921,0.00013474967,0.00026351376,0.11044802,0.001547911,0.84665227,0.005440217,0.03291126],"study_design_scores_gemma":[0.000042923555,0.00019380817,0.0004968255,0.00007499842,0.0000837574,0.000079948615,0.00005551077,0.4012964,0.0010818678,0.59327286,0.0032700233,0.00005109704],"about_ca_topic_score_codex":0.0027501318,"about_ca_topic_score_gemma":0.0022329448,"teacher_disagreement_score":0.025782846,"about_ca_system_score_codex":0.005308601,"about_ca_system_score_gemma":0.0045744483,"threshold_uncertainty_score":0.13635433},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04873324,0.00016102512,0.949658,0.00008699014,0.000024731002,0.000059330887,0.00005223066,0.000617646,0.00060687045],"genre_scores_gemma":[0.7114355,0.00014694752,0.28667936,0.00012272142,0.000055904075,0.00012420972,0.00027949852,0.00009210258,0.0010637781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770206,0.0007181844,0.00015150286,0.0003884038,0.0006810913,0.00035866865],"domain_scores_gemma":[0.99199283,0.0044083917,0.00065671315,0.0016140919,0.00080001325,0.00052799546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004416491,0.00076788524,0.0014507262,0.0009717779,0.00087238755,0.0013897046,0.0026821308,0.00085734087,0.0011561612],"category_scores_gemma":[0.017165925,0.0007554769,0.0007569058,0.0009589439,0.0011115978,0.0021331406,0.0021594728,0.0009872378,0.00032775485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014576161,0.00015382309,0.008286046,0.0002216354,0.00013662156,0.00039040227,0.00050131755,0.7449631,0.009154453,0.08972086,0.002158472,0.14285557],"study_design_scores_gemma":[0.000018526365,0.000035365825,0.00016934104,0.0000045517168,0.000007205644,0.000048006554,0.000012811794,0.98667985,0.0015133207,0.011326232,0.0001782077,0.000006557824],"about_ca_topic_score_codex":0.0034499182,"about_ca_topic_score_gemma":0.0025511226,"teacher_disagreement_score":0.004416491,"about_ca_system_score_codex":0.0014633572,"about_ca_system_score_gemma":0.0020018981,"threshold_uncertainty_score":0.023356915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30665514,0.0053862473,0.6498428,0.006624518,0.0006622917,0.00019237207,0.001048189,0.00260763,0.026980845],"genre_scores_gemma":[0.94714326,0.0024805022,0.025833208,0.0007800886,0.0008655776,0.00029164378,0.0007115506,0.00092933356,0.020964902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980798,0.00057378464,0.000079713594,0.0003270795,0.00042780378,0.00051180826],"domain_scores_gemma":[0.96144164,0.027768677,0.0029946354,0.0022147133,0.0036972433,0.0018831263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0095494585,0.0021694365,0.0019436819,0.0041293106,0.0015299771,0.003732607,0.0048116245,0.0027085699,0.010856541],"category_scores_gemma":[0.0672413,0.001670255,0.0013598521,0.0021393714,0.0054858425,0.007822751,0.0031486885,0.0064505436,0.0019802556],"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.000554091,0.00019626695,0.0027547423,0.00028857627,0.000096074145,0.00036073787,0.001278727,0.116916545,0.007582994,0.85021424,0.007006335,0.012750761],"study_design_scores_gemma":[0.000061018327,0.00004821785,0.0018970193,0.00010613204,0.00006856557,0.00021984069,0.0002043452,0.825102,0.001379311,0.16980866,0.0009819103,0.00012306274],"about_ca_topic_score_codex":0.010853628,"about_ca_topic_score_gemma":0.0075041465,"teacher_disagreement_score":0.010856541,"about_ca_system_score_codex":0.0065603885,"about_ca_system_score_gemma":0.0040555377,"threshold_uncertainty_score":0.050502956},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5598138,0.0005447656,0.43519673,0.0005829152,0.000087114,0.0000547618,0.00012827969,0.00029403952,0.0032974845],"genre_scores_gemma":[0.99038297,0.00011133208,0.008412411,0.000029790926,0.00002498231,0.000016877057,0.000045364697,0.00001862351,0.0009576543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959713,0.000100568875,0.000013488267,0.00005224216,0.00014431486,0.00009235666],"domain_scores_gemma":[0.9978715,0.0013383623,0.00023555243,0.00006542028,0.0003310563,0.00015813186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016959695,0.00046736927,0.0006206287,0.0006814211,0.00046619165,0.0012306947,0.0010704924,0.00058859447,0.0011397733],"category_scores_gemma":[0.0026941164,0.0003365353,0.0005247809,0.0003574307,0.0010751387,0.0008873072,0.00057945924,0.00063550216,0.000100225676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033189313,0.0000685432,0.0025063613,0.00007489309,0.000052473722,0.00034620473,0.000104347106,0.9394775,0.0112375645,0.0395494,0.00060218136,0.0056487303],"study_design_scores_gemma":[0.0000059228078,0.000014125851,0.00018301832,0.0000012086716,0.0000042619154,0.000010655007,0.000009389031,0.99785405,0.00028519213,0.0015868134,0.00004189233,0.0000034576635],"about_ca_topic_score_codex":0.0097440155,"about_ca_topic_score_gemma":0.003038101,"teacher_disagreement_score":0.0097440155,"about_ca_system_score_codex":0.0019214475,"about_ca_system_score_gemma":0.0017495188,"threshold_uncertainty_score":0.019374609},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023661802,0.00084204646,0.9696904,0.00069925946,0.00005842737,0.000050263512,0.00019596015,0.00016973952,0.004632102],"genre_scores_gemma":[0.80587584,0.002762082,0.17993206,0.0002365097,0.00041701618,0.00044298737,0.0007208239,0.0003975608,0.009215092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99361116,0.0028709741,0.00033675236,0.00061483,0.0019599088,0.00060628576],"domain_scores_gemma":[0.9815579,0.0118478155,0.0024126177,0.0014685637,0.0016227514,0.0010903253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069015273,0.0023411268,0.0023940816,0.0027728623,0.0009933998,0.004548678,0.005004103,0.001848068,0.0050698384],"category_scores_gemma":[0.02355896,0.0011451816,0.0026106765,0.0034622634,0.0023444323,0.009718576,0.0034515695,0.0031834687,0.00043094903],"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.00005331264,0.000043933105,0.0006107118,0.00010898579,0.00008835017,0.00005465629,0.00013274649,0.39783865,0.0006937992,0.58884114,0.0007642676,0.010769435],"study_design_scores_gemma":[0.0000061939068,0.00006248309,0.0002229411,0.000020326866,0.000024896684,0.000032187378,0.00003608716,0.7981055,0.00029531,0.2001427,0.001036261,0.0000151335735],"about_ca_topic_score_codex":0.002268713,"about_ca_topic_score_gemma":0.001324077,"teacher_disagreement_score":0.0069015273,"about_ca_system_score_codex":0.004238819,"about_ca_system_score_gemma":0.00222735,"threshold_uncertainty_score":0.036499202},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01850245,0.00029955007,0.97747517,0.00025530896,0.00003270829,0.000021956166,0.00005013026,0.0002298768,0.0031328143],"genre_scores_gemma":[0.7741945,0.0009885683,0.21473154,0.00021691952,0.00014790751,0.0002258409,0.00032587742,0.00037438323,0.008794408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991391,0.00034454005,0.000019082689,0.000061554565,0.0003077124,0.00012793009],"domain_scores_gemma":[0.99618185,0.002738297,0.00026796182,0.0002969911,0.00036062262,0.00015428236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025071274,0.0008476122,0.0008671865,0.00093137374,0.0006727646,0.0011897434,0.0020296876,0.0010926578,0.0018923006],"category_scores_gemma":[0.009608236,0.00053758454,0.00076103496,0.0008453449,0.0012605721,0.0021967315,0.0011373824,0.0018674894,0.00049402035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025712696,0.000015473746,0.00020455298,0.000016845488,0.000011299263,0.000027498992,0.000035552755,0.9635163,0.00031041875,0.032256257,0.00041738476,0.0031627687],"study_design_scores_gemma":[9.3098225e-7,0.0000011070587,0.000011107086,8.3357895e-7,7.078927e-7,0.0000012243414,0.0000019457073,0.9961169,0.00002406711,0.0037674112,0.00007307015,7.518788e-7],"about_ca_topic_score_codex":0.0131318895,"about_ca_topic_score_gemma":0.007165468,"teacher_disagreement_score":0.0131318895,"about_ca_system_score_codex":0.0030068862,"about_ca_system_score_gemma":0.0012903829,"threshold_uncertainty_score":0.026110888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16352731,0.0019731878,0.7764827,0.010989071,0.00092849165,0.0002891946,0.0031139576,0.0008360375,0.0418601],"genre_scores_gemma":[0.92341554,0.0011489104,0.018391747,0.0006979987,0.00029903112,0.00024037612,0.0008534794,0.00014526836,0.054807663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998931,0.00028508253,0.000046469482,0.00025167735,0.00017154655,0.0003141925],"domain_scores_gemma":[0.99724627,0.0015808275,0.0002715132,0.0000888614,0.00043821766,0.00037429802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023279719,0.0012011318,0.0019007218,0.0011023753,0.0014259218,0.004706241,0.004483244,0.0049112258,0.011691351],"category_scores_gemma":[0.007555711,0.0009534723,0.0013358778,0.0015351365,0.0013534835,0.0033790974,0.0016322713,0.003460193,0.0015990951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014591402,0.00014624043,0.0015428659,0.00010916476,0.00005786158,0.0005458337,0.000256908,0.83125365,0.0012626331,0.15397865,0.0050500003,0.0056502493],"study_design_scores_gemma":[0.000041453677,0.00003502768,0.00026981175,0.00001312555,0.000030003108,0.00007886717,0.000045265206,0.98077786,0.00009963224,0.017561896,0.0010241941,0.000022911392],"about_ca_topic_score_codex":0.036664557,"about_ca_topic_score_gemma":0.018860778,"teacher_disagreement_score":0.036664557,"about_ca_system_score_codex":0.006376225,"about_ca_system_score_gemma":0.0048214435,"threshold_uncertainty_score":0.07290226},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19203062,0.0001301939,0.80505425,0.00022438301,0.00003157379,0.00004423541,0.000091299866,0.001035724,0.0013577368],"genre_scores_gemma":[0.90039736,0.000105871164,0.098003276,0.000056241905,0.00004473685,0.00006217206,0.00021794175,0.00013655587,0.00097583747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920684,0.00024537748,0.000039090482,0.00013104083,0.0002613545,0.000116355106],"domain_scores_gemma":[0.9925903,0.0051705614,0.00036531792,0.00052172656,0.0009679915,0.00038406323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004644795,0.00055490655,0.0006927087,0.001866774,0.0009361329,0.0016216116,0.0017559789,0.0006941506,0.0022055118],"category_scores_gemma":[0.023028396,0.00057847705,0.00067678356,0.0013528133,0.00089973275,0.0028881456,0.0011905171,0.0013164651,0.00034024115],"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.0003037687,0.00015242348,0.009085471,0.000060189897,0.00004090211,0.000095692325,0.00018311903,0.8974936,0.002676648,0.05201794,0.0010619813,0.03682837],"study_design_scores_gemma":[0.0000025623917,0.000005784349,0.00018462836,9.094527e-7,0.0000013128106,0.0000037999173,0.0000067484475,0.9964135,0.00023355398,0.0031167597,0.000028387758,0.0000020412945],"about_ca_topic_score_codex":0.015779844,"about_ca_topic_score_gemma":0.010153112,"teacher_disagreement_score":0.015779844,"about_ca_system_score_codex":0.0028853554,"about_ca_system_score_gemma":0.0019130463,"threshold_uncertainty_score":0.031376004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6846596,0.0019454263,0.29808155,0.0026470341,0.00061437686,0.00022893833,0.0009240347,0.00023318348,0.010665859],"genre_scores_gemma":[0.9817707,0.00060866104,0.011512978,0.00017120504,0.00023714286,0.000079317615,0.00016039143,0.000025345778,0.0054342807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946314,0.00010532459,0.000022361965,0.00011280019,0.00007293617,0.00022342193],"domain_scores_gemma":[0.999303,0.00018458211,0.00016683829,0.000052217772,0.00013225853,0.00016108461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008395859,0.00085877086,0.0011064959,0.00055864843,0.0012291195,0.0015764687,0.0016573793,0.0012387802,0.0036738247],"category_scores_gemma":[0.0014740383,0.00034659938,0.000784188,0.00083911326,0.0010628703,0.0017795069,0.00094373693,0.0012458124,0.00025952642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011818713,0.00048288246,0.010663849,0.0005537394,0.0001831936,0.0032199332,0.00053190626,0.7225959,0.018338617,0.21837203,0.0063806446,0.017495435],"study_design_scores_gemma":[0.00011120467,0.00017580985,0.0019649526,0.000013331681,0.000050270264,0.00020563393,0.00012038801,0.9806127,0.0008532809,0.015006841,0.0008403681,0.00004521285],"about_ca_topic_score_codex":0.009097593,"about_ca_topic_score_gemma":0.0054221507,"teacher_disagreement_score":0.009097593,"about_ca_system_score_codex":0.00091811485,"about_ca_system_score_gemma":0.0015308246,"threshold_uncertainty_score":0.018089294},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6210025,0.0006842887,0.36509,0.0011444449,0.00019406185,0.00011477189,0.0006456938,0.0012573046,0.009866884],"genre_scores_gemma":[0.9875267,0.00018831652,0.008284517,0.0001030599,0.00010336583,0.000031963456,0.00032122128,0.00010425506,0.0033365611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993562,0.00011072966,0.000019300522,0.00015396679,0.00017384357,0.00018600015],"domain_scores_gemma":[0.99511623,0.002421527,0.0007366465,0.00027819246,0.00094428926,0.0005031234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020714565,0.00067433284,0.0007181324,0.0018297344,0.0007444481,0.0019761398,0.0021907736,0.0010216254,0.0043154457],"category_scores_gemma":[0.010903557,0.0005595584,0.00053982326,0.0011330643,0.0014230033,0.0026004012,0.0015412273,0.0014136361,0.0005638591],"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.0012183428,0.0002695931,0.024756577,0.00030621147,0.00009849025,0.0013883553,0.00070123724,0.6589618,0.017971193,0.26288998,0.0064633666,0.024974868],"study_design_scores_gemma":[0.000018781448,0.00006965734,0.0032441625,0.000012866524,0.000019749954,0.00015072482,0.000071681694,0.9650016,0.0016146129,0.029421031,0.00033809655,0.000037097754],"about_ca_topic_score_codex":0.00517062,"about_ca_topic_score_gemma":0.0036566814,"teacher_disagreement_score":0.00517062,"about_ca_system_score_codex":0.003022291,"about_ca_system_score_gemma":0.0019595865,"threshold_uncertainty_score":0.02192843},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20215535,0.0023396318,0.77941084,0.0014799823,0.00015875795,0.000066503264,0.00012401775,0.00023962454,0.014025314],"genre_scores_gemma":[0.97042644,0.0010346886,0.022829501,0.00020748794,0.000121871235,0.00013423452,0.000105623054,0.000062512656,0.005077721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998938,0.00023823297,0.000050469975,0.00015592814,0.00040032633,0.00021692786],"domain_scores_gemma":[0.99516124,0.0026027472,0.0008563118,0.00017850024,0.000761945,0.00043929086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015117179,0.00075457856,0.00096606096,0.0015608037,0.000923335,0.0028087266,0.0015558314,0.0012604101,0.0014840375],"category_scores_gemma":[0.01215985,0.00048941304,0.0011103309,0.00075538293,0.0024829535,0.0028086905,0.0021172634,0.0014171745,0.00015466305],"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.00007220207,0.000050107537,0.00079941185,0.00008771908,0.000032652708,0.00024955452,0.00029931695,0.3100672,0.0038788775,0.67938805,0.0005315763,0.0045433603],"study_design_scores_gemma":[0.000011538694,0.000023728011,0.00012601918,0.000013968293,0.000007811732,0.000039930528,0.00003178688,0.8902331,0.0005190747,0.108348735,0.00062753854,0.000016749233],"about_ca_topic_score_codex":0.0063769594,"about_ca_topic_score_gemma":0.0017385854,"teacher_disagreement_score":0.0063769594,"about_ca_system_score_codex":0.0024673971,"about_ca_system_score_gemma":0.0013063865,"threshold_uncertainty_score":0.017902255},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27215257,0.002300257,0.713767,0.0025750387,0.00021761093,0.000112082336,0.00021570157,0.0005369516,0.0081228195],"genre_scores_gemma":[0.9876173,0.00043351197,0.010204807,0.00010563763,0.00014124773,0.000045754725,0.000029112332,0.000053786833,0.0013687627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996167,0.0018852542,0.00012727395,0.00049181597,0.0004606031,0.00086797314],"domain_scores_gemma":[0.970021,0.025741398,0.001506384,0.00075210416,0.0009299797,0.0010491431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006248855,0.0016750229,0.003047167,0.0014018328,0.0016635751,0.004210203,0.0034774968,0.0024794056,0.001932327],"category_scores_gemma":[0.02743568,0.001885672,0.0008206762,0.0025409127,0.0031885372,0.0050384626,0.0027158158,0.002093419,0.00030113698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002828511,0.000058731406,0.00040843015,0.00007033674,0.000036866946,0.000103000166,0.00009740474,0.95625603,0.0014950393,0.036508262,0.0006170558,0.004065942],"study_design_scores_gemma":[0.000017650964,0.00002444406,0.000099725716,0.000007645138,0.000014239612,0.0000186124,0.000017868551,0.97587615,0.00025363883,0.02356389,0.00009565145,0.000010531221],"about_ca_topic_score_codex":0.0043326165,"about_ca_topic_score_gemma":0.0030169794,"teacher_disagreement_score":0.006248855,"about_ca_system_score_codex":0.005113845,"about_ca_system_score_gemma":0.0021651953,"threshold_uncertainty_score":0.037103653},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25042856,0.0018608641,0.7406671,0.0009251104,0.000816631,0.000074715485,0.00030298886,0.0010955189,0.003828451],"genre_scores_gemma":[0.9704155,0.0005126334,0.026516778,0.00011583201,0.00023165508,0.000025890417,0.000107600754,0.00010262422,0.0019714658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973792,0.0009862017,0.00012215435,0.00040550146,0.00061994407,0.00048710298],"domain_scores_gemma":[0.97637254,0.015955662,0.002313244,0.0028112258,0.0015730773,0.00097432925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076194177,0.0010784997,0.0012263159,0.0012230346,0.0009312508,0.002202258,0.0030624429,0.0017253335,0.002124925],"category_scores_gemma":[0.031277496,0.00083199976,0.00094435085,0.0023461806,0.00077083585,0.004194051,0.0012997845,0.0026930112,0.00033352288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011287497,0.00011750545,0.005059528,0.00004000374,0.000076797915,0.00006894804,0.00004108188,0.9541301,0.0014961507,0.013222139,0.00067337666,0.024961423],"study_design_scores_gemma":[0.000004788192,0.000015428168,0.0005893996,0.0000031035772,0.000024374003,0.000008646276,0.0000052754467,0.99609536,0.00028408848,0.0028323727,0.00013019163,0.0000070143656],"about_ca_topic_score_codex":0.018640468,"about_ca_topic_score_gemma":0.01508962,"teacher_disagreement_score":0.018640468,"about_ca_system_score_codex":0.003059048,"about_ca_system_score_gemma":0.005033689,"threshold_uncertainty_score":0.04029578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63620377,0.0006416908,0.35581177,0.0018981482,0.00020157422,0.00011430193,0.00030245387,0.00063973095,0.004186503],"genre_scores_gemma":[0.9893907,0.00018022305,0.0072674174,0.00010377497,0.000082609455,0.000038386057,0.000078725214,0.00005156008,0.0028066274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756694,0.0006866151,0.00010443767,0.00035734734,0.0005238958,0.0007608564],"domain_scores_gemma":[0.98151773,0.01412601,0.0015430287,0.000404045,0.0014448,0.0009643157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057306946,0.0008013269,0.0014341357,0.0009690574,0.0009985252,0.002278513,0.0021466948,0.002074552,0.0033782045],"category_scores_gemma":[0.017099448,0.0010565066,0.00056612515,0.0013733023,0.0014484656,0.0026509508,0.001070489,0.0014891955,0.0005449143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042556277,0.00035011664,0.006075838,0.00022272718,0.00012881773,0.00085359794,0.0006860788,0.8477638,0.013617242,0.10921386,0.0029371153,0.013895224],"study_design_scores_gemma":[0.00006656411,0.000113336435,0.00045087945,0.0000055822225,0.00002953052,0.000087545784,0.000059204704,0.98853344,0.00046298647,0.010057863,0.00011334746,0.000019616957],"about_ca_topic_score_codex":0.008253222,"about_ca_topic_score_gemma":0.005118763,"teacher_disagreement_score":0.008253222,"about_ca_system_score_codex":0.0031949044,"about_ca_system_score_gemma":0.002493553,"threshold_uncertainty_score":0.030307114},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22853617,0.0045631276,0.75878197,0.00031301723,0.00014363352,0.00019217466,0.00017058855,0.0031077152,0.0041915765],"genre_scores_gemma":[0.6342534,0.0027615405,0.3609247,0.000108320855,0.00006173537,0.00021305581,0.00041791148,0.00029959617,0.00095971214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654573,0.0012222484,0.00038552,0.0004224936,0.0012896669,0.00013439407],"domain_scores_gemma":[0.98160833,0.013218118,0.00094364194,0.0017237792,0.0022825783,0.00022354649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004238201,0.0008144796,0.0011426945,0.0011018735,0.000596443,0.0009720956,0.0019820735,0.0012037422,0.0013356934],"category_scores_gemma":[0.020699387,0.00059256144,0.0006868931,0.0019329865,0.00052623625,0.0016301473,0.00060318137,0.0008784513,0.0004340254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011694744,0.00089196267,0.0063366964,0.00086613896,0.00030421565,0.00006940358,0.00046552386,0.52290696,0.010411413,0.007806477,0.0019694827,0.44680226],"study_design_scores_gemma":[0.000092822826,0.00032360243,0.0013621515,0.000058041354,0.000038217986,0.0000619127,0.00007538925,0.98559254,0.00909074,0.0015060799,0.0017682364,0.000030154244],"about_ca_topic_score_codex":0.0069936016,"about_ca_topic_score_gemma":0.0039624413,"teacher_disagreement_score":0.0069936016,"about_ca_system_score_codex":0.0011094983,"about_ca_system_score_gemma":0.0013589031,"threshold_uncertainty_score":0.022414029},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071588196,0.00052319403,0.9032879,0.0010654314,0.00028207063,0.00013437503,0.00027862863,0.00031291347,0.022527283],"genre_scores_gemma":[0.8596556,0.0012085212,0.119579494,0.00047966233,0.00040145626,0.00035320368,0.0003741584,0.00028044585,0.017667513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897325,0.00039080207,0.00003103825,0.0001226434,0.00032364074,0.00015856288],"domain_scores_gemma":[0.9970962,0.0018305302,0.00025029128,0.00013158227,0.00042914203,0.00026226474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023264925,0.000476393,0.0006426604,0.0008552648,0.0011825012,0.00092089124,0.0010869534,0.00059413613,0.0075866883],"category_scores_gemma":[0.007685891,0.00043724186,0.00054676563,0.0010071017,0.001565218,0.0010683119,0.00071265484,0.0011566894,0.00079739676],"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.00014537464,0.0000393449,0.0010773413,0.00009328293,0.000019289126,0.00031789613,0.00026745885,0.17604111,0.0027400926,0.7997159,0.006738657,0.012804167],"study_design_scores_gemma":[0.000039723716,0.000072361276,0.0006328046,0.000023964065,0.00002074997,0.00018750624,0.000051900584,0.85258615,0.0005041671,0.14168331,0.0041532866,0.00004403183],"about_ca_topic_score_codex":0.012327424,"about_ca_topic_score_gemma":0.009895675,"teacher_disagreement_score":0.012327424,"about_ca_system_score_codex":0.0018529791,"about_ca_system_score_gemma":0.0021008672,"threshold_uncertainty_score":0.025380015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31723887,0.0005300363,0.67530936,0.0007198086,0.00005061538,0.00009398926,0.00012303438,0.00032429252,0.005610063],"genre_scores_gemma":[0.9740868,0.00029974605,0.023112658,0.00015468826,0.000048777005,0.00009378319,0.000074125455,0.00004175008,0.0020876543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866784,0.00039364802,0.000070732305,0.00022031588,0.0004239513,0.00022356478],"domain_scores_gemma":[0.9868722,0.008205053,0.0020100535,0.0010550966,0.001319242,0.00053833233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033897948,0.0005724017,0.0009341225,0.0015355642,0.0007801991,0.0019132375,0.0012060117,0.0010557999,0.002177845],"category_scores_gemma":[0.02472983,0.0005111295,0.00063131895,0.00097287114,0.0032131195,0.0035735182,0.0016143026,0.0017664202,0.00035777845],"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.00021677901,0.0001601605,0.005888577,0.0001593676,0.00005478784,0.0005535482,0.0006230548,0.10753078,0.0074519175,0.8621592,0.0010178572,0.014183982],"study_design_scores_gemma":[0.000035052548,0.000058669284,0.0011927655,0.000022314585,0.00001350283,0.00015024279,0.000096478805,0.69576234,0.0013470573,0.30067968,0.00060069724,0.00004122691],"about_ca_topic_score_codex":0.0017228615,"about_ca_topic_score_gemma":0.0010822744,"teacher_disagreement_score":0.0033897948,"about_ca_system_score_codex":0.0016556303,"about_ca_system_score_gemma":0.0011464733,"threshold_uncertainty_score":0.01792717},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11859287,0.00042575318,0.8758893,0.00040728255,0.00006730845,0.00016214477,0.00006296375,0.0005941698,0.0037981619],"genre_scores_gemma":[0.91603184,0.0004058647,0.08152492,0.00009741245,0.00007868706,0.00016914972,0.000058246733,0.00010714572,0.0015267514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978623,0.0011182594,0.000097523196,0.00022147111,0.00032185004,0.00037853414],"domain_scores_gemma":[0.9936791,0.004332145,0.00065421424,0.0003621357,0.0005508716,0.0004215854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004531399,0.0011768562,0.0015276064,0.0013790848,0.0012894461,0.0024242233,0.0018794663,0.0012906061,0.0025729109],"category_scores_gemma":[0.017729862,0.0008582056,0.00046336267,0.0015930199,0.0017039859,0.003002784,0.001197108,0.001299688,0.00055908493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001798023,0.00013758944,0.000644497,0.00008093242,0.000038147493,0.000059965918,0.00024306633,0.9149871,0.003114194,0.061865844,0.0010114706,0.017637458],"study_design_scores_gemma":[0.000026277177,0.000043581993,0.00011415309,0.00000872039,0.000010958461,0.000014164433,0.000030509776,0.9670123,0.00076003093,0.031665746,0.00030278135,0.00001073144],"about_ca_topic_score_codex":0.0021362843,"about_ca_topic_score_gemma":0.0016404276,"teacher_disagreement_score":0.004531399,"about_ca_system_score_codex":0.003097804,"about_ca_system_score_gemma":0.0022388347,"threshold_uncertainty_score":0.023964584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2847844,0.0007806309,0.70143586,0.0016905004,0.0009361337,0.00032508132,0.0005036783,0.0019323786,0.007611356],"genre_scores_gemma":[0.9187676,0.00021578633,0.07163327,0.00027554494,0.00022650756,0.000081460246,0.00017923999,0.00006884978,0.008551779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836403,0.00038457278,0.00007947166,0.0003648032,0.00038050945,0.00042655048],"domain_scores_gemma":[0.9936045,0.00301841,0.00023786051,0.0007417237,0.0011311608,0.001266425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029294242,0.00065281434,0.0018147168,0.0011810052,0.0021254222,0.0037775266,0.0030717477,0.0021898202,0.007568394],"category_scores_gemma":[0.0066806637,0.00062143133,0.0007789603,0.0018222817,0.0012349613,0.0026128825,0.0019309057,0.0022956238,0.00074240175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0068309973,0.002037624,0.0060463296,0.0004967318,0.00021588354,0.002657943,0.0011632651,0.43488845,0.04633007,0.35200515,0.012375213,0.13495237],"study_design_scores_gemma":[0.0005254807,0.00032221185,0.000422321,0.000012744224,0.00006082916,0.000176844,0.00003941658,0.96388054,0.0029062843,0.03015062,0.0014353752,0.00006732378],"about_ca_topic_score_codex":0.009254109,"about_ca_topic_score_gemma":0.0052169547,"teacher_disagreement_score":0.009254109,"about_ca_system_score_codex":0.0035090349,"about_ca_system_score_gemma":0.0036399171,"threshold_uncertainty_score":0.025459886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64922714,0.0029459773,0.32038572,0.0030621781,0.00036932074,0.000117805495,0.00066829,0.0010147099,0.022208858],"genre_scores_gemma":[0.98696184,0.000444965,0.0078116814,0.00011930967,0.00014906358,0.000031089374,0.00013982088,0.00008669928,0.004255548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939287,0.00013249856,0.000021429974,0.00010561632,0.00014583296,0.00020170562],"domain_scores_gemma":[0.9962308,0.0021761814,0.00043266692,0.00018207177,0.0006438417,0.00033456457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00256,0.00066126056,0.0006932893,0.001742918,0.00089671335,0.0019234538,0.0018898814,0.0010740908,0.0039390256],"category_scores_gemma":[0.010720714,0.0006139152,0.00037734138,0.0012753711,0.0015221845,0.0019451643,0.0009192839,0.0016016306,0.0005679947],"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.0006481366,0.00021559086,0.007096789,0.0002532473,0.000054168275,0.0005835931,0.00094024034,0.32790992,0.01799611,0.6185528,0.008808753,0.016940666],"study_design_scores_gemma":[0.000023320832,0.000033147924,0.0010658652,0.000020891506,0.000015093262,0.00009326607,0.00008492053,0.97268254,0.0011039497,0.024202509,0.0006410646,0.000033436565],"about_ca_topic_score_codex":0.008827465,"about_ca_topic_score_gemma":0.0046528634,"teacher_disagreement_score":0.008827465,"about_ca_system_score_codex":0.004556797,"about_ca_system_score_gemma":0.0024216934,"threshold_uncertainty_score":0.03306198},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22479002,0.0009643847,0.7708985,0.00035529214,0.000053959116,0.00003478693,0.000021547132,0.00009470264,0.002786787],"genre_scores_gemma":[0.98927003,0.00018574638,0.010039309,0.00002038639,0.000026893795,0.000025257494,0.000008833315,0.000008719588,0.00041483346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992374,0.0002570497,0.000024485913,0.00008246935,0.0002339275,0.00016455904],"domain_scores_gemma":[0.9981863,0.0012826666,0.00022587186,0.00008032216,0.00015133257,0.000073493895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012952301,0.0006014773,0.0005687339,0.0006880908,0.00037503117,0.0012064741,0.0011465542,0.0006016676,0.000517447],"category_scores_gemma":[0.0057987096,0.00037841345,0.00030638793,0.0005090315,0.00093769655,0.0016409961,0.0008719737,0.0006460755,0.00006359668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017017743,0.00003846001,0.00071012776,0.00004459916,0.000029053019,0.00009026238,0.0001000559,0.91398,0.0074920007,0.06090367,0.00016147857,0.01628015],"study_design_scores_gemma":[0.0000043058603,0.000010651782,0.00007369824,0.0000025642778,0.000004629693,0.000011119186,0.0000072394514,0.99343187,0.0006471168,0.005745524,0.000057831632,0.000003429855],"about_ca_topic_score_codex":0.0028563957,"about_ca_topic_score_gemma":0.0010993456,"teacher_disagreement_score":0.0028563957,"about_ca_system_score_codex":0.0013630462,"about_ca_system_score_gemma":0.00095258915,"threshold_uncertainty_score":0.009889603},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33707476,0.0024573212,0.6340236,0.0027721901,0.00030776273,0.0001942022,0.0006257814,0.00041726636,0.022127012],"genre_scores_gemma":[0.97974396,0.00064887793,0.009515938,0.000101587626,0.0000867505,0.000040045503,0.00012038074,0.000064999025,0.009677405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945134,0.00010751052,0.000019889949,0.00009408192,0.00012409271,0.00020301218],"domain_scores_gemma":[0.998243,0.0010337796,0.00017363882,0.000043440392,0.00034957952,0.00015660473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000971496,0.0007572716,0.00064317207,0.00074019376,0.0007035841,0.0014101565,0.00093497284,0.0006580665,0.0052747647],"category_scores_gemma":[0.0028963815,0.0003293379,0.0005499104,0.00043177142,0.0007115317,0.0012388002,0.00089613843,0.0008459851,0.00031184396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050498504,0.00008598416,0.0031747585,0.00020968978,0.000086357744,0.00056029245,0.00032888722,0.86728007,0.012953909,0.09833846,0.003530614,0.0129458625],"study_design_scores_gemma":[0.0000078334615,0.000031734962,0.00024645086,0.000006477665,0.000014751288,0.000028479366,0.000040721457,0.9928444,0.00063469924,0.0057512154,0.0003850784,0.00000816835],"about_ca_topic_score_codex":0.018188557,"about_ca_topic_score_gemma":0.010308592,"teacher_disagreement_score":0.018188557,"about_ca_system_score_codex":0.0029372412,"about_ca_system_score_gemma":0.0019825604,"threshold_uncertainty_score":0.036165416},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08417566,0.00057842844,0.90693015,0.0017315733,0.00008590514,0.00019703491,0.00010230414,0.00016793878,0.006030997],"genre_scores_gemma":[0.93824893,0.00046403715,0.058515806,0.00015421618,0.00008061919,0.00015714238,0.00003579888,0.000051219315,0.0022921117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519664,0.002649395,0.0002220106,0.0006237547,0.00055714225,0.00075112097],"domain_scores_gemma":[0.9859686,0.010066315,0.0014501382,0.00066480075,0.0008499636,0.0010001583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008062602,0.0011001214,0.0016575601,0.000973965,0.00079114205,0.0031099543,0.00213352,0.0018160007,0.0032371539],"category_scores_gemma":[0.022782596,0.00094559067,0.00091727456,0.00086206215,0.0023794917,0.005308528,0.0022479177,0.0024339221,0.00033244514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002999381,0.00021814513,0.00095396163,0.00018194545,0.00006386203,0.00019330274,0.0003198557,0.49809766,0.0043359264,0.4777598,0.0011020977,0.01647363],"study_design_scores_gemma":[0.00013036747,0.00017172669,0.00026155266,0.000029881863,0.000028483386,0.0000632672,0.00012437235,0.7467123,0.0017278421,0.24972045,0.0009860841,0.0000436429],"about_ca_topic_score_codex":0.0017321751,"about_ca_topic_score_gemma":0.0010222758,"teacher_disagreement_score":0.008062602,"about_ca_system_score_codex":0.004233344,"about_ca_system_score_gemma":0.0036314463,"threshold_uncertainty_score":0.042639613},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016400415,0.00044753638,0.9821354,0.00033361258,0.000021058357,0.000031140466,0.00003298355,0.0001529973,0.00044484666],"genre_scores_gemma":[0.47767186,0.0020230045,0.515288,0.00038829446,0.0003952743,0.00029996844,0.00044888267,0.00019534254,0.003289291],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962662,0.0021869703,0.00016949027,0.00044150662,0.0005747008,0.00036116203],"domain_scores_gemma":[0.9786225,0.018284267,0.0011058359,0.00073355634,0.0010332685,0.00022055129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00920265,0.0011049001,0.0014327542,0.001281753,0.0006589194,0.002142767,0.0017137333,0.0018458185,0.0010310968],"category_scores_gemma":[0.040731728,0.0011477447,0.0007745967,0.0014027955,0.0018704926,0.002704908,0.0026158926,0.0012699438,0.00041654214],"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.00018254935,0.000093491646,0.0064587663,0.00014257527,0.00013914068,0.00013437912,0.00018728747,0.8227345,0.0021110452,0.070978165,0.0014696612,0.09536853],"study_design_scores_gemma":[0.000012744655,0.000019603915,0.00044745393,0.000011634924,0.00000787703,0.000020114356,0.000014111515,0.9839076,0.0004626972,0.01488295,0.00020128756,0.000011903798],"about_ca_topic_score_codex":0.011469094,"about_ca_topic_score_gemma":0.007418373,"teacher_disagreement_score":0.011469094,"about_ca_system_score_codex":0.0014591591,"about_ca_system_score_gemma":0.0026032089,"threshold_uncertainty_score":0.0486688},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07139093,0.00044826345,0.9234628,0.0004796626,0.000084844876,0.00006361852,0.00024480865,0.0002720759,0.0035528836],"genre_scores_gemma":[0.97840095,0.00024846738,0.016225155,0.000069232265,0.000036901238,0.00009536693,0.00016353892,0.00003910773,0.004721395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991473,0.0003202379,0.000044947385,0.000165876,0.00018749558,0.00013420206],"domain_scores_gemma":[0.9974527,0.0017861853,0.00027277117,0.00008718191,0.0002889689,0.0001122095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024865402,0.0010599025,0.0020229965,0.0007782462,0.0005326708,0.0025354659,0.0018551357,0.00202655,0.0029298544],"category_scores_gemma":[0.0043741534,0.0012035874,0.0009124063,0.0009925602,0.0014431744,0.0017728911,0.0012865688,0.001362169,0.00025454318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022510996,0.0000090964795,0.00010622451,0.000011103546,0.000011331726,0.000017469729,0.000010131784,0.9943731,0.00013660286,0.0044041374,0.00006700064,0.0008312715],"study_design_scores_gemma":[0.0000030892397,0.0000057052544,0.000030984116,0.0000010847634,0.0000034218874,0.0000013738874,0.0000015269164,0.9990024,0.000025784318,0.00089593837,0.000026560036,0.000002136243],"about_ca_topic_score_codex":0.0138854515,"about_ca_topic_score_gemma":0.009436098,"teacher_disagreement_score":0.0138854515,"about_ca_system_score_codex":0.0018843443,"about_ca_system_score_gemma":0.0015331338,"threshold_uncertainty_score":0.02760923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9227902,0.0016482932,0.030890692,0.005882655,0.0003778861,0.00009218779,0.0004259073,0.00035728028,0.037534837],"genre_scores_gemma":[0.9983188,0.00016715247,0.0006209621,0.0000824738,0.000039968196,0.0000056130925,0.000024424937,0.000014270056,0.00072627806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99449027,0.0023209688,0.0002150189,0.0006195649,0.001011532,0.0013426455],"domain_scores_gemma":[0.8466384,0.12685068,0.0123803085,0.004199157,0.005886294,0.0040452126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075709512,0.0007404601,0.00083265925,0.0008186034,0.0012720077,0.0038030937,0.0015330629,0.0031239544,0.010064343],"category_scores_gemma":[0.08496747,0.0006523525,0.00054026436,0.00065497216,0.0016724421,0.004334572,0.001854283,0.004049808,0.00066713226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0065901075,0.0016463496,0.035137136,0.00052102987,0.0002661301,0.0034580128,0.0010843718,0.6723939,0.022415265,0.16754816,0.009911243,0.07902831],"study_design_scores_gemma":[0.0008991055,0.0038022974,0.03377133,0.00017847533,0.0006289507,0.0016483931,0.0034789967,0.8096583,0.01937824,0.116098106,0.0100346245,0.00042321664],"about_ca_topic_score_codex":0.012093183,"about_ca_topic_score_gemma":0.004976604,"teacher_disagreement_score":0.012093183,"about_ca_system_score_codex":0.0039068195,"about_ca_system_score_gemma":0.002312138,"threshold_uncertainty_score":0.04003948},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5720177,0.0034035023,0.38916418,0.0046167653,0.000332945,0.00017023695,0.0005170206,0.001795779,0.0279818],"genre_scores_gemma":[0.9860664,0.00058826426,0.008162253,0.0002309165,0.00016645224,0.000069630434,0.00016395621,0.00016244185,0.0043896884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986137,0.00040343922,0.00004349243,0.00017314396,0.0004048294,0.00036130843],"domain_scores_gemma":[0.97853243,0.015604011,0.001881222,0.0007407777,0.0022160506,0.0010255835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047558835,0.0009584397,0.0011025345,0.0023602264,0.0012841418,0.0023082078,0.00230402,0.002051131,0.005224054],"category_scores_gemma":[0.03253088,0.0007521362,0.00075771165,0.0012806675,0.0033664028,0.0034088518,0.0020896213,0.002753694,0.0007987798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010633555,0.00040692202,0.011924007,0.0006104637,0.0001418819,0.0010587918,0.001483598,0.57235676,0.017975539,0.36666384,0.00760605,0.018708812],"study_design_scores_gemma":[0.000030394456,0.00007551985,0.0020220852,0.00005310476,0.000036859143,0.00027008564,0.00016071691,0.97100836,0.00096149213,0.02499275,0.00033827254,0.000050433737],"about_ca_topic_score_codex":0.00817907,"about_ca_topic_score_gemma":0.0038310238,"teacher_disagreement_score":0.00817907,"about_ca_system_score_codex":0.0033695195,"about_ca_system_score_gemma":0.002025824,"threshold_uncertainty_score":0.025151849},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021431893,0.000054024385,0.9972825,0.000050007147,0.000016927035,0.000026865715,0.000038824306,0.00011240969,0.00027515658],"genre_scores_gemma":[0.2508557,0.00042280648,0.74256647,0.00023159932,0.00019679042,0.0009034283,0.0006946707,0.0003376507,0.0037907523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975631,0.0015247684,0.00008869099,0.00024524337,0.00043244535,0.00014578865],"domain_scores_gemma":[0.9833725,0.013654538,0.00048283965,0.001192171,0.0009987376,0.00029917044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00801265,0.00092966965,0.0011397924,0.0017296441,0.0010147566,0.0013468105,0.0030516554,0.0015104574,0.0046148896],"category_scores_gemma":[0.024789235,0.0008199442,0.0015797159,0.001512733,0.0024989126,0.002137725,0.0019901888,0.0027125492,0.0006991942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077637844,0.000050348295,0.0013770505,0.000051273902,0.00007496095,0.00006953507,0.00011820228,0.57730234,0.00067326997,0.39118332,0.0013640234,0.027658008],"study_design_scores_gemma":[0.000007560725,0.000010425397,0.00008509915,0.0000068534755,0.0000055950145,0.000011623119,0.0000050006092,0.9512674,0.00019616127,0.047908414,0.0004871833,0.00000857564],"about_ca_topic_score_codex":0.00999846,"about_ca_topic_score_gemma":0.009089576,"teacher_disagreement_score":0.00999846,"about_ca_system_score_codex":0.0020127362,"about_ca_system_score_gemma":0.0023063582,"threshold_uncertainty_score":0.042375445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011152466,0.0013539796,0.9950348,0.00025846675,0.0000856357,0.000044407854,0.00008935379,0.0002209944,0.0017971596],"genre_scores_gemma":[0.16155586,0.0070096464,0.8196323,0.0009751272,0.0012823332,0.00060383545,0.0007964994,0.0004611546,0.00768318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99536043,0.002407223,0.0001879482,0.0005865324,0.0012645092,0.00019337692],"domain_scores_gemma":[0.9898352,0.007570133,0.0003537795,0.001156744,0.0008770912,0.00020706806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065732547,0.0014656298,0.0016418315,0.0022990787,0.0011550274,0.0024273552,0.0030867,0.002110023,0.0053775725],"category_scores_gemma":[0.032441255,0.0011359742,0.0015737916,0.0035096968,0.0026768784,0.0058528455,0.0024277845,0.003792477,0.0017099824],"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.000038463975,0.000049338258,0.0007938073,0.0001781092,0.000048182563,0.000096346055,0.00013875116,0.08863151,0.0003340978,0.85157794,0.0057185236,0.052395012],"study_design_scores_gemma":[0.000019395924,0.000023551085,0.000105482526,0.000037966576,0.000013692756,0.00009288689,0.000015097006,0.31739908,0.00020571922,0.6736946,0.008376184,0.000016367965],"about_ca_topic_score_codex":0.005391687,"about_ca_topic_score_gemma":0.0034752355,"teacher_disagreement_score":0.0065732547,"about_ca_system_score_codex":0.0024250317,"about_ca_system_score_gemma":0.0017713425,"threshold_uncertainty_score":0.034763157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03511399,0.00059199927,0.95953035,0.00050029106,0.000092495706,0.00003712338,0.000052969775,0.00037083417,0.0037098574],"genre_scores_gemma":[0.88708395,0.001430335,0.09110498,0.0003736112,0.00047755352,0.00017596768,0.0002441625,0.00054447673,0.018564882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892265,0.0004817516,0.00003940029,0.00015210686,0.00022938337,0.00017470148],"domain_scores_gemma":[0.98961884,0.0065221842,0.0006800924,0.0009381042,0.001699439,0.0005413473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004655793,0.0010694121,0.00192992,0.0020972386,0.0008741345,0.0021473772,0.0035883598,0.0019676378,0.0035788792],"category_scores_gemma":[0.021504197,0.00078823324,0.0015274915,0.0016233681,0.0027367664,0.005955132,0.003203188,0.003644591,0.0006666035],"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.0001266998,0.00019870594,0.0013853039,0.0002179072,0.00009209032,0.00021389312,0.00038830732,0.25863922,0.0036332002,0.7158022,0.0031318902,0.016170533],"study_design_scores_gemma":[0.0000062665163,0.0000071727663,0.00015534415,0.000007579282,0.000010340393,0.000020987129,0.00001757984,0.9585861,0.00012670118,0.040802795,0.0002458829,0.000013270645],"about_ca_topic_score_codex":0.006765216,"about_ca_topic_score_gemma":0.0030886037,"teacher_disagreement_score":0.006765216,"about_ca_system_score_codex":0.0021067716,"about_ca_system_score_gemma":0.0020683599,"threshold_uncertainty_score":0.0246225},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13237052,0.0015416654,0.85028636,0.001899883,0.0005220565,0.00022264468,0.00034432157,0.00043063026,0.012381901],"genre_scores_gemma":[0.94792306,0.0011442123,0.031543072,0.00032713302,0.00027195417,0.00032805905,0.00019782691,0.000072030656,0.01819268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981925,0.00048338826,0.00007716242,0.00034685808,0.00043301727,0.0004671623],"domain_scores_gemma":[0.99687153,0.0014776981,0.00046686342,0.00017129087,0.0006616706,0.00035096327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016126143,0.0013044551,0.002161095,0.0012042266,0.0015639323,0.0035061296,0.0025344917,0.0030006089,0.0028112116],"category_scores_gemma":[0.0062282803,0.00089198304,0.001205116,0.0010914936,0.002812815,0.00392465,0.0021038104,0.0017203522,0.00052390853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016807055,0.00009965754,0.0009523143,0.00009964442,0.0000531482,0.0005463473,0.0003368188,0.835717,0.003558835,0.15243657,0.0013546717,0.004676991],"study_design_scores_gemma":[0.000026419948,0.00003476551,0.00006415026,0.000007926022,0.000014212466,0.000034906476,0.000028389131,0.9865522,0.0002780227,0.012142981,0.0007961018,0.00001979176],"about_ca_topic_score_codex":0.011364982,"about_ca_topic_score_gemma":0.0029542502,"teacher_disagreement_score":0.011364982,"about_ca_system_score_codex":0.002265042,"about_ca_system_score_gemma":0.0025085006,"threshold_uncertainty_score":0.02259767},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21327265,0.00061804045,0.761179,0.0012472942,0.0000890089,0.00036333452,0.00017085901,0.00035394475,0.022705875],"genre_scores_gemma":[0.95425177,0.00024322276,0.037854157,0.00018481139,0.00004141008,0.0001325067,0.000045604902,0.00003882212,0.007207666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999305,0.0001822816,0.0000308358,0.00014081494,0.00015120656,0.00018987323],"domain_scores_gemma":[0.99878544,0.00049151294,0.0002912909,0.0000655348,0.00016138243,0.00020492433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014344313,0.0009266395,0.0011502337,0.00064034533,0.000897728,0.002255835,0.0021752953,0.0013317626,0.004518353],"category_scores_gemma":[0.0025746564,0.0005358485,0.0007760837,0.00058482797,0.0010183753,0.001426393,0.0017091646,0.0010635331,0.00048907864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029425407,0.00024319711,0.0013403418,0.0001665828,0.00007079262,0.0003514064,0.00032234212,0.8599731,0.006419954,0.094764024,0.003307023,0.03274709],"study_design_scores_gemma":[0.00003326984,0.0001009914,0.0002584184,0.000011597403,0.000017738517,0.000037220358,0.000066526576,0.9829556,0.00061233237,0.015286945,0.00060200144,0.000017298298],"about_ca_topic_score_codex":0.00849046,"about_ca_topic_score_gemma":0.0056890594,"teacher_disagreement_score":0.00849046,"about_ca_system_score_codex":0.002946405,"about_ca_system_score_gemma":0.0017883222,"threshold_uncertainty_score":0.021377802},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37139916,0.0006898265,0.61774474,0.0006329367,0.00011615344,0.000112176065,0.00009695732,0.00065379165,0.008554182],"genre_scores_gemma":[0.9784717,0.00016758658,0.019617267,0.00008443724,0.000050941962,0.00005996874,0.000034999848,0.000045672623,0.0014674378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837637,0.00057275384,0.0001079043,0.00023370428,0.0003368556,0.00037242624],"domain_scores_gemma":[0.9969259,0.0015309457,0.00042145295,0.0004943195,0.00031419436,0.00031314767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002598773,0.0008096213,0.0011133305,0.0007311347,0.0010914832,0.0017076333,0.0012557846,0.00066094747,0.0021513617],"category_scores_gemma":[0.006862566,0.0005556311,0.00063973083,0.0011229636,0.0018795943,0.002711824,0.0020015142,0.0011851466,0.00033616112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041987203,0.00014690956,0.0017134887,0.0000823253,0.00006584849,0.00031334045,0.00026731714,0.87283033,0.008872198,0.092148066,0.0011351096,0.022005199],"study_design_scores_gemma":[0.0000101416945,0.00006585524,0.00017849775,0.000004782007,0.000010517281,0.00003499497,0.000025742595,0.9832103,0.00068838807,0.015473912,0.00028664217,0.000010067522],"about_ca_topic_score_codex":0.0032421288,"about_ca_topic_score_gemma":0.0016181498,"teacher_disagreement_score":0.0032421288,"about_ca_system_score_codex":0.0015339361,"about_ca_system_score_gemma":0.001084543,"threshold_uncertainty_score":0.013743818},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055691026,0.0019399377,0.8869693,0.0022693626,0.0005487062,0.00010723979,0.00046770775,0.00094058114,0.05106618],"genre_scores_gemma":[0.79792,0.001424557,0.15759414,0.00077681063,0.0006366154,0.00022847435,0.00048583967,0.00074206217,0.040191445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845207,0.00053099415,0.000036049514,0.00016632574,0.00040835884,0.00040617952],"domain_scores_gemma":[0.9938737,0.0035537526,0.00039005108,0.0007363493,0.00093666953,0.00050951564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046391655,0.00096841174,0.0012568987,0.0016926297,0.0016665697,0.0033093307,0.005265503,0.0024043988,0.010139473],"category_scores_gemma":[0.01860957,0.0007724841,0.0012669571,0.0023057624,0.0021880204,0.003665843,0.0020463793,0.0032320376,0.0022025849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018440571,0.000085749016,0.001279352,0.00008581185,0.000027446633,0.00013063148,0.0002455042,0.561188,0.0007202082,0.4118702,0.01097739,0.0132053625],"study_design_scores_gemma":[0.0000070236288,0.000005863136,0.00014467728,0.00001262511,0.000008185542,0.00002069224,0.000029649818,0.97532845,0.000116092255,0.02348329,0.0008336404,0.00000972648],"about_ca_topic_score_codex":0.02848431,"about_ca_topic_score_gemma":0.022981498,"teacher_disagreement_score":0.02848431,"about_ca_system_score_codex":0.007631084,"about_ca_system_score_gemma":0.0038527036,"threshold_uncertainty_score":0.05663705},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2821915,0.00040721663,0.7030899,0.0012528218,0.00018372116,0.00035338153,0.00017506588,0.0004948553,0.011851569],"genre_scores_gemma":[0.91970485,0.00030173443,0.06519566,0.00020736798,0.00017520634,0.0004142533,0.00020045062,0.00008575501,0.013714785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927174,0.0029603883,0.00038751308,0.0012303795,0.0018502225,0.0008540322],"domain_scores_gemma":[0.9711807,0.019512767,0.003962764,0.0018882557,0.0018278282,0.0016276541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009955421,0.0008504421,0.0015909745,0.0018633336,0.0020982926,0.00432132,0.0025489307,0.003248771,0.007380847],"category_scores_gemma":[0.02935145,0.0012529447,0.0017941805,0.0015119417,0.00386674,0.0068216287,0.0046552513,0.0031182454,0.001683703],"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.00051111996,0.00020777482,0.006079896,0.00011914301,0.000081847145,0.0019237392,0.0021170871,0.07190415,0.00401096,0.89822793,0.0010773266,0.013739026],"study_design_scores_gemma":[0.00017773142,0.00027310872,0.0012255973,0.000055379278,0.00009562468,0.00070070056,0.0004450512,0.60025656,0.003827841,0.38992313,0.002863815,0.00015540897],"about_ca_topic_score_codex":0.0017089547,"about_ca_topic_score_gemma":0.0011313526,"teacher_disagreement_score":0.009955421,"about_ca_system_score_codex":0.0020619722,"about_ca_system_score_gemma":0.0012371872,"threshold_uncertainty_score":0.052649915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17110874,0.0024932437,0.80061936,0.0017759372,0.00024878414,0.00007557474,0.00023507688,0.0009080943,0.022535097],"genre_scores_gemma":[0.97201467,0.001022217,0.016861169,0.0003383084,0.00042575598,0.00007031174,0.00017584399,0.0002532465,0.008838422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980736,0.0004954517,0.000071208306,0.00022465369,0.0007538945,0.0003812766],"domain_scores_gemma":[0.9854102,0.008982239,0.0013039848,0.0014157086,0.0020627207,0.0008250375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004988486,0.00108528,0.0013635247,0.0024501744,0.0010808891,0.0031126905,0.0033948452,0.0016472404,0.0043793065],"category_scores_gemma":[0.039311934,0.0008206497,0.00079707697,0.0016945412,0.0028239004,0.0061431173,0.00260627,0.003996602,0.0007698511],"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.00018262735,0.00015968342,0.0022987125,0.00014196931,0.00003715519,0.00033917683,0.00053550897,0.15206246,0.0045419573,0.8213798,0.003659423,0.014661497],"study_design_scores_gemma":[0.00001767165,0.000023989913,0.0005200314,0.000023806331,0.000014082809,0.0001239588,0.000058630318,0.7684501,0.0005266443,0.22951591,0.000699707,0.000025409008],"about_ca_topic_score_codex":0.004187057,"about_ca_topic_score_gemma":0.0023108611,"teacher_disagreement_score":0.004988486,"about_ca_system_score_codex":0.0030987496,"about_ca_system_score_gemma":0.0022541496,"threshold_uncertainty_score":0.02638197},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63781464,0.0010341655,0.34782138,0.0009928637,0.00008820132,0.000058631045,0.00014570024,0.0006358943,0.01140848],"genre_scores_gemma":[0.98627037,0.0003870167,0.010597273,0.00012072918,0.00009069359,0.00005425239,0.000121632795,0.000057681573,0.0023004804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993979,0.00014440571,0.000020000536,0.00009364311,0.00017057151,0.00017342044],"domain_scores_gemma":[0.99525744,0.0024739963,0.0006832271,0.00031077876,0.0007457641,0.0005287554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002135705,0.0007029055,0.0007815697,0.0014616193,0.0007110098,0.0018170867,0.0019571856,0.001081726,0.002324029],"category_scores_gemma":[0.014262445,0.00040642798,0.0005611826,0.0009164731,0.0021870045,0.0028412126,0.0011715288,0.0020156347,0.00035465098],"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.00029835047,0.00014332116,0.0044868,0.00017592894,0.00006028693,0.00087580725,0.0005904163,0.15596701,0.013050472,0.81127274,0.0021253396,0.010953529],"study_design_scores_gemma":[0.000026648993,0.0000755218,0.0015933373,0.000027529455,0.000029439938,0.00018011084,0.00009542963,0.8819077,0.0018250289,0.11371829,0.0004828767,0.00003822064],"about_ca_topic_score_codex":0.004928222,"about_ca_topic_score_gemma":0.0020069536,"teacher_disagreement_score":0.004928222,"about_ca_system_score_codex":0.0020995103,"about_ca_system_score_gemma":0.0010904139,"threshold_uncertainty_score":0.015233099},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2568162,0.00021413466,0.7377938,0.00027772278,0.00007097105,0.000088750974,0.00018367528,0.00066545524,0.0038892308],"genre_scores_gemma":[0.9261428,0.00016823313,0.07241755,0.000035252117,0.000018199822,0.00013655843,0.00016108772,0.00003961786,0.00088072574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968565,0.00012606045,0.000013132567,0.000022904149,0.000105703795,0.000046635694],"domain_scores_gemma":[0.99792576,0.0015553929,0.000121263685,0.00012018949,0.00019709487,0.00008025197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096418976,0.00056023186,0.00060892524,0.0005066676,0.0005373988,0.0005307589,0.00084161764,0.00081802206,0.0010818621],"category_scores_gemma":[0.0040216567,0.00033359506,0.00040514948,0.00047937807,0.0005639868,0.0007723343,0.00070881436,0.0009918611,0.0000925033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025696005,0.000016439404,0.000500443,0.000009445651,0.000008292521,0.000024991763,0.000025882257,0.99121803,0.00064016454,0.0051934095,0.00008054241,0.002256696],"study_design_scores_gemma":[0.0000015678215,0.0000033457864,0.000030804746,5.613003e-7,7.278313e-7,0.0000022113222,0.000001731395,0.99921775,0.000107023065,0.00059401034,0.000039408176,8.4187417e-7],"about_ca_topic_score_codex":0.0064462945,"about_ca_topic_score_gemma":0.0035782668,"teacher_disagreement_score":0.0064462945,"about_ca_system_score_codex":0.0006188166,"about_ca_system_score_gemma":0.0005856312,"threshold_uncertainty_score":0.012817562},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044357087,0.004511342,0.92090124,0.0048332247,0.0011924165,0.00012861757,0.00017650696,0.00026696833,0.023632625],"genre_scores_gemma":[0.8945165,0.0037020124,0.08098881,0.0009828866,0.0023556482,0.00014903865,0.00010291677,0.00015518686,0.01704698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984896,0.0004906682,0.00006574371,0.00019872072,0.0006086412,0.00014663972],"domain_scores_gemma":[0.9970861,0.001870881,0.00021518537,0.00027551543,0.00040006405,0.0001522172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002778724,0.0005861751,0.0011731873,0.0005992494,0.001198819,0.0017519632,0.0015939766,0.0018079403,0.0036921373],"category_scores_gemma":[0.005879485,0.0004589693,0.00081878866,0.0011535167,0.002182406,0.003392373,0.0017662368,0.0022677677,0.000590876],"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.00027910076,0.00006474911,0.0013062677,0.00038294645,0.000050553004,0.0016444591,0.0005508812,0.3145756,0.00890064,0.64215595,0.006980847,0.023107912],"study_design_scores_gemma":[0.000033446428,0.00017688487,0.0007412525,0.000047698264,0.000037020975,0.00037340468,0.000102589096,0.77479994,0.0007405353,0.20719841,0.015682513,0.0000662631],"about_ca_topic_score_codex":0.0057574944,"about_ca_topic_score_gemma":0.0030411442,"teacher_disagreement_score":0.0057574944,"about_ca_system_score_codex":0.0014283295,"about_ca_system_score_gemma":0.001047972,"threshold_uncertainty_score":0.014695466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61394686,0.0006811087,0.33200786,0.0071350206,0.0010999368,0.00030041163,0.001260628,0.0022678412,0.041300394],"genre_scores_gemma":[0.9630212,0.0001742627,0.022885801,0.00044444873,0.00022763306,0.00003447226,0.00018716764,0.00008600516,0.012939057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995067,0.00007964855,0.000015761925,0.00009529275,0.00013062119,0.00017199216],"domain_scores_gemma":[0.9984732,0.0004979332,0.00008994132,0.00012136609,0.0004139898,0.0004034748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010209272,0.0005939719,0.0009295723,0.0010703524,0.0020101622,0.0032627224,0.0016106126,0.0023275176,0.00707323],"category_scores_gemma":[0.0037721847,0.00040474013,0.0005690568,0.0011025292,0.0011859129,0.0016538391,0.0017747257,0.0016311776,0.0008986224],"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.0032449728,0.00077300856,0.008959918,0.00037628273,0.00012656716,0.006180811,0.00072524004,0.27537984,0.045932774,0.5828349,0.033523433,0.041942235],"study_design_scores_gemma":[0.0001691779,0.0001919318,0.0009391985,0.00001647449,0.00004788983,0.00045323907,0.00014148722,0.9001509,0.0050736726,0.09020687,0.0025487738,0.000060480594],"about_ca_topic_score_codex":0.0095529,"about_ca_topic_score_gemma":0.0051715104,"teacher_disagreement_score":0.0095529,"about_ca_system_score_codex":0.002392903,"about_ca_system_score_gemma":0.0020769928,"threshold_uncertainty_score":0.02366227},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19527735,0.002409662,0.7855613,0.0018881062,0.00032905547,0.000111850575,0.00033994985,0.00047210619,0.013610619],"genre_scores_gemma":[0.97525966,0.0006196227,0.016992364,0.00020441935,0.00016681214,0.000043898228,0.00015192605,0.0000878279,0.006473514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990526,0.0002101986,0.00003133439,0.00015201498,0.0002589887,0.00029484474],"domain_scores_gemma":[0.9967417,0.0017701025,0.00031990712,0.00010844836,0.0007609396,0.0002989522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025444466,0.001041129,0.0012167756,0.0016869763,0.0010845647,0.002281411,0.0027012497,0.0009556996,0.0034861001],"category_scores_gemma":[0.006507974,0.00065071357,0.0010956278,0.0009950598,0.0018039992,0.0023170433,0.0014250741,0.0014349452,0.00027732304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027585906,0.00013944332,0.0027525898,0.00024049911,0.00010382776,0.0005297259,0.00028539964,0.6357976,0.0072458317,0.33963355,0.003797299,0.009198408],"study_design_scores_gemma":[0.0000048662064,0.000011109703,0.00016502931,0.0000046298405,0.000009292204,0.000021745169,0.00001735734,0.992137,0.00018769043,0.0073310663,0.000103842154,0.0000062400613],"about_ca_topic_score_codex":0.017448027,"about_ca_topic_score_gemma":0.008590983,"teacher_disagreement_score":0.017448027,"about_ca_system_score_codex":0.004649709,"about_ca_system_score_gemma":0.0034348592,"threshold_uncertainty_score":0.034692943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57395047,0.00090927916,0.28813875,0.014170594,0.00025829676,0.00016225189,0.00022430769,0.0001676856,0.1220184],"genre_scores_gemma":[0.98783314,0.00014794973,0.009950021,0.00020644124,0.00009915591,0.000053637523,0.000021543696,0.000015998712,0.001672056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99442333,0.0031717876,0.00023796438,0.0005757368,0.00096864684,0.0006226381],"domain_scores_gemma":[0.9784465,0.013180329,0.0031298653,0.001243573,0.0023210899,0.0016785731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045944504,0.00022400935,0.00031958055,0.0009310237,0.0023390583,0.0043621836,0.00094270677,0.001508787,0.0028766927],"category_scores_gemma":[0.020635579,0.0002979951,0.00040640935,0.0007809169,0.0071223355,0.0045611947,0.002168188,0.0016808851,0.00023849054],"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.000036811274,0.000046148656,0.002467245,0.000021769,0.000007768937,0.00009675567,0.002059903,0.0031745986,0.00042566573,0.98468417,0.0008288977,0.0061502857],"study_design_scores_gemma":[0.000037444614,0.000045674835,0.0026820446,0.000023722156,0.000010792392,0.000076486576,0.0017564873,0.031769004,0.00029109337,0.95868915,0.004579915,0.00003812681],"about_ca_topic_score_codex":0.005318826,"about_ca_topic_score_gemma":0.0048272405,"teacher_disagreement_score":0.005318826,"about_ca_system_score_codex":0.002708579,"about_ca_system_score_gemma":0.0023382306,"threshold_uncertainty_score":0.024298012},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19443412,0.0013737037,0.791158,0.0011639054,0.00017344371,0.00006434338,0.00020508512,0.00028996204,0.01113731],"genre_scores_gemma":[0.9740976,0.0006359568,0.017618638,0.000075848744,0.0001097341,0.000055938028,0.000117593416,0.000049655235,0.0072390013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879575,0.00027698133,0.000042202057,0.00022899361,0.00037487602,0.000281282],"domain_scores_gemma":[0.99660045,0.001797061,0.0006299972,0.00021059973,0.00044043348,0.0003215387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016392308,0.0007026457,0.0009597181,0.0010362403,0.00060406566,0.0016478781,0.0016432812,0.0011298545,0.0043037953],"category_scores_gemma":[0.007102341,0.0004935702,0.0007026537,0.0007981392,0.0021008104,0.0018934566,0.0008912108,0.0014476562,0.00041810758],"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.00010620235,0.000054955366,0.0012177995,0.000092603776,0.000034862067,0.0003651317,0.0002163437,0.6508622,0.0049943537,0.3352475,0.00082051597,0.005987486],"study_design_scores_gemma":[0.0000085455895,0.000025233761,0.00023921633,0.0000069365983,0.000008735319,0.000032913536,0.000022292726,0.96818036,0.00036772533,0.030534104,0.0005649925,0.000008975401],"about_ca_topic_score_codex":0.004878035,"about_ca_topic_score_gemma":0.0016315728,"teacher_disagreement_score":0.004878035,"about_ca_system_score_codex":0.002160366,"about_ca_system_score_gemma":0.0010516534,"threshold_uncertainty_score":0.01567465},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031370584,0.004470509,0.9245486,0.00468752,0.0010956106,0.00025258653,0.00050726027,0.00068345445,0.032384012],"genre_scores_gemma":[0.8082627,0.0065932674,0.16349101,0.0041470393,0.002475663,0.00081209606,0.0004739978,0.00066113606,0.013083051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995808,0.0010997393,0.00014749642,0.00073316763,0.0014521059,0.0007596191],"domain_scores_gemma":[0.96852934,0.022367923,0.0016269098,0.0012231225,0.004608736,0.0016440228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007568905,0.0027348774,0.002680133,0.0031059815,0.0018881813,0.0034924836,0.0052751377,0.002226123,0.008817407],"category_scores_gemma":[0.044246487,0.0012156392,0.0025758434,0.0021219936,0.0044856435,0.008798591,0.0067562084,0.008743525,0.00083896855],"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.00035490753,0.00018449027,0.0013284223,0.0011095573,0.00015000197,0.0006397844,0.0009699992,0.044152364,0.009765875,0.90603036,0.01160788,0.023706371],"study_design_scores_gemma":[0.00012306025,0.00016164662,0.00081440713,0.00016813174,0.00013044046,0.0006141997,0.000162909,0.34808862,0.0028210145,0.6414829,0.0053267865,0.0001058907],"about_ca_topic_score_codex":0.0046753343,"about_ca_topic_score_gemma":0.0016880544,"teacher_disagreement_score":0.008817407,"about_ca_system_score_codex":0.004478405,"about_ca_system_score_gemma":0.0047605713,"threshold_uncertainty_score":0.04002869},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058614798,0.00015870483,0.93490344,0.0004302725,0.00003816224,0.00013997428,0.0002000829,0.00059909496,0.0049154717],"genre_scores_gemma":[0.5770533,0.00017773337,0.41780794,0.000112902366,0.00006259255,0.00039549975,0.0005908706,0.0002469806,0.0035521192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994918,0.00015606322,0.00003204826,0.000082772305,0.000108234606,0.00012915251],"domain_scores_gemma":[0.99593794,0.0031193467,0.00022979637,0.00021548168,0.00032396318,0.00017340978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012995012,0.00080337323,0.001166834,0.00086005783,0.0013816193,0.001621959,0.0013863696,0.00096681144,0.008822352],"category_scores_gemma":[0.0048105265,0.0006369863,0.0011827118,0.0008894997,0.0011028212,0.0012328988,0.0014521312,0.0016336326,0.00083004107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012140754,0.000047095808,0.00079787325,0.00011535465,0.000029272112,0.00014784986,0.00010596263,0.9532734,0.00083513756,0.0241603,0.00075171445,0.019614695],"study_design_scores_gemma":[0.000012832827,0.0000061907367,0.0000478049,0.0000024849212,0.0000028105264,0.000009716556,0.00001361968,0.9936441,0.00017600258,0.005957848,0.0001235001,0.0000030330866],"about_ca_topic_score_codex":0.0139437085,"about_ca_topic_score_gemma":0.014746268,"teacher_disagreement_score":0.0139437085,"about_ca_system_score_codex":0.002114061,"about_ca_system_score_gemma":0.00285725,"threshold_uncertainty_score":0.029513717},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10985612,0.00021552986,0.8874861,0.0003761337,0.00006978983,0.00011370315,0.000057994082,0.00046025024,0.0013643827],"genre_scores_gemma":[0.9168568,0.00013893536,0.081148095,0.00008917611,0.000053316307,0.00012325059,0.000057763693,0.000047748694,0.0014848411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982773,0.00076438114,0.00007284824,0.00029889692,0.0002926741,0.00029396816],"domain_scores_gemma":[0.9940824,0.0034755347,0.0009850446,0.0007761788,0.0004216133,0.0002592305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031768521,0.0006759649,0.0010614182,0.00060065085,0.0011476361,0.0012976187,0.0021107984,0.0010666227,0.0019603868],"category_scores_gemma":[0.009397441,0.0005337475,0.0006270135,0.0008066576,0.0016604064,0.0022742893,0.0013176447,0.0010598212,0.00024481892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014319639,0.00005896996,0.00033012524,0.000040960967,0.000029009329,0.00008351743,0.00006013694,0.9389761,0.0037844449,0.047058422,0.0005175382,0.008917482],"study_design_scores_gemma":[0.000014175845,0.000030157298,0.000044719767,0.0000015168474,0.0000056717786,0.00001259093,0.000008745285,0.99110186,0.00035355554,0.0082560545,0.0001636928,0.0000073721462],"about_ca_topic_score_codex":0.0018511553,"about_ca_topic_score_gemma":0.0020193579,"teacher_disagreement_score":0.0031768521,"about_ca_system_score_codex":0.0021481868,"about_ca_system_score_gemma":0.0014678193,"threshold_uncertainty_score":0.016801},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39280218,0.001283269,0.59161025,0.002143506,0.0002771331,0.00010982995,0.0003961028,0.0003561933,0.011021642],"genre_scores_gemma":[0.98384225,0.0003318384,0.009530439,0.00012492371,0.000119115306,0.000033975328,0.00014024563,0.0000560895,0.005821075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994024,0.0001400214,0.00002209337,0.00010881483,0.00013032412,0.00019637805],"domain_scores_gemma":[0.99754757,0.0012884666,0.00030302655,0.000080486854,0.0005316481,0.00024874776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001989437,0.0008564546,0.0011257725,0.0013496906,0.00084472087,0.0018302229,0.001961484,0.0011132259,0.0033329986],"category_scores_gemma":[0.0051263035,0.00059948326,0.00095333275,0.00096645043,0.001674797,0.0015682492,0.0012185785,0.0014607565,0.0003755435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028061698,0.00017424734,0.0034849488,0.00017801092,0.000089865745,0.0006895124,0.00031120444,0.71223223,0.012550614,0.25818622,0.003352477,0.008470025],"study_design_scores_gemma":[0.000004804398,0.000016590539,0.0002250533,0.0000031923043,0.000007528581,0.00002473006,0.000020748419,0.9954201,0.00017876033,0.0040009343,0.000090795176,0.000006725909],"about_ca_topic_score_codex":0.015510513,"about_ca_topic_score_gemma":0.0067535113,"teacher_disagreement_score":0.015510513,"about_ca_system_score_codex":0.0030019416,"about_ca_system_score_gemma":0.0019586363,"threshold_uncertainty_score":0.030840456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05599498,0.00030688496,0.93993586,0.000091894864,0.000040447187,0.000050442097,0.000026149008,0.00022872425,0.0033247636],"genre_scores_gemma":[0.9071108,0.000255921,0.09038431,0.00003038617,0.000032736774,0.00008294019,0.00004988564,0.000053005235,0.0020000085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868506,0.00065909966,0.000041859897,0.00014523102,0.00037004327,0.00009870875],"domain_scores_gemma":[0.9974843,0.0016382532,0.00016024418,0.00018382655,0.0004465373,0.000086829205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021396605,0.0007678069,0.0010122162,0.0008502667,0.00052291696,0.001213425,0.0011441071,0.0012353525,0.0015724606],"category_scores_gemma":[0.0055456343,0.00031431866,0.0007784038,0.0011035528,0.00063664827,0.0009802739,0.0006863834,0.0008267097,0.00027784175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014000517,0.00006405156,0.0006692155,0.00007053315,0.000028781531,0.000056169236,0.00004736528,0.96178013,0.0034181979,0.0060057216,0.00020378268,0.027516095],"study_design_scores_gemma":[0.0000018227853,0.000027732507,0.000073621006,0.0000021418548,0.0000047983485,0.0000060925577,0.0000032170592,0.9991768,0.00031557385,0.00033019637,0.00005562873,0.0000023588823],"about_ca_topic_score_codex":0.004516421,"about_ca_topic_score_gemma":0.0013804389,"teacher_disagreement_score":0.004516421,"about_ca_system_score_codex":0.0012252418,"about_ca_system_score_gemma":0.00097120414,"threshold_uncertainty_score":0.011315703},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017106358,0.00016012184,0.9966126,0.00013033167,0.000018969271,0.000018785444,0.000054815435,0.00005272102,0.001241004],"genre_scores_gemma":[0.19751278,0.0018497142,0.79179394,0.0003318149,0.0003173116,0.0003439658,0.00055407453,0.00019552039,0.007100854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981353,0.00075991603,0.00009039199,0.00029311766,0.0006084751,0.00011263293],"domain_scores_gemma":[0.99245864,0.0055464725,0.00054013886,0.00041716173,0.000838538,0.00019897394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038658802,0.00090362545,0.0012696686,0.0032487619,0.0007378451,0.002009639,0.0021948488,0.0016537469,0.0061160848],"category_scores_gemma":[0.021376746,0.0012433028,0.0013420263,0.0020492072,0.0016663919,0.0045631304,0.0021584826,0.0030338317,0.0012552501],"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.000028610664,0.0000662527,0.00081200106,0.00015034596,0.000097033546,0.00017167577,0.0001453776,0.25904793,0.00087384094,0.6913743,0.0018071773,0.045425512],"study_design_scores_gemma":[0.000012804112,0.00001468528,0.00028520866,0.000051124018,0.000019374424,0.000087977336,0.000016436274,0.583798,0.0003978366,0.4126934,0.0025859752,0.00003715236],"about_ca_topic_score_codex":0.0044952934,"about_ca_topic_score_gemma":0.0048424145,"teacher_disagreement_score":0.0061160848,"about_ca_system_score_codex":0.0016327827,"about_ca_system_score_gemma":0.0023610923,"threshold_uncertainty_score":0.020460367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35654837,0.0009618877,0.63712406,0.0005604667,0.00007081204,0.000048337257,0.00018380737,0.0002990342,0.004203216],"genre_scores_gemma":[0.9825394,0.00035310828,0.015520542,0.000021893453,0.000031497537,0.000043162785,0.00010316414,0.000032386,0.0013548564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982836,0.0007944642,0.00007104718,0.00023633345,0.00037226026,0.00024229907],"domain_scores_gemma":[0.9887138,0.007612684,0.0015617008,0.0006589149,0.0010700743,0.0003828115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048988783,0.0011430422,0.001095498,0.0014587214,0.00048134194,0.0017195867,0.0017692089,0.0013548409,0.0013118976],"category_scores_gemma":[0.019725023,0.0005627555,0.0005197919,0.001351209,0.0017314522,0.0021980614,0.0012802845,0.0012101197,0.0002175351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025360616,0.000008205301,0.00039667802,0.000010087034,0.000008166424,0.00002040367,0.000022458018,0.98704547,0.00016064012,0.011060146,0.00010232089,0.0011400611],"study_design_scores_gemma":[9.0206584e-7,0.0000064680166,0.000078016536,0.0000019917622,0.0000014601646,0.000003910246,0.000005138035,0.9967997,0.000036304664,0.0030277008,0.000036515365,0.0000019158315],"about_ca_topic_score_codex":0.008219273,"about_ca_topic_score_gemma":0.002437979,"teacher_disagreement_score":0.008219273,"about_ca_system_score_codex":0.0029815345,"about_ca_system_score_gemma":0.0006517324,"threshold_uncertainty_score":0.025908053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52171975,0.00037431036,0.45643938,0.002431903,0.0001786446,0.00009094033,0.00055729493,0.0006181548,0.01758967],"genre_scores_gemma":[0.9753146,0.00018902835,0.011995943,0.000094752024,0.000063929256,0.000033270353,0.00011737709,0.00003697557,0.012153988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993456,0.00019365428,0.000026937576,0.00015986117,0.00010389942,0.0001700286],"domain_scores_gemma":[0.9980831,0.0009424419,0.00020320968,0.00014747924,0.00028976685,0.00033402987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017328027,0.00043667684,0.0014400918,0.0012477088,0.0014472496,0.0032703404,0.0022488816,0.0030461112,0.00760587],"category_scores_gemma":[0.003592179,0.00081096706,0.0012769111,0.001927862,0.0025564497,0.0029404114,0.001779029,0.0018552957,0.00056964153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029345043,0.00014511356,0.0041463934,0.00006648397,0.00011392244,0.0014191528,0.00035770674,0.60907865,0.004601031,0.37269875,0.0017195594,0.0053597917],"study_design_scores_gemma":[0.000041578634,0.00007413564,0.0008533034,0.0000051098054,0.000029230045,0.00011196732,0.00008009136,0.96129996,0.00026294476,0.03658351,0.00061258726,0.000045688936],"about_ca_topic_score_codex":0.01895683,"about_ca_topic_score_gemma":0.010051135,"teacher_disagreement_score":0.01895683,"about_ca_system_score_codex":0.0014600368,"about_ca_system_score_gemma":0.0015027663,"threshold_uncertainty_score":0.037693024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08368762,0.00032838667,0.9129394,0.00035187294,0.00008351962,0.000058650636,0.000065822926,0.00020992187,0.0022747891],"genre_scores_gemma":[0.96289665,0.00018514828,0.034287676,0.00007362112,0.00006976619,0.000087748005,0.000060347666,0.000078772406,0.002260305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998293,0.00063242577,0.00008134893,0.00028182226,0.00029610386,0.00041525654],"domain_scores_gemma":[0.99392694,0.004252294,0.0004174898,0.00042475841,0.00052040647,0.0004580866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004068667,0.00087186234,0.001727869,0.0010412396,0.0016170255,0.002845958,0.002804396,0.001178978,0.002507881],"category_scores_gemma":[0.013918476,0.0008966304,0.0005643903,0.0013507535,0.0016512563,0.0033584149,0.0022176618,0.0016396092,0.0003175097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026805312,0.00005673923,0.0005071496,0.000036630845,0.00003433947,0.00010020388,0.00012135591,0.9080873,0.0017382228,0.07592151,0.00090540946,0.01222318],"study_design_scores_gemma":[0.0000077729555,0.000009335939,0.000048313184,0.0000020057003,0.0000049653304,0.000008588539,0.000010731876,0.984092,0.00013511896,0.01557488,0.00010118542,0.0000051193033],"about_ca_topic_score_codex":0.0040439386,"about_ca_topic_score_gemma":0.0035157523,"teacher_disagreement_score":0.004068667,"about_ca_system_score_codex":0.0032972314,"about_ca_system_score_gemma":0.0021148971,"threshold_uncertainty_score":0.023923159},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044814445,0.0012001903,0.9344526,0.00089057337,0.00012567309,0.00008479586,0.00006914958,0.00022326442,0.018139346],"genre_scores_gemma":[0.9660294,0.0012871763,0.02634177,0.00007167618,0.0001778032,0.00008735815,0.000035049074,0.000072295,0.0058974093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991498,0.00035795,0.000021090511,0.00008712586,0.00023514718,0.00014887896],"domain_scores_gemma":[0.9981034,0.0011077541,0.00022461412,0.000081710394,0.00040578374,0.000076780016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014904062,0.0011131916,0.0011812425,0.0021484625,0.0012138394,0.0024149858,0.0022768397,0.0011525709,0.002524512],"category_scores_gemma":[0.0048626526,0.00080267614,0.0008847551,0.0023502638,0.0016665505,0.0019714085,0.0011625722,0.0012322606,0.00017713505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027463968,0.0000240664,0.00020578892,0.00007377189,0.000016469134,0.00014721147,0.00007869591,0.95956737,0.00122075,0.031135125,0.0006644497,0.0068388297],"study_design_scores_gemma":[0.0000013167516,0.00001315492,0.00005286953,0.000007452695,0.000009305729,0.000013991339,0.000026589083,0.9929957,0.00025480072,0.0063796123,0.00024005811,0.0000052171094],"about_ca_topic_score_codex":0.009014719,"about_ca_topic_score_gemma":0.0060146493,"teacher_disagreement_score":0.009014719,"about_ca_system_score_codex":0.0028502212,"about_ca_system_score_gemma":0.0018507413,"threshold_uncertainty_score":0.020679891},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59294826,0.0005390913,0.39947328,0.00093237055,0.00015595679,0.00009223785,0.0004056252,0.0008281457,0.0046250583],"genre_scores_gemma":[0.98999,0.00016223069,0.007748101,0.000049403447,0.000067970504,0.00004258827,0.00013784933,0.000022987117,0.0017788099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998372,0.0003571136,0.00008201707,0.00026171427,0.0005177139,0.0004094921],"domain_scores_gemma":[0.99635494,0.0017150778,0.0005110924,0.0002269795,0.000938601,0.0002533697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002933586,0.00049434823,0.0011532024,0.0005711159,0.0007109586,0.0017159162,0.002190713,0.00095724326,0.002598915],"category_scores_gemma":[0.004656394,0.00031187755,0.00062662136,0.0008530534,0.0012218008,0.0018907964,0.00061288546,0.0008074051,0.00035088704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013593897,0.00028210986,0.0058291946,0.00029031784,0.00010293565,0.0013245799,0.00040079668,0.796861,0.02111981,0.15212803,0.0031415557,0.017160352],"study_design_scores_gemma":[0.000054682936,0.000056758483,0.00043413555,0.000006190243,0.000019231176,0.00006268724,0.000032221946,0.98843867,0.0009976013,0.009648432,0.0002362151,0.000013193703],"about_ca_topic_score_codex":0.0098760305,"about_ca_topic_score_gemma":0.005350808,"teacher_disagreement_score":0.0098760305,"about_ca_system_score_codex":0.0025718734,"about_ca_system_score_gemma":0.002542563,"threshold_uncertainty_score":0.019637108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5076609,0.0015604653,0.3678233,0.017355373,0.00024695173,0.00019708285,0.00014580703,0.0003179232,0.10469219],"genre_scores_gemma":[0.9854138,0.00018741337,0.011017009,0.00027149328,0.00005097682,0.000048020825,0.0000093662275,0.00002782258,0.002974074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914038,0.0041144905,0.00035708217,0.00055658625,0.0025545983,0.0010134637],"domain_scores_gemma":[0.9833977,0.011266266,0.0015215197,0.0013215889,0.0015077584,0.0009850716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0111999195,0.00026649388,0.00054578856,0.00072393456,0.0022650363,0.0064310087,0.0015437683,0.0031122228,0.0030928748],"category_scores_gemma":[0.050081607,0.00048015278,0.0005355352,0.0009538811,0.0063535557,0.004771879,0.0026484344,0.0038128311,0.0003598258],"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.00005823922,0.000034259185,0.0013403762,0.000017049544,0.0000070869623,0.00008164986,0.00050984713,0.033236142,0.00040439994,0.9558081,0.0008008131,0.00770199],"study_design_scores_gemma":[0.00004637543,0.000048950926,0.0007731369,0.000037409012,0.00000891722,0.00007148326,0.0005816205,0.19329715,0.00047205325,0.7992488,0.0053761615,0.00003788996],"about_ca_topic_score_codex":0.0050063445,"about_ca_topic_score_gemma":0.004217674,"teacher_disagreement_score":0.0111999195,"about_ca_system_score_codex":0.0065391166,"about_ca_system_score_gemma":0.004801543,"threshold_uncertainty_score":0.05923158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005474411,0.000054814165,0.9927705,0.0001562431,0.0000909322,0.000076068114,0.000034677847,0.00040411457,0.0009381682],"genre_scores_gemma":[0.22329761,0.00012994606,0.7722524,0.00032704722,0.0002045095,0.00048570038,0.00016679105,0.0002621013,0.0028739234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961816,0.0025971662,0.000098975055,0.0003651413,0.00045443285,0.00030271176],"domain_scores_gemma":[0.99096394,0.0072703506,0.0005338624,0.0005600355,0.0004267123,0.00024510873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052145943,0.00093791983,0.0016414009,0.0011315407,0.00059595495,0.00092633144,0.0016595402,0.0009937031,0.0059484574],"category_scores_gemma":[0.0137589015,0.00086235837,0.001129381,0.0016275955,0.0008128502,0.0018689246,0.0011040259,0.0018381629,0.00076832296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006299364,0.00044294496,0.00071363046,0.0001320431,0.000096259384,0.000046959,0.00005144047,0.79365593,0.002489479,0.050684158,0.0043374575,0.14671983],"study_design_scores_gemma":[0.000078520934,0.00009035997,0.000072471106,0.0000044989984,0.000013644008,0.000010142847,0.0000047341405,0.9829742,0.00033685195,0.01581044,0.000591186,0.000013036336],"about_ca_topic_score_codex":0.002851692,"about_ca_topic_score_gemma":0.0038369664,"teacher_disagreement_score":0.0059484574,"about_ca_system_score_codex":0.0011129953,"about_ca_system_score_gemma":0.0030395123,"threshold_uncertainty_score":0.027577698},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098056436,0.00063870585,0.8822291,0.001902231,0.0005741789,0.00007361344,0.000045132223,0.0007442682,0.015736358],"genre_scores_gemma":[0.95578027,0.00021639167,0.035286553,0.00044919393,0.00046052126,0.00009218862,0.00003494543,0.00012347546,0.0075565004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823964,0.0007661651,0.00003791174,0.00019937931,0.00048721043,0.00026971748],"domain_scores_gemma":[0.9948,0.003441968,0.00028188157,0.00039088866,0.00064091303,0.00044447216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027851043,0.0006150376,0.0016741323,0.001272052,0.0017421725,0.002708459,0.0024462196,0.0023655635,0.005563777],"category_scores_gemma":[0.011590117,0.0007148505,0.0006705192,0.00094193366,0.0015220874,0.0035527623,0.0022518847,0.0017090638,0.0005848536],"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.0006575558,0.0002710119,0.0008977305,0.000074791584,0.000093452574,0.0001107885,0.00019843111,0.4391849,0.0077247676,0.51102567,0.0055825757,0.034178328],"study_design_scores_gemma":[0.000032392934,0.000031549385,0.00010762156,0.0000033532824,0.000011269789,0.000014055647,0.000012545612,0.88310564,0.00034025082,0.115747906,0.0005803088,0.00001309833],"about_ca_topic_score_codex":0.0018484171,"about_ca_topic_score_gemma":0.00148461,"teacher_disagreement_score":0.005563777,"about_ca_system_score_codex":0.0022796178,"about_ca_system_score_gemma":0.001525198,"threshold_uncertainty_score":0.018612623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5503896,0.0016838264,0.42282063,0.005835362,0.001263715,0.0005252855,0.0017551581,0.0028266313,0.012899742],"genre_scores_gemma":[0.9601988,0.00028494166,0.028135767,0.00030908544,0.00026090498,0.00007370634,0.0002375128,0.00009032575,0.010408986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775654,0.00054023805,0.00015254442,0.00049738126,0.0003649406,0.0006882963],"domain_scores_gemma":[0.9947792,0.0021101984,0.00052007596,0.0005215616,0.001009582,0.0010593975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047677206,0.0012184434,0.0025608966,0.0015610274,0.0029107747,0.0041098553,0.004504072,0.0044817356,0.008315275],"category_scores_gemma":[0.007779288,0.0012283507,0.0010388928,0.0025538853,0.001895708,0.0027013111,0.002110534,0.0026698133,0.001150295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031339694,0.0006260205,0.004471015,0.0002894713,0.00016065015,0.002483233,0.00036391467,0.8731517,0.011755188,0.06505109,0.011851046,0.026662724],"study_design_scores_gemma":[0.00007605936,0.0001418866,0.0003966795,0.000008124937,0.000039918912,0.00011197105,0.000052092884,0.99142903,0.0007450964,0.0065898323,0.00037968383,0.000029753162],"about_ca_topic_score_codex":0.019120391,"about_ca_topic_score_gemma":0.0103783775,"teacher_disagreement_score":0.019120391,"about_ca_system_score_codex":0.0037829748,"about_ca_system_score_gemma":0.0038523613,"threshold_uncertainty_score":0.038018227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6157598,0.0032808273,0.34345663,0.0014118981,0.00021458822,0.00007628122,0.00039886616,0.00040174712,0.034999277],"genre_scores_gemma":[0.98400104,0.00037901735,0.008562252,0.00009846053,0.000042870313,0.000034735287,0.000074409996,0.000029566992,0.0067776404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994205,0.00011098672,0.000029486288,0.00013138761,0.00014922937,0.00015846088],"domain_scores_gemma":[0.9985821,0.0005390263,0.00019775826,0.0003182488,0.00021210093,0.00015075275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005672313,0.0002670435,0.0005993062,0.00046605707,0.00084449997,0.0017122062,0.0013821628,0.00075705413,0.0046347706],"category_scores_gemma":[0.004271302,0.0002527059,0.0004746896,0.0005583918,0.0017303795,0.00256182,0.0018597505,0.00059236883,0.00041769407],"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.00032699795,0.000106358704,0.0034477531,0.00021313278,0.00003274253,0.00042372005,0.0006107174,0.1662516,0.016437074,0.77379024,0.0024751176,0.03588455],"study_design_scores_gemma":[0.00003535445,0.00013358583,0.0017029108,0.00003321652,0.000022754128,0.00067181716,0.00028541172,0.6841957,0.0069096563,0.2961253,0.009844752,0.000039589326],"about_ca_topic_score_codex":0.0019857425,"about_ca_topic_score_gemma":0.0010417968,"teacher_disagreement_score":0.0046347706,"about_ca_system_score_codex":0.0010838856,"about_ca_system_score_gemma":0.00082383736,"threshold_uncertainty_score":0.015504837},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07580904,0.001062294,0.9114951,0.0039213635,0.00014202991,0.00009812628,0.00042944122,0.00019793096,0.006844654],"genre_scores_gemma":[0.8884129,0.001353872,0.087168485,0.00044054197,0.0002800343,0.00020093413,0.0005013382,0.00018843694,0.021453364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684393,0.0015321071,0.0001815814,0.000546411,0.00049991946,0.00039610604],"domain_scores_gemma":[0.9921033,0.0060343915,0.00066940364,0.00037541476,0.0004946197,0.00032294515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007314097,0.0011465822,0.0020226499,0.0008462286,0.0007665952,0.003030126,0.0024853365,0.0025448084,0.003787303],"category_scores_gemma":[0.013789851,0.0011852623,0.0013607545,0.0013997236,0.0022836232,0.0061223954,0.0021071767,0.0027871102,0.00051879056],"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.00022902372,0.00012653755,0.0014454803,0.00019379151,0.000102828875,0.0004603314,0.00017962996,0.7372141,0.0011119434,0.2344114,0.002582975,0.021941911],"study_design_scores_gemma":[0.000036148027,0.00006836538,0.00052780757,0.00002114085,0.000030541374,0.00011619542,0.000058508587,0.8671057,0.00037711102,0.13082632,0.00080161885,0.0000304554],"about_ca_topic_score_codex":0.005008041,"about_ca_topic_score_gemma":0.0023371384,"teacher_disagreement_score":0.007314097,"about_ca_system_score_codex":0.0030792726,"about_ca_system_score_gemma":0.0020877726,"threshold_uncertainty_score":0.03868115},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23466744,0.00072247715,0.7479494,0.0015899554,0.0006800645,0.00017824657,0.00027594983,0.000963296,0.012973138],"genre_scores_gemma":[0.98032975,0.00015588706,0.014222039,0.00017071184,0.00024799514,0.000038203554,0.00008788514,0.000020093226,0.0047274013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798113,0.0005581201,0.000082107406,0.0003694215,0.0005689077,0.00044032835],"domain_scores_gemma":[0.9955545,0.001726417,0.0005776078,0.00046584883,0.0012170846,0.00045856374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002083184,0.0005708478,0.0008300102,0.00059502665,0.00068653317,0.0015612036,0.0017866334,0.0010408057,0.003667979],"category_scores_gemma":[0.007235435,0.00033667876,0.00051600416,0.0007911918,0.00081502576,0.0014260522,0.0009872185,0.0018185913,0.00040000223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015433412,0.00043823745,0.0074740965,0.00047314097,0.00016286527,0.0025897631,0.0005204705,0.5570524,0.025604807,0.2996477,0.012579943,0.09191333],"study_design_scores_gemma":[0.00006749122,0.00015556972,0.0007745693,0.0000063298194,0.0000366034,0.00022737097,0.00002603831,0.9781447,0.0014143368,0.017212505,0.0019117272,0.00002285886],"about_ca_topic_score_codex":0.0033111037,"about_ca_topic_score_gemma":0.0021119467,"teacher_disagreement_score":0.003667979,"about_ca_system_score_codex":0.0014892536,"about_ca_system_score_gemma":0.0013049409,"threshold_uncertainty_score":0.012270629},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37715036,0.00065564696,0.61040574,0.0010454967,0.00006198632,0.00008264839,0.00026655395,0.00021292597,0.010118593],"genre_scores_gemma":[0.97775465,0.00050879957,0.017097382,0.0001287549,0.00010963172,0.00007565248,0.0002164872,0.00006407466,0.004044415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986878,0.00037946363,0.00006310621,0.0003501807,0.0003077128,0.00021166768],"domain_scores_gemma":[0.9784802,0.013718315,0.0028558206,0.0010105402,0.0023575702,0.0015774919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034045372,0.0008570849,0.001147465,0.0021838425,0.0010942641,0.003745641,0.0022680785,0.0015728252,0.0026611872],"category_scores_gemma":[0.020066611,0.001006519,0.00093959016,0.0011559526,0.00404376,0.0060757077,0.0021438233,0.0029399237,0.0003148015],"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.00010283347,0.00014020794,0.0019471012,0.00007060937,0.00003584723,0.00020665124,0.00038644334,0.038736224,0.003958499,0.94863206,0.001009293,0.004774299],"study_design_scores_gemma":[0.000025489582,0.000050248695,0.0009907052,0.00001874082,0.000019930258,0.00017445468,0.000108603344,0.615011,0.0012124352,0.38159192,0.00075213064,0.00004435049],"about_ca_topic_score_codex":0.001659571,"about_ca_topic_score_gemma":0.0009827618,"teacher_disagreement_score":0.003745641,"about_ca_system_score_codex":0.0026999984,"about_ca_system_score_gemma":0.0015971921,"threshold_uncertainty_score":0.01958996},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046799403,0.0007491718,0.9253187,0.0020031312,0.00031908712,0.00016283765,0.0005207131,0.0003413248,0.023785591],"genre_scores_gemma":[0.94024885,0.00062958413,0.035822574,0.00016267001,0.00012301221,0.00018833626,0.0001675008,0.000107603446,0.022549834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900585,0.00026872326,0.000030641855,0.00024012943,0.00016981427,0.0002849392],"domain_scores_gemma":[0.99770063,0.001472553,0.00023028784,0.00006257035,0.0003265144,0.00020746047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018504902,0.001045726,0.0011227871,0.0009162369,0.00069824565,0.0027257137,0.0015073387,0.0013782503,0.006692518],"category_scores_gemma":[0.0053885784,0.0008112686,0.0007277084,0.00064205006,0.0017597828,0.0014906881,0.0016384318,0.001775035,0.00055527536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021192007,0.00009274238,0.0004985872,0.00017137588,0.00005622455,0.00009733214,0.00010841897,0.8996329,0.0018848265,0.081114605,0.0042308313,0.011900229],"study_design_scores_gemma":[0.000023525921,0.000053811887,0.00016783156,0.000010554908,0.000012986735,0.000007875493,0.000019341802,0.98591995,0.00022557986,0.013018599,0.00052651,0.000013519053],"about_ca_topic_score_codex":0.025626402,"about_ca_topic_score_gemma":0.013904183,"teacher_disagreement_score":0.025626402,"about_ca_system_score_codex":0.0036304095,"about_ca_system_score_gemma":0.0051495293,"threshold_uncertainty_score":0.05095446},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4592735,0.001944816,0.5144659,0.0020680611,0.00023253213,0.0001488737,0.00025979307,0.00027673968,0.021329708],"genre_scores_gemma":[0.991265,0.0003332457,0.005497076,0.00008252068,0.0000712281,0.00002530698,0.00003963889,0.000019403738,0.002666433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983145,0.0005613705,0.00005025022,0.00023337177,0.00033555782,0.0005049431],"domain_scores_gemma":[0.99813473,0.0008965802,0.0003204795,0.0000757505,0.00041356042,0.00015889051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001873786,0.00077116786,0.0009928042,0.0010073967,0.001153392,0.0019539283,0.0014921246,0.001198343,0.00394465],"category_scores_gemma":[0.0041736183,0.00043675097,0.00064840046,0.0009079407,0.0013341607,0.0022892882,0.0011035117,0.00097011705,0.0002919824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011898576,0.00009846595,0.002882882,0.00008012979,0.000048073995,0.0005103229,0.00023964394,0.78246576,0.0040664435,0.20062174,0.0021455572,0.0067220195],"study_design_scores_gemma":[0.000005017368,0.000013180523,0.00025207025,0.0000021391559,0.0000065158833,0.000030401607,0.00004061548,0.9894694,0.00011356454,0.009880096,0.0001789735,0.000008058774],"about_ca_topic_score_codex":0.013963718,"about_ca_topic_score_gemma":0.005266153,"teacher_disagreement_score":0.013963718,"about_ca_system_score_codex":0.002835114,"about_ca_system_score_gemma":0.001521402,"threshold_uncertainty_score":0.027764916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66454387,0.001055075,0.32793596,0.00038662017,0.000060527476,0.00009286603,0.00018767813,0.00047060088,0.005266809],"genre_scores_gemma":[0.99047077,0.00017734779,0.008670635,0.000022583286,0.000010049544,0.000014121979,0.000049572365,0.000027598227,0.00055726356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995747,0.000076177465,0.000020025913,0.00006487047,0.00018960958,0.00007464131],"domain_scores_gemma":[0.99501437,0.0034789687,0.0007960895,0.00020482301,0.00041546833,0.00009019973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014476975,0.0002781752,0.00027431158,0.0005506733,0.0002682541,0.00055900664,0.00047129698,0.00042826866,0.0015493901],"category_scores_gemma":[0.007070343,0.00018597061,0.00040999617,0.0006690258,0.0005386914,0.0011508634,0.0002084293,0.00066051324,0.00016382546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004089643,0.000091410875,0.006656238,0.00010325957,0.000025290732,0.00018893309,0.00016023751,0.9280614,0.026730157,0.023291098,0.0004968075,0.013786154],"study_design_scores_gemma":[0.000016077567,0.00024555763,0.0042990036,0.000007782845,0.000013038762,0.000068473855,0.00003360043,0.983248,0.0060405238,0.0055745943,0.00042523016,0.0000281118],"about_ca_topic_score_codex":0.0049419394,"about_ca_topic_score_gemma":0.0028815577,"teacher_disagreement_score":0.0049419394,"about_ca_system_score_codex":0.0010681724,"about_ca_system_score_gemma":0.00081453356,"threshold_uncertainty_score":0.009826362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5545959,0.001889632,0.41946316,0.0065927966,0.001152463,0.00048191583,0.0017375007,0.00095024094,0.013136455],"genre_scores_gemma":[0.9716466,0.00043413645,0.018088259,0.0004161635,0.00040097677,0.00009206314,0.000208353,0.00005602859,0.008657324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845386,0.0003700642,0.00007022741,0.00032918583,0.00028453337,0.0004920508],"domain_scores_gemma":[0.9964328,0.0017178598,0.00053098414,0.00014566166,0.0006276213,0.00054500345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003070863,0.001411098,0.0024462813,0.0015248401,0.002342099,0.0038384213,0.0033864118,0.004455595,0.0043162964],"category_scores_gemma":[0.006516572,0.00100951,0.0008198801,0.0023174898,0.0018794689,0.0023084613,0.0016581868,0.0021411271,0.0005367116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022913541,0.0005281921,0.0047348393,0.0006303033,0.00017110126,0.0042968625,0.0006697014,0.7602827,0.014933995,0.1904695,0.00852606,0.012465404],"study_design_scores_gemma":[0.00016949503,0.00017826499,0.00069515296,0.000016690188,0.00007369655,0.0002181748,0.000087792265,0.9814357,0.00091126026,0.01554972,0.0006143416,0.000049798527],"about_ca_topic_score_codex":0.013693715,"about_ca_topic_score_gemma":0.009491347,"teacher_disagreement_score":0.013693715,"about_ca_system_score_codex":0.0041322624,"about_ca_system_score_gemma":0.0029888533,"threshold_uncertainty_score":0.029981732},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17750517,0.00024800902,0.81846666,0.00035483396,0.000045337816,0.00007312726,0.00004192135,0.0003787219,0.0028861295],"genre_scores_gemma":[0.97309643,0.00009565482,0.02565597,0.000036195084,0.000021407179,0.000040270126,0.000022210894,0.00002497531,0.0010067637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882656,0.00055096636,0.000038618775,0.00015417516,0.00024104162,0.00018876356],"domain_scores_gemma":[0.9974094,0.0014706659,0.00042363722,0.00036597057,0.00022951626,0.00010079727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022684745,0.0004751282,0.0006473468,0.00049715186,0.0007320902,0.0010985181,0.001091291,0.00062057254,0.00097141974],"category_scores_gemma":[0.0055454504,0.00033880578,0.00037331702,0.00059237785,0.0012593584,0.0015417308,0.0009605285,0.00066440017,0.00014600994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009396815,0.000035211884,0.00031241865,0.000016647422,0.000016251986,0.00008743954,0.000045059624,0.94087696,0.004362363,0.045189336,0.00033591726,0.008628374],"study_design_scores_gemma":[0.0000060904504,0.000013584276,0.000040903178,8.223261e-7,0.0000024549888,0.000008626148,0.000005917141,0.9921978,0.00035928696,0.007274774,0.00008557243,0.0000041192093],"about_ca_topic_score_codex":0.0020084823,"about_ca_topic_score_gemma":0.0015676492,"teacher_disagreement_score":0.0022684745,"about_ca_system_score_codex":0.0015463178,"about_ca_system_score_gemma":0.00092521554,"threshold_uncertainty_score":0.0119969845},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31825137,0.000762196,0.6702377,0.00040767484,0.000093362876,0.00039107533,0.0001753401,0.00070757855,0.00897363],"genre_scores_gemma":[0.8758106,0.0002616755,0.121118344,0.000077228695,0.000021732767,0.00011578705,0.000107145795,0.00007182802,0.0024156375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914837,0.00036542895,0.000036504596,0.000090378264,0.00010571481,0.00025360775],"domain_scores_gemma":[0.9976671,0.0014178068,0.00036661763,0.00017909841,0.00016222823,0.00020721422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017476011,0.0008363074,0.0009518557,0.00091671327,0.0005782981,0.0012254687,0.0012191428,0.00087926135,0.0038756046],"category_scores_gemma":[0.0032759816,0.00066889776,0.00042695692,0.0009978603,0.0009094636,0.0010711021,0.0007491594,0.00063213625,0.0003681735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022318377,0.000097863965,0.00043454565,0.000050767525,0.000019751415,0.00010874474,0.00005792505,0.9752671,0.001417799,0.0073821847,0.0011389859,0.0138011435],"study_design_scores_gemma":[0.00005113249,0.00012071135,0.00019971469,0.000010119758,0.000010717952,0.000030675645,0.00006875237,0.9918828,0.0009158139,0.0060694353,0.0006265478,0.000013566513],"about_ca_topic_score_codex":0.0037577068,"about_ca_topic_score_gemma":0.004111021,"teacher_disagreement_score":0.0038756046,"about_ca_system_score_codex":0.0015741655,"about_ca_system_score_gemma":0.0011887097,"threshold_uncertainty_score":0.012965202},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046772147,0.3831325,0.5937046,0.0030857609,0.0011276867,0.00011044328,0.0002633391,0.0003237721,0.013574659],"genre_scores_gemma":[0.13800076,0.613731,0.23277435,0.0015089697,0.0082779955,0.00027253383,0.00067232875,0.00026378685,0.004498295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.996418,0.0010049671,0.0003684502,0.000567233,0.0014307683,0.00021064955],"domain_scores_gemma":[0.98919,0.008195332,0.00034082134,0.00077432056,0.001255846,0.00024376607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067223427,0.0020016418,0.0034203967,0.0044661807,0.0010984015,0.004930669,0.005220324,0.0026799836,0.0037328268],"category_scores_gemma":[0.0144650135,0.001511266,0.0013537465,0.012177608,0.0028521044,0.007699391,0.0023456942,0.00439016,0.0015336302],"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.0001256963,0.0005257278,0.0018231806,0.0030590238,0.00014220267,0.0001015516,0.0003074872,0.07253467,0.00088214804,0.48494282,0.012781223,0.4227742],"study_design_scores_gemma":[0.00005088025,0.0001923494,0.0012751764,0.0008914399,0.00010886974,0.00039229626,0.00031881235,0.22789279,0.00070962985,0.6681263,0.09993476,0.00010671973],"about_ca_topic_score_codex":0.004001274,"about_ca_topic_score_gemma":0.0021787954,"teacher_disagreement_score":0.0067223427,"about_ca_system_score_codex":0.0038615803,"about_ca_system_score_gemma":0.0038592494,"threshold_uncertainty_score":0.035551608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29902765,0.00059809414,0.6979143,0.00026729188,0.000068862246,0.000025873682,0.000070048874,0.00038152255,0.001646378],"genre_scores_gemma":[0.9613092,0.0002365412,0.037124682,0.000058905713,0.00003281196,0.000027805829,0.00007109208,0.000056933295,0.0010820286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995559,0.00009293793,0.000025322906,0.00007223972,0.00013338235,0.000120243196],"domain_scores_gemma":[0.9980026,0.00108292,0.0003031249,0.00018016681,0.00030392263,0.00012715656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018794726,0.00051481306,0.00060933083,0.0007785607,0.00038028564,0.0007523743,0.001554392,0.00074020895,0.0009295369],"category_scores_gemma":[0.005797099,0.00030584188,0.0005223602,0.0007406626,0.0006669937,0.0013647836,0.0006456973,0.00093939644,0.00017480833],"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.00008602323,0.000034201887,0.003271568,0.00003656033,0.000019503377,0.0001449084,0.00013406387,0.96248907,0.003086745,0.025357613,0.00034884163,0.0049909274],"study_design_scores_gemma":[0.0000025743198,0.0000058495575,0.00016553496,0.000001430202,0.0000024898393,0.000012021518,0.0000069221655,0.9978483,0.00017285605,0.0017268807,0.00005201288,0.0000031018067],"about_ca_topic_score_codex":0.0119314585,"about_ca_topic_score_gemma":0.00464308,"teacher_disagreement_score":0.0119314585,"about_ca_system_score_codex":0.0018519997,"about_ca_system_score_gemma":0.001259651,"threshold_uncertainty_score":0.02372402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9762616,0.00033763668,0.011592297,0.0011658901,0.00015962987,0.00018614347,0.00033781884,0.0003808319,0.009578154],"genre_scores_gemma":[0.9911788,0.00012859715,0.0048638186,0.00008576684,0.000014939862,0.000016716076,0.00020495766,0.000037371086,0.003469148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990969,0.00011297434,0.00001618203,0.00012684228,0.00010601698,0.00054110313],"domain_scores_gemma":[0.9979728,0.0005626027,0.000079386366,0.000065462875,0.0005728768,0.0007469777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016749534,0.0006394793,0.0009289972,0.0006315546,0.004996459,0.0029089404,0.0022157645,0.0016628499,0.004135221],"category_scores_gemma":[0.0023800791,0.0006771533,0.00057073194,0.001506871,0.0009672224,0.00089396635,0.0005937251,0.0012868452,0.00027677178],"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.0022147954,0.0011774324,0.013684831,0.0000819778,0.0001609898,0.0006419391,0.00077732914,0.89354134,0.0073459144,0.013391179,0.024555653,0.042426676],"study_design_scores_gemma":[0.00017438176,0.00027246034,0.008122261,0.0000115182875,0.00006763053,0.000027509592,0.0016090828,0.98356634,0.0012816058,0.0021472615,0.0026687533,0.000051264426],"about_ca_topic_score_codex":0.9028514,"about_ca_topic_score_gemma":0.9169845,"teacher_disagreement_score":0.0971486,"about_ca_system_score_codex":0.02954745,"about_ca_system_score_gemma":0.034714743,"threshold_uncertainty_score":0.21438277},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15127283,0.007086813,0.7705756,0.02225435,0.0013677116,0.0003697614,0.0005238248,0.00041587665,0.04613339],"genre_scores_gemma":[0.93530995,0.001592715,0.04845816,0.0009809092,0.0007912793,0.00008920108,0.00012180847,0.0002264254,0.012429478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702483,0.0013353744,0.00009895346,0.00026211343,0.00056085346,0.00071774545],"domain_scores_gemma":[0.99299884,0.0051924475,0.0002627184,0.0002872945,0.0009280864,0.00033065883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060126595,0.0010463652,0.001948943,0.0014151953,0.0011774455,0.00424222,0.0030381933,0.0027430227,0.009323987],"category_scores_gemma":[0.022326982,0.0005247669,0.00129905,0.0017825213,0.0013662038,0.0055384543,0.0018815043,0.0023615102,0.00033635827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031470234,0.00015568038,0.0018617591,0.00032103053,0.00006710215,0.00035000607,0.0001468689,0.57333815,0.001630301,0.38914797,0.010357138,0.022309259],"study_design_scores_gemma":[0.0000107980095,0.00003300742,0.00037200731,0.00002467892,0.000022969482,0.00005231917,0.00005213717,0.9540074,0.00032672365,0.044500157,0.0005827229,0.000015122307],"about_ca_topic_score_codex":0.02082839,"about_ca_topic_score_gemma":0.01086259,"teacher_disagreement_score":0.02082839,"about_ca_system_score_codex":0.004870712,"about_ca_system_score_gemma":0.0044778674,"threshold_uncertainty_score":0.04141432},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076417685,0.0029916218,0.87671024,0.0016531802,0.00020080863,0.00005298022,0.00012339152,0.00048648525,0.041363526],"genre_scores_gemma":[0.91236967,0.0034820358,0.060074043,0.00085808756,0.00045579558,0.00019898413,0.00026828412,0.00022899175,0.022064079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927527,0.00021355959,0.000020815114,0.00011923405,0.00027154826,0.00009945983],"domain_scores_gemma":[0.99609995,0.0024209819,0.00041654243,0.00035833643,0.00048346503,0.00022078036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023630091,0.0006431224,0.00064055255,0.0021860225,0.00060486357,0.0016610989,0.0012896316,0.0012592593,0.0060887947],"category_scores_gemma":[0.01716623,0.0004626338,0.00084666617,0.0011889623,0.0019846824,0.005040493,0.0020167793,0.0028896497,0.0009173427],"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.000015502479,0.000023750223,0.0006613347,0.00006729695,0.000018237874,0.00010934254,0.00017746336,0.03793976,0.00070638367,0.9477712,0.0016376468,0.010872131],"study_design_scores_gemma":[0.0000068768395,0.000019439696,0.00033467438,0.000023145481,0.000009168486,0.000087235574,0.00004707043,0.26848498,0.00026170284,0.72845954,0.0022548325,0.00001124281],"about_ca_topic_score_codex":0.0020174973,"about_ca_topic_score_gemma":0.0014624533,"teacher_disagreement_score":0.0060887947,"about_ca_system_score_codex":0.0015725035,"about_ca_system_score_gemma":0.0006382734,"threshold_uncertainty_score":0.020369053},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004462693,0.0001340406,0.99367356,0.00018729198,0.000024104342,0.000026047654,0.00001704065,0.00010071071,0.0013745019],"genre_scores_gemma":[0.30935252,0.00053154037,0.6841755,0.00034207662,0.00015277849,0.000532419,0.00019496924,0.0002551492,0.0044630542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973888,0.0011725381,0.000108417385,0.00036837012,0.00075686275,0.00020504917],"domain_scores_gemma":[0.986257,0.00951216,0.0005847557,0.00076739653,0.0026077365,0.00027092657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049864487,0.0009259163,0.0012474088,0.0011747843,0.00088584714,0.0021197593,0.001637464,0.0019875576,0.0034461892],"category_scores_gemma":[0.035832074,0.000599156,0.0008970261,0.001186106,0.0017183069,0.0025220406,0.00230137,0.0026269236,0.0011050097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002243937,0.00008350929,0.0011796756,0.0001450177,0.000057575893,0.0000868114,0.00026794625,0.7637198,0.003916253,0.15381539,0.0024269235,0.074076705],"study_design_scores_gemma":[0.0000113836795,0.000018019202,0.000035775327,0.000008426298,0.000003989905,0.000016784357,0.000010984935,0.98027736,0.00044042926,0.018749336,0.0004226361,0.0000048529478],"about_ca_topic_score_codex":0.0026755496,"about_ca_topic_score_gemma":0.001277674,"teacher_disagreement_score":0.0049864487,"about_ca_system_score_codex":0.001472829,"about_ca_system_score_gemma":0.0027813364,"threshold_uncertainty_score":0.026371181},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5194704,0.0004679787,0.46957904,0.0005613919,0.00008514783,0.000053890457,0.0001389296,0.00035674678,0.009286477],"genre_scores_gemma":[0.9853012,0.00012625167,0.011568723,0.000046420377,0.000043197175,0.00003155338,0.00007902715,0.000046673624,0.002756913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994791,0.0001482166,0.00001906524,0.000047722435,0.00018816807,0.00011777492],"domain_scores_gemma":[0.9964798,0.0021550262,0.0003831097,0.00013709896,0.00060611934,0.00023894638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019206062,0.00049694744,0.0006224334,0.0009869613,0.0006104786,0.0010611983,0.0014301008,0.0006848759,0.0018823077],"category_scores_gemma":[0.005976182,0.00038802024,0.0006255118,0.0006120005,0.0011504003,0.0014735416,0.00081500947,0.0009812644,0.00016828136],"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.00026753856,0.00010214138,0.001705707,0.000067953275,0.00003597693,0.00043479187,0.00030351337,0.8143111,0.009953127,0.16648774,0.0011190674,0.005211334],"study_design_scores_gemma":[0.0000045268143,0.000010682048,0.00013930496,0.0000014080597,0.0000022493823,0.000015453727,0.000011833189,0.99413437,0.00020817913,0.0054147188,0.000052624437,0.000004695247],"about_ca_topic_score_codex":0.0040840646,"about_ca_topic_score_gemma":0.0019288018,"teacher_disagreement_score":0.0040840646,"about_ca_system_score_codex":0.0016381993,"about_ca_system_score_gemma":0.0010689823,"threshold_uncertainty_score":0.01188606},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048018597,0.00097044173,0.9433267,0.0018257604,0.00030460508,0.00003793542,0.000027902608,0.00016894963,0.0053191497],"genre_scores_gemma":[0.8094064,0.0012698586,0.18393585,0.00058177183,0.00055292284,0.00013872428,0.00007872321,0.00014926311,0.0038865006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982572,0.0010067761,0.00007094077,0.00011125046,0.00041682494,0.00013697254],"domain_scores_gemma":[0.98122954,0.015490762,0.00046391168,0.0010580878,0.0011412889,0.0006164165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008309372,0.0008444106,0.0010911204,0.0016616422,0.0011204653,0.0021967639,0.0027443601,0.0013034045,0.0017042008],"category_scores_gemma":[0.03531739,0.00068394287,0.0009908009,0.0014663697,0.0039488208,0.00495067,0.0025081101,0.0032541873,0.00026994228],"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.00012843285,0.00011228005,0.0012796245,0.000057789486,0.000036451474,0.000107429354,0.00013273854,0.3432485,0.0007579811,0.6315134,0.0016943074,0.020931095],"study_design_scores_gemma":[0.0000059420922,0.0000079771,0.000058292768,0.0000049642354,0.0000024460364,0.000006068554,0.000006242927,0.9323301,0.000109845976,0.06730204,0.0001605186,0.000005561207],"about_ca_topic_score_codex":0.0058546993,"about_ca_topic_score_gemma":0.0046828957,"teacher_disagreement_score":0.008309372,"about_ca_system_score_codex":0.0020455243,"about_ca_system_score_gemma":0.0019231719,"threshold_uncertainty_score":0.043944716},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004282099,0.00012743621,0.9941275,0.00007017918,0.000017178807,0.0000489627,0.000017838582,0.0002571961,0.0010515254],"genre_scores_gemma":[0.3821205,0.00045672175,0.61315006,0.00010571431,0.000105637715,0.00071668223,0.00025315784,0.00034790355,0.0027436425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940361,0.003827985,0.00020148557,0.00034767517,0.0011767,0.00041006776],"domain_scores_gemma":[0.96066856,0.032723136,0.0012061467,0.0015677464,0.0033019988,0.0005324624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012852973,0.0018506179,0.0022086126,0.0025987532,0.0012861498,0.0027091803,0.003507451,0.002731081,0.003062392],"category_scores_gemma":[0.054262828,0.0013364117,0.0013000211,0.002300744,0.0024615044,0.0036946884,0.0037188383,0.0028986684,0.0006214236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008928429,0.00006839928,0.00032876834,0.000053357777,0.00003296444,0.000022224363,0.00007871117,0.9397238,0.0003460568,0.033774927,0.00060342153,0.0248781],"study_design_scores_gemma":[0.000006318002,0.0000105192385,0.000019751846,0.000006049338,0.000004524346,0.0000033799095,0.0000041107514,0.9884255,0.00013434944,0.011286427,0.00009578611,0.0000033038125],"about_ca_topic_score_codex":0.008765041,"about_ca_topic_score_gemma":0.0048954627,"teacher_disagreement_score":0.012852973,"about_ca_system_score_codex":0.004264268,"about_ca_system_score_gemma":0.0037290973,"threshold_uncertainty_score":0.06797379},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3163869,0.00059225946,0.6755578,0.00046795025,0.000055126788,0.00012371548,0.000071088216,0.00021790845,0.006527206],"genre_scores_gemma":[0.9501299,0.00024172294,0.047139995,0.000036804588,0.000031662035,0.00007103192,0.00005162328,0.000041221778,0.0022559525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993974,0.00022207323,0.000023145989,0.00009603926,0.00010234456,0.00015903219],"domain_scores_gemma":[0.99941707,0.0003482921,0.000060869806,0.000032918695,0.00008194334,0.000058938607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009241456,0.00058319565,0.00085298717,0.0005596707,0.0005575582,0.0011188975,0.0007960773,0.00074726815,0.0012233759],"category_scores_gemma":[0.0021982996,0.0004781926,0.00033653545,0.00068382,0.0006991649,0.0013243664,0.00062152016,0.0005138899,0.00017424586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085573505,0.0000385119,0.00029067937,0.000029756737,0.000009992584,0.000045184683,0.00002529765,0.9809949,0.002678685,0.005005793,0.00030210108,0.010493559],"study_design_scores_gemma":[0.0000049462215,0.000018634772,0.00009466462,0.0000012937761,0.0000024449866,0.0000073121323,0.000012478157,0.9962913,0.00035614526,0.0031077974,0.000100373654,0.0000026645125],"about_ca_topic_score_codex":0.0051241373,"about_ca_topic_score_gemma":0.0038973964,"teacher_disagreement_score":0.0051241373,"about_ca_system_score_codex":0.0016360554,"about_ca_system_score_gemma":0.0013287885,"threshold_uncertainty_score":0.011870503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026106052,0.0009870958,0.9659055,0.0011608746,0.00024785014,0.000029912193,0.000102681915,0.0002744362,0.0051855324],"genre_scores_gemma":[0.8917693,0.0023608098,0.08089573,0.00060808205,0.000982466,0.00017479033,0.0004134682,0.0003737323,0.022421636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988416,0.0004715707,0.000029982191,0.00014182487,0.00031005478,0.000204929],"domain_scores_gemma":[0.9948068,0.0033012866,0.00028064268,0.0003739337,0.00085386174,0.00038348313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038646997,0.000995854,0.0015464857,0.0021255335,0.0011186572,0.002421955,0.002836724,0.0020434891,0.0026368005],"category_scores_gemma":[0.019838296,0.0008752158,0.0010469875,0.0013216088,0.003470994,0.0041476656,0.0020367797,0.003933499,0.00069986883],"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.00006623562,0.000042773412,0.0005654122,0.000048386883,0.000027118984,0.000089581845,0.00012525253,0.4621442,0.0007259659,0.5276919,0.0028188045,0.0056543406],"study_design_scores_gemma":[0.0000040297145,0.0000025603388,0.00003235357,0.0000038729927,0.0000024687997,0.0000071366067,0.000006911352,0.9569233,0.00004369888,0.042711053,0.00025875465,0.0000038135402],"about_ca_topic_score_codex":0.015048593,"about_ca_topic_score_gemma":0.0067907455,"teacher_disagreement_score":0.015048593,"about_ca_system_score_codex":0.0035810445,"about_ca_system_score_gemma":0.0025194904,"threshold_uncertainty_score":0.029922009},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3277321,0.003596331,0.65744096,0.0011833624,0.00022284331,0.00014969513,0.00020771737,0.00041622372,0.00905088],"genre_scores_gemma":[0.9866911,0.00072825904,0.010198986,0.00006716422,0.00013831235,0.00004524337,0.00007623138,0.000046396086,0.0020083024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783427,0.00082687585,0.00007426781,0.00026821467,0.0005253371,0.00047108575],"domain_scores_gemma":[0.98814464,0.009128246,0.00088808493,0.00037348663,0.001072525,0.00039300142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045519136,0.0014963641,0.0015812162,0.0014373473,0.0011800526,0.0022465813,0.0016312257,0.0015579469,0.0026214137],"category_scores_gemma":[0.018502008,0.00051024306,0.0007759746,0.0011492895,0.0016497502,0.0021547403,0.0013140091,0.0017206863,0.00025851265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016874724,0.00008116217,0.0012174716,0.00014150776,0.00005570316,0.00025156,0.0003582423,0.9157348,0.005669914,0.06875311,0.0008105933,0.0067572547],"study_design_scores_gemma":[0.0000067721007,0.000069116344,0.00045327307,0.000008267384,0.000017404764,0.000050476458,0.000049506383,0.99134153,0.000270118,0.0075753652,0.00014589878,0.000012279168],"about_ca_topic_score_codex":0.0068916283,"about_ca_topic_score_gemma":0.0024062102,"teacher_disagreement_score":0.0068916283,"about_ca_system_score_codex":0.0030949381,"about_ca_system_score_gemma":0.0016620402,"threshold_uncertainty_score":0.024073124},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10716817,0.0056657176,0.83579516,0.007949425,0.0011193221,0.00019834773,0.0015716304,0.00066052703,0.03987169],"genre_scores_gemma":[0.9180622,0.0031841197,0.02121705,0.0007116914,0.0007626649,0.0002952747,0.0007712289,0.00025341133,0.05474229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702245,0.0012534607,0.00012047277,0.0004303022,0.00041007833,0.000763223],"domain_scores_gemma":[0.99002844,0.006861929,0.0008707776,0.00039187793,0.00097306696,0.00087389693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048382804,0.0017258542,0.0031849835,0.0019990765,0.0019517655,0.0069631427,0.0065995306,0.0049858,0.013317195],"category_scores_gemma":[0.015904004,0.0021627964,0.0017002102,0.0034254605,0.0036978177,0.008364978,0.0026034256,0.0042412993,0.0017360754],"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.00008768263,0.000095832,0.0007670967,0.00009798435,0.00004868786,0.0001502499,0.00028040583,0.37662867,0.00028491262,0.61291796,0.0050202897,0.0036201994],"study_design_scores_gemma":[0.000026646314,0.00001723922,0.00013352057,0.000015371854,0.000021174876,0.000026923772,0.000070562935,0.8961123,0.000042696214,0.10216555,0.001348258,0.000019695037],"about_ca_topic_score_codex":0.028122338,"about_ca_topic_score_gemma":0.015548933,"teacher_disagreement_score":0.028122338,"about_ca_system_score_codex":0.006625258,"about_ca_system_score_gemma":0.0033068655,"threshold_uncertainty_score":0.055917263},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092124805,0.00041390661,0.90423423,0.00024386696,0.00005981475,0.00009082173,0.00013048417,0.00028733097,0.0024147034],"genre_scores_gemma":[0.84817916,0.00082626514,0.14283113,0.0001463787,0.00008695343,0.000360168,0.00037011498,0.00013871698,0.0070610642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985279,0.0004516034,0.00008872285,0.0003075066,0.00045629448,0.00016804009],"domain_scores_gemma":[0.98561907,0.010030276,0.0014310689,0.0016981856,0.0008896554,0.00033173984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00575768,0.00051261205,0.001035697,0.001325848,0.0005525845,0.0016484947,0.002585145,0.0011584973,0.0029405665],"category_scores_gemma":[0.031502377,0.0006654311,0.00083870435,0.0014081219,0.0020596206,0.004622126,0.001291644,0.0017703646,0.0005959612],"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.00013777342,0.00005256098,0.0031064039,0.00006900726,0.00003100072,0.00015768092,0.00019581383,0.84517646,0.0008792664,0.1333685,0.0005548799,0.0162706],"study_design_scores_gemma":[0.0000051581233,0.0000088340275,0.00023916484,0.000009447829,0.0000037459963,0.000025695386,0.000015934085,0.98110217,0.00025142235,0.018146975,0.00018376796,0.000007745018],"about_ca_topic_score_codex":0.004488093,"about_ca_topic_score_gemma":0.0045581404,"teacher_disagreement_score":0.00575768,"about_ca_system_score_codex":0.0021356551,"about_ca_system_score_gemma":0.0013580072,"threshold_uncertainty_score":0.030449867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036434012,0.00007545689,0.995376,0.00012501716,0.000020659852,0.000066122186,0.000035112436,0.00013037371,0.00052789395],"genre_scores_gemma":[0.2794229,0.00023788045,0.7167969,0.00023656426,0.0001238731,0.000697977,0.00023766008,0.00018588464,0.0020604075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877113,0.0005663567,0.00004298824,0.00014655801,0.0003781528,0.000094773175],"domain_scores_gemma":[0.9946779,0.0038768952,0.00031626894,0.00023090652,0.0006994712,0.00019864443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004530386,0.0010478038,0.0013494003,0.0010314623,0.0006071719,0.0012274781,0.0025482445,0.001595881,0.00332542],"category_scores_gemma":[0.010233706,0.00085698644,0.0007729878,0.0012248608,0.0011350266,0.0014337478,0.0016053529,0.0021646896,0.00046223993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055095432,0.00005672651,0.00021041831,0.00005334357,0.000015237738,0.00003843238,0.000040447612,0.97009003,0.0007155979,0.011099174,0.00044361944,0.017181804],"study_design_scores_gemma":[0.000010351697,0.000009140247,0.000014362414,0.000003662829,0.0000015421799,0.0000037375198,0.000002845007,0.9969674,0.000116124225,0.0026688103,0.0001986478,0.0000034772756],"about_ca_topic_score_codex":0.0060287686,"about_ca_topic_score_gemma":0.0045218826,"teacher_disagreement_score":0.0060287686,"about_ca_system_score_codex":0.0021294237,"about_ca_system_score_gemma":0.0028098687,"threshold_uncertainty_score":0.023959279},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50024897,0.0003918951,0.49585354,0.0005518004,0.000053194668,0.000105509425,0.00016022121,0.00028423584,0.0023506621],"genre_scores_gemma":[0.98283136,0.0000935134,0.015684178,0.000038045408,0.000018155166,0.00003706498,0.000047327238,0.000038007256,0.001212292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988833,0.00037739074,0.00006096705,0.00015312884,0.0002096443,0.0003155236],"domain_scores_gemma":[0.99663407,0.0019402973,0.00065848883,0.00012383569,0.0003245147,0.00031894958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023772235,0.0008930461,0.0012002672,0.0006017226,0.00080106047,0.0022933043,0.0015894028,0.0011283552,0.0021098936],"category_scores_gemma":[0.005465844,0.0009108919,0.0005284902,0.0009711606,0.00094393716,0.0017497719,0.0009192633,0.00093801145,0.00021851482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022958327,0.000063946,0.0008154946,0.000048877464,0.000025194058,0.00010976767,0.000078342535,0.9820239,0.002819172,0.0056265993,0.000371417,0.007787741],"study_design_scores_gemma":[0.000012452064,0.00005359973,0.00021459059,0.0000039813003,0.0000098980045,0.000018183457,0.000022080518,0.9958134,0.000731329,0.0030083118,0.00010366241,0.000008479277],"about_ca_topic_score_codex":0.010232445,"about_ca_topic_score_gemma":0.006087643,"teacher_disagreement_score":0.010232445,"about_ca_system_score_codex":0.0023544827,"about_ca_system_score_gemma":0.0019849213,"threshold_uncertainty_score":0.020345807},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10286276,0.0027688027,0.87442446,0.001574059,0.00012565558,0.000069796806,0.00024310559,0.00014081296,0.017790532],"genre_scores_gemma":[0.8661131,0.006384545,0.12149735,0.000291525,0.0004903449,0.00021972222,0.00026533502,0.00019223639,0.004545794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773824,0.0011041458,0.00012005237,0.00027197791,0.00048631412,0.0002792848],"domain_scores_gemma":[0.98671895,0.009928581,0.00092906004,0.0005363451,0.0014522326,0.0004348997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045016566,0.0010559215,0.0011395068,0.0025780469,0.0012189333,0.0026610456,0.000919718,0.0009149375,0.0018753186],"category_scores_gemma":[0.016402556,0.00056995,0.0012552848,0.0019926091,0.0034658273,0.004718414,0.0017028652,0.0034069521,0.0002600384],"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.000057990026,0.00004962118,0.001479755,0.00013859056,0.000046580168,0.00036521067,0.00040356474,0.07085589,0.0025697825,0.90020907,0.001255094,0.022568995],"study_design_scores_gemma":[0.0000070912697,0.000035313475,0.0009585073,0.000052532134,0.000018284887,0.00021824046,0.00013348153,0.4998241,0.0012569121,0.49507838,0.0023787783,0.00003836708],"about_ca_topic_score_codex":0.0024087182,"about_ca_topic_score_gemma":0.0013158927,"teacher_disagreement_score":0.0045016566,"about_ca_system_score_codex":0.0018980489,"about_ca_system_score_gemma":0.0015355737,"threshold_uncertainty_score":0.023807287},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39794448,0.0012033647,0.5743501,0.006585417,0.0010898495,0.00024008699,0.00082185934,0.00058476336,0.017180108],"genre_scores_gemma":[0.9613719,0.0005559481,0.017816471,0.0006038814,0.00049301836,0.000092671544,0.00024043773,0.000059465423,0.018766196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973584,0.0005750212,0.00012135851,0.0005034941,0.0006406978,0.000800954],"domain_scores_gemma":[0.98251534,0.010889955,0.0011154604,0.0005264702,0.0028649652,0.0020877582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005230092,0.0011567341,0.0023581514,0.0015986025,0.0025153058,0.004777698,0.0046723443,0.004336156,0.00792065],"category_scores_gemma":[0.017591858,0.0013260999,0.0011881759,0.0023413463,0.0029854989,0.0051126257,0.00288037,0.0030842682,0.0008589002],"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.0015357239,0.00057544437,0.0040575354,0.00026244615,0.00012921903,0.0017884792,0.000598305,0.3402941,0.0073271897,0.62618566,0.0073054065,0.009940459],"study_design_scores_gemma":[0.0002668559,0.00014298216,0.00043463957,0.000015439613,0.000056729303,0.00028429242,0.000085576714,0.9469066,0.0004881083,0.05036834,0.00088598,0.00006448442],"about_ca_topic_score_codex":0.013275593,"about_ca_topic_score_gemma":0.008260336,"teacher_disagreement_score":0.013275593,"about_ca_system_score_codex":0.005284316,"about_ca_system_score_gemma":0.004180243,"threshold_uncertainty_score":0.03834051},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30596706,0.003296029,0.6595429,0.004445007,0.00075848034,0.00017654356,0.00062645535,0.0017137994,0.023473654],"genre_scores_gemma":[0.96191114,0.0013874674,0.017241979,0.00046143684,0.00068155176,0.00016993454,0.000346542,0.00027114342,0.017528871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983032,0.00046030563,0.00005908965,0.0002661755,0.0005268482,0.0003842806],"domain_scores_gemma":[0.97484076,0.015905067,0.0021638605,0.0010361385,0.004455996,0.0015982873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007032577,0.0017431986,0.0026461254,0.0038564699,0.001655569,0.0031026716,0.004359854,0.0032590583,0.0067596114],"category_scores_gemma":[0.04394555,0.0014902147,0.0013756512,0.0023560163,0.0049623367,0.0059689116,0.003153086,0.0042151595,0.001135185],"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.0004450811,0.00028810836,0.0033996804,0.0003328338,0.00011243575,0.00066070945,0.0007870767,0.31689852,0.01158445,0.6446319,0.00595297,0.014906234],"study_design_scores_gemma":[0.000045872228,0.00006426236,0.0007933936,0.00004223623,0.00004567239,0.0001419864,0.00009324758,0.9131732,0.0005494516,0.08457768,0.0004140491,0.00005884059],"about_ca_topic_score_codex":0.010278687,"about_ca_topic_score_gemma":0.0049314597,"teacher_disagreement_score":0.010278687,"about_ca_system_score_codex":0.004871156,"about_ca_system_score_gemma":0.0038817967,"threshold_uncertainty_score":0.037192225},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16236235,0.005369955,0.7914943,0.007402769,0.0011258915,0.000100989295,0.0004204201,0.0010751685,0.030648181],"genre_scores_gemma":[0.90677273,0.0019537716,0.07136369,0.0010551051,0.0010234341,0.00013403568,0.00026584967,0.00051443203,0.016917024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983171,0.00058048667,0.000044282893,0.00018271478,0.00044484017,0.00043052193],"domain_scores_gemma":[0.98841804,0.008386371,0.0006690611,0.0008129631,0.0012056625,0.0005080146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064202375,0.0010865419,0.0017749759,0.0018508654,0.0012966865,0.0030492204,0.0046650385,0.0025929937,0.0033393058],"category_scores_gemma":[0.029688595,0.00091111753,0.0011287712,0.0021029257,0.0027845865,0.004920862,0.002164223,0.0047706948,0.0007794957],"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.00021979395,0.00007236336,0.0011575585,0.00011326178,0.0000355203,0.00018087708,0.0004038712,0.40480927,0.001086528,0.5773978,0.006324255,0.008198857],"study_design_scores_gemma":[0.000013980879,0.00000790653,0.00015339645,0.000011860723,0.000009046279,0.000016675462,0.000025483727,0.94414663,0.00010114097,0.055097006,0.0004059827,0.000010879725],"about_ca_topic_score_codex":0.02808917,"about_ca_topic_score_gemma":0.012593976,"teacher_disagreement_score":0.02808917,"about_ca_system_score_codex":0.0058887596,"about_ca_system_score_gemma":0.0036909305,"threshold_uncertainty_score":0.05585134},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057516914,0.0004888185,0.9344476,0.00035941138,0.00017662888,0.00006417024,0.0002890222,0.00037456187,0.006282798],"genre_scores_gemma":[0.9611291,0.00041282998,0.026374873,0.00010566431,0.00009006121,0.00017225299,0.00021623979,0.00006321478,0.01143578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947435,0.00020207385,0.000027225624,0.00009684935,0.0001281886,0.00007128071],"domain_scores_gemma":[0.9983279,0.0011009966,0.00016711718,0.000060239916,0.0002493016,0.00009449309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013681197,0.0009167193,0.0011350266,0.0010948855,0.00079889357,0.0021381695,0.001603877,0.0016775117,0.0035274974],"category_scores_gemma":[0.0034534317,0.00073606125,0.00080902624,0.000912578,0.0012517078,0.0012647924,0.0012475835,0.001157494,0.00028175404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019128316,0.00001141175,0.0001558443,0.000008910503,0.000012432488,0.00001650405,0.000013023235,0.9808865,0.00021051236,0.017171444,0.00014145266,0.001352901],"study_design_scores_gemma":[0.0000015768584,0.0000023301013,0.000015922136,6.0189075e-7,0.000001470374,0.0000011736334,0.000001160166,0.9982077,0.000023807592,0.0016920336,0.000050917122,0.0000013228389],"about_ca_topic_score_codex":0.018599562,"about_ca_topic_score_gemma":0.016645055,"teacher_disagreement_score":0.018599562,"about_ca_system_score_codex":0.002248412,"about_ca_system_score_gemma":0.0011141887,"threshold_uncertainty_score":0.036982596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29141164,0.002076659,0.6810519,0.0030715244,0.00056726905,0.00014599426,0.0004905219,0.0004916248,0.02069281],"genre_scores_gemma":[0.96622837,0.00050168077,0.01905985,0.00027117203,0.00023016092,0.000049917067,0.00021472515,0.00010717388,0.013336937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993413,0.00011047697,0.0000151456325,0.000062598985,0.00028379558,0.00018675528],"domain_scores_gemma":[0.9980659,0.0010080938,0.00016810658,0.00008512721,0.00047250523,0.0002002938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002158495,0.00060695497,0.0007371342,0.0009953679,0.0006406051,0.0015368712,0.0012976626,0.00058937084,0.004750553],"category_scores_gemma":[0.004384043,0.00037099796,0.00057181553,0.00061368156,0.001050549,0.0013132998,0.00071632076,0.0011688521,0.0003753919],"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.00060052343,0.00024052167,0.0031140489,0.0002133159,0.00007870144,0.0002518357,0.00017943882,0.6217965,0.012214382,0.3335234,0.008548865,0.019238468],"study_design_scores_gemma":[0.000011971716,0.000017425955,0.00037051472,0.000003759699,0.0000063283187,0.000012773782,0.000014959851,0.984786,0.0002546083,0.014223648,0.00029231908,0.0000057298557],"about_ca_topic_score_codex":0.017092774,"about_ca_topic_score_gemma":0.008275886,"teacher_disagreement_score":0.017092774,"about_ca_system_score_codex":0.003009326,"about_ca_system_score_gemma":0.0032057394,"threshold_uncertainty_score":0.03398657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8304355,0.00033901073,0.16519043,0.0007175334,0.000075071825,0.00013798948,0.0004059763,0.00027292388,0.0024255703],"genre_scores_gemma":[0.98770034,0.00015810475,0.007874216,0.00007700892,0.000056941055,0.000103989165,0.0002523576,0.00006599347,0.0037109593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984034,0.0005263398,0.000113400274,0.00040556712,0.0002548532,0.0002965023],"domain_scores_gemma":[0.927119,0.06007444,0.005290807,0.0030397477,0.0023777343,0.0020983452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007787398,0.0006480807,0.0015276719,0.0017152015,0.0006960174,0.0024123199,0.002379339,0.002288697,0.004887998],"category_scores_gemma":[0.042185023,0.0010426289,0.000996931,0.0013193237,0.003149341,0.004239407,0.0015120922,0.002069824,0.0005203893],"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.0022262072,0.00036551667,0.025945935,0.00030037234,0.0002747062,0.0013180492,0.0014601793,0.4427382,0.009049136,0.4952724,0.0021814096,0.018867841],"study_design_scores_gemma":[0.00007886055,0.000130294,0.00525905,0.00003142554,0.00005912051,0.00024541208,0.000096891956,0.9072624,0.0008842274,0.08561622,0.00025529214,0.00008078527],"about_ca_topic_score_codex":0.0019717568,"about_ca_topic_score_gemma":0.001870683,"teacher_disagreement_score":0.007787398,"about_ca_system_score_codex":0.0016520608,"about_ca_system_score_gemma":0.0011869085,"threshold_uncertainty_score":0.041184127},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036540054,0.0014840639,0.009632168,0.071365975,0.051962323,0.0018951604,0.11170334,0.0024475441,0.7129693],"genre_scores_gemma":[0.14336342,0.0021192108,0.0019176821,0.0014077568,0.016563542,0.00027703354,0.022154478,0.0005334556,0.8116633],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981528,0.00015507326,0.00012343419,0.00015644668,0.0011425333,0.00026974984],"domain_scores_gemma":[0.9875802,0.005703641,0.0008296798,0.00091111026,0.004272936,0.00070243445],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017931449,0.00086793344,0.0018157207,0.0045127054,0.0016389912,0.0031948665,0.0022462425,0.0025506103,0.53984153],"category_scores_gemma":[0.017107746,0.0005149085,0.0011321526,0.008623033,0.00042829802,0.0021070142,0.0010544157,0.0010600217,0.10347568],"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.00037422942,0.00026475493,0.00075878337,0.00023293144,0.000038097718,0.0004406314,0.000110899186,0.0029707458,0.00059581164,0.027076581,0.92664707,0.040489532],"study_design_scores_gemma":[0.0010064946,0.00036627965,0.024407865,0.0002499583,0.00017562779,0.00061009795,0.00063349254,0.029569427,0.0067556393,0.04633943,0.88965493,0.0002307558],"about_ca_topic_score_codex":0.014675061,"about_ca_topic_score_gemma":0.01650909,"teacher_disagreement_score":0.53984153,"about_ca_system_score_codex":0.0045461417,"about_ca_system_score_gemma":0.0032086144,"threshold_uncertainty_score":0.65636015},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76734525,0.00021790712,0.22143601,0.0005896659,0.0000678923,0.00006583555,0.00020113964,0.00038558478,0.009690776],"genre_scores_gemma":[0.9847532,0.00006627909,0.013922213,0.000027172053,0.00000904001,0.000037022106,0.000055911896,0.000017076722,0.0011122245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993562,0.00033025662,0.000026712329,0.00006210707,0.00009419056,0.00013053264],"domain_scores_gemma":[0.99358773,0.005344203,0.00031389756,0.00028452332,0.00023138158,0.0002383447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016695227,0.0003963148,0.0006051343,0.000534446,0.0005237922,0.0009393454,0.0009289945,0.0011126788,0.002161278],"category_scores_gemma":[0.007907344,0.0004473453,0.0005627255,0.00047570077,0.00091390987,0.0013129959,0.0007927782,0.0009872604,0.00016113106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003750017,0.000029266894,0.00076231465,0.0000090438525,0.000008452983,0.000038563798,0.000030860043,0.9844993,0.00022369977,0.013033704,0.00009053781,0.0012369235],"study_design_scores_gemma":[0.000010027464,0.000008231339,0.000080364174,0.0000014167563,0.0000022305014,0.00000406426,0.0000065909076,0.9954715,0.0001443489,0.0041898577,0.000078270874,0.0000030616707],"about_ca_topic_score_codex":0.014131207,"about_ca_topic_score_gemma":0.009233793,"teacher_disagreement_score":0.014131207,"about_ca_system_score_codex":0.0013972936,"about_ca_system_score_gemma":0.0012476186,"threshold_uncertainty_score":0.028097928},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11275763,0.00033305466,0.87540895,0.0015565056,0.000044705874,0.00010754585,0.00020910114,0.00019046558,0.009392092],"genre_scores_gemma":[0.754736,0.00035750837,0.23691757,0.0002594772,0.00010080602,0.00034467882,0.00047122384,0.000090559835,0.006722184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904686,0.0002765389,0.00004438937,0.0001820497,0.00026159987,0.00018851661],"domain_scores_gemma":[0.9956507,0.002912092,0.0004740398,0.00023644161,0.00044622298,0.00028038668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015021511,0.0004900362,0.0007754904,0.0010680009,0.001161426,0.0019806216,0.0017843813,0.0011879174,0.004534814],"category_scores_gemma":[0.006425353,0.0004537206,0.00080627686,0.0010016122,0.001794318,0.0020723962,0.002113329,0.0018303538,0.00045564133],"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.00010938049,0.000086165914,0.0018908584,0.00015633495,0.0000399663,0.00021716603,0.00027298988,0.44290826,0.0021419981,0.5301244,0.0022363097,0.019816257],"study_design_scores_gemma":[0.000014228428,0.000014872521,0.00021691139,0.0000071739205,0.00000527626,0.000037753227,0.000034326815,0.89509255,0.0002709066,0.10379833,0.0004976291,0.000010035209],"about_ca_topic_score_codex":0.003845838,"about_ca_topic_score_gemma":0.0032604404,"teacher_disagreement_score":0.004534814,"about_ca_system_score_codex":0.0024059056,"about_ca_system_score_gemma":0.0023560803,"threshold_uncertainty_score":0.017456174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2202079,0.0003668284,0.73888874,0.0017909094,0.0002635811,0.00038512822,0.0022200826,0.0026848556,0.033192005],"genre_scores_gemma":[0.8568101,0.0003116298,0.13705894,0.0003624643,0.00003855034,0.00033500596,0.0009182705,0.00019102731,0.003974034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992582,0.00034107678,0.0000452564,0.00007983466,0.00017765941,0.00009800315],"domain_scores_gemma":[0.9972646,0.0018796508,0.00020080041,0.00027963077,0.0002313845,0.0001440068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016045239,0.0005677181,0.0005427959,0.0004709703,0.00047667077,0.0009818508,0.0014894578,0.0009473626,0.003746433],"category_scores_gemma":[0.0047382037,0.00024868254,0.00058187003,0.0004396807,0.0009176422,0.0010294601,0.0015083402,0.001411078,0.00031149303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005258103,0.000039911192,0.0008826387,0.00002970174,0.000013221713,0.00006609217,0.000037672842,0.9746967,0.00044571905,0.019896386,0.00084173545,0.0029976761],"study_design_scores_gemma":[0.000008839999,0.000010953661,0.000054123837,0.000004122327,0.0000018628211,0.000010179892,0.000007011018,0.99467283,0.00032719105,0.004084128,0.0008151272,0.000003556808],"about_ca_topic_score_codex":0.0051884726,"about_ca_topic_score_gemma":0.004408755,"teacher_disagreement_score":0.0051884726,"about_ca_system_score_codex":0.00075879076,"about_ca_system_score_gemma":0.0009799658,"threshold_uncertainty_score":0.012533009},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007909454,0.06589928,0.80403924,0.03419983,0.004903901,0.00011888889,0.00045263206,0.0002998811,0.08217701],"genre_scores_gemma":[0.6296315,0.114065886,0.1928237,0.008469975,0.02047839,0.0008151716,0.0004895003,0.00025975925,0.03296612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817395,0.0006855574,0.00007776291,0.00031728306,0.0005940526,0.00015139465],"domain_scores_gemma":[0.9966538,0.0020236606,0.00015633917,0.00030344303,0.00066477165,0.00019797435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027998884,0.0012911636,0.0010858,0.0017968169,0.0015046627,0.0046729604,0.0019629716,0.0027491054,0.0034505446],"category_scores_gemma":[0.007255197,0.00068970356,0.00094379,0.0015760507,0.005594844,0.008949781,0.0023553988,0.0057479627,0.0010294562],"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.0000038655594,0.000011398542,0.00006056009,0.000059268066,0.0000072887165,0.000020177777,0.00007632331,0.005057385,0.00008101672,0.9857832,0.0037550298,0.0050844764],"study_design_scores_gemma":[0.0000035244452,0.0000073625056,0.000035700243,0.00004678735,0.0000047140525,0.000024352557,0.000023656108,0.01173706,0.000040339874,0.97477347,0.013296914,0.00000611114],"about_ca_topic_score_codex":0.003741229,"about_ca_topic_score_gemma":0.0013644625,"teacher_disagreement_score":0.0046729604,"about_ca_system_score_codex":0.004606331,"about_ca_system_score_gemma":0.00300109,"threshold_uncertainty_score":0.033421457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99563736,0.00004253792,0.0034430227,0.000029910618,0.000012866299,0.0000173061,0.00002511114,0.00014842804,0.00064349844],"genre_scores_gemma":[0.99948525,0.000007768286,0.0002947143,0.0000028944676,0.0000016545979,0.0000027537803,0.0000132024725,0.0000029019966,0.0001888747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935466,0.00016810547,0.00003877744,0.0001046907,0.00012706318,0.00020671214],"domain_scores_gemma":[0.99709237,0.001618347,0.0002221488,0.0001318037,0.00064829295,0.00028708982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008971299,0.00077604485,0.0009343192,0.0005717384,0.0010130903,0.00087372435,0.000674223,0.00076832366,0.0022240067],"category_scores_gemma":[0.002326381,0.0002727612,0.00038656406,0.00045751868,0.00062826916,0.0006556801,0.0004440031,0.00042055978,0.00022677422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01174253,0.0011417567,0.014289807,0.000365459,0.00016054232,0.0007670251,0.00040120003,0.8489503,0.08292808,0.0009137634,0.00058792834,0.03775151],"study_design_scores_gemma":[0.00010056104,0.0027164365,0.006464378,0.0000043910145,0.000064879605,0.000051892002,0.00013096708,0.97319806,0.01704109,0.000114491086,0.000081241786,0.000031528318],"about_ca_topic_score_codex":0.011962394,"about_ca_topic_score_gemma":0.0046734065,"teacher_disagreement_score":0.011962394,"about_ca_system_score_codex":0.0009533783,"about_ca_system_score_gemma":0.000832783,"threshold_uncertainty_score":0.023785532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03844661,0.00026520886,0.95442975,0.0007674976,0.00010468192,0.000040453113,0.000059734644,0.0001414064,0.0057446333],"genre_scores_gemma":[0.8050078,0.0005759858,0.16752584,0.0002896824,0.00018764313,0.00019003291,0.00014193499,0.00009689931,0.025984216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948174,0.00022480637,0.000022394199,0.00007717931,0.00011921354,0.000074606054],"domain_scores_gemma":[0.99838865,0.0011467831,0.00009271535,0.00006430834,0.0002361981,0.00007135419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014538503,0.0003618399,0.00088564586,0.00043198306,0.00082647573,0.0012669156,0.0012538227,0.0022292994,0.004958442],"category_scores_gemma":[0.0058468557,0.00037258226,0.00051989866,0.00059049565,0.0010433756,0.0010953732,0.0013351612,0.001042383,0.00039869227],"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.000040966937,0.000038835282,0.00033721552,0.00006944383,0.000017333809,0.00011909291,0.00023081942,0.38830486,0.0022844207,0.59464496,0.0018029382,0.012109081],"study_design_scores_gemma":[0.0000125427705,0.000009450695,0.000053540913,0.0000041131434,0.0000041304397,0.000013191024,0.000019442414,0.9507844,0.00016967625,0.04829853,0.0006251129,0.0000059810795],"about_ca_topic_score_codex":0.008290846,"about_ca_topic_score_gemma":0.005000631,"teacher_disagreement_score":0.008290846,"about_ca_system_score_codex":0.0014376704,"about_ca_system_score_gemma":0.0020436486,"threshold_uncertainty_score":0.016587675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051130332,0.0029060924,0.9392316,0.00080623,0.00015031421,0.000021647567,0.000020552325,0.00010806837,0.005625034],"genre_scores_gemma":[0.9316655,0.0030987982,0.061730333,0.0003430968,0.0007562963,0.000065019325,0.00004732711,0.00007863963,0.002214887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853396,0.0008093536,0.00006195273,0.00017800246,0.00031692022,0.00009988977],"domain_scores_gemma":[0.9831064,0.013025098,0.0013645297,0.0009842352,0.0009502815,0.0005694388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063253157,0.0009095737,0.0010984752,0.0016250653,0.00078629545,0.0015087898,0.0012584116,0.001241772,0.0009162369],"category_scores_gemma":[0.01926328,0.00040851522,0.001103436,0.0013115711,0.0040282784,0.0037997444,0.002002362,0.0022693996,0.00021111219],"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.000049270206,0.000049627757,0.0014686337,0.00010963155,0.000052986652,0.00035624293,0.00021768929,0.049755123,0.0028530913,0.9337164,0.00048068637,0.010890529],"study_design_scores_gemma":[0.000017278746,0.000102885315,0.0008427295,0.000047506204,0.00002792173,0.00033168978,0.00005099613,0.5568661,0.0012728035,0.43883693,0.0015692379,0.000033885517],"about_ca_topic_score_codex":0.00052690704,"about_ca_topic_score_gemma":0.0003410124,"teacher_disagreement_score":0.0063253157,"about_ca_system_score_codex":0.0009027919,"about_ca_system_score_gemma":0.0007002191,"threshold_uncertainty_score":0.033451915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013086348,0.00034030818,0.98370785,0.00013372466,0.000032056625,0.000013608977,0.000030448333,0.00012848932,0.0025270882],"genre_scores_gemma":[0.8453159,0.0014232635,0.1453178,0.00023460959,0.00013893863,0.00012372187,0.00016158918,0.00011261566,0.007171598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825376,0.0004745943,0.00008099051,0.00022087825,0.0007353721,0.0002343013],"domain_scores_gemma":[0.99369335,0.004396187,0.0005027726,0.00045315732,0.0007764931,0.00017808811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034435142,0.00097272097,0.00097266433,0.001275554,0.0006961749,0.0014907399,0.0017875369,0.0012091047,0.0016699313],"category_scores_gemma":[0.016059138,0.00044723187,0.0011442722,0.00096988777,0.0016041755,0.0031313465,0.0016910472,0.0025477551,0.00039484314],"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.000058846574,0.00003427378,0.00072532584,0.000077356126,0.000032955173,0.00010409285,0.00013684314,0.7395552,0.0013899957,0.23721896,0.00063983595,0.020026244],"study_design_scores_gemma":[0.00000194741,0.000008657809,0.00006413119,0.000007023501,0.000004264135,0.0000136639965,0.000008761954,0.9506946,0.00021997774,0.048682474,0.00028998786,0.000004423086],"about_ca_topic_score_codex":0.0044932384,"about_ca_topic_score_gemma":0.003199372,"teacher_disagreement_score":0.0044932384,"about_ca_system_score_codex":0.0026029428,"about_ca_system_score_gemma":0.0011399215,"threshold_uncertainty_score":0.018885791},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38253403,0.0003249119,0.6084021,0.00041537016,0.000026441501,0.00011761718,0.00023617204,0.0003793235,0.0075640916],"genre_scores_gemma":[0.990361,0.000091374066,0.00879685,0.000014127096,0.000007153148,0.000037858958,0.00007053383,0.000022360977,0.0005986726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967771,0.0015745198,0.0001104873,0.00035558618,0.0009180406,0.00026420841],"domain_scores_gemma":[0.996049,0.0023640213,0.00071673194,0.00035394993,0.0003868245,0.00012949512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002189172,0.00064794207,0.0007623709,0.0007414469,0.0003225238,0.0009839016,0.00056818017,0.0007301422,0.000873629],"category_scores_gemma":[0.011741933,0.0003869549,0.00047229155,0.0015323864,0.0005675431,0.0013406313,0.0011035159,0.000668001,0.00015162621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049943486,0.00002719073,0.002072949,0.000036096488,0.000029408126,0.000043782267,0.000046047717,0.9833535,0.002572719,0.0046514887,0.000114912145,0.007002047],"study_design_scores_gemma":[0.0000029477892,0.000052129864,0.0015366927,0.000005933157,0.000008421449,0.00001564148,0.00005087985,0.99360996,0.0014927753,0.002986492,0.00022673029,0.000011347135],"about_ca_topic_score_codex":0.004055224,"about_ca_topic_score_gemma":0.00180556,"teacher_disagreement_score":0.004055224,"about_ca_system_score_codex":0.0017824662,"about_ca_system_score_gemma":0.0010501347,"threshold_uncertainty_score":0.012932718},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31573787,0.0012077545,0.67201066,0.0009706589,0.00022222406,0.00010704158,0.00017357522,0.00044051083,0.009129725],"genre_scores_gemma":[0.99084306,0.00018289244,0.006825988,0.000046865516,0.000062613726,0.000018445973,0.000042378288,0.000028949464,0.0019489466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904686,0.00020663114,0.000022511298,0.00012039212,0.00036870094,0.00023486008],"domain_scores_gemma":[0.99790925,0.0010752876,0.00019932396,0.00008741793,0.0005848086,0.00014388074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017386624,0.0005635786,0.00078248524,0.0008191254,0.0005921284,0.0015922126,0.0012704954,0.00051056565,0.0019503225],"category_scores_gemma":[0.0058201696,0.00023066986,0.00044103464,0.00066780276,0.0008101437,0.001198601,0.0006073062,0.0007007218,0.000119486416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024944305,0.00009904631,0.002866637,0.00014063739,0.00005130865,0.00022899832,0.00014674802,0.88237244,0.009082593,0.089247294,0.001676372,0.013838535],"study_design_scores_gemma":[0.0000014666068,0.000006357346,0.00015456103,9.5230274e-7,0.000002939415,0.0000057747116,0.0000061978194,0.99828583,0.00016664558,0.0013300476,0.00003746246,0.0000018079805],"about_ca_topic_score_codex":0.013593866,"about_ca_topic_score_gemma":0.0041646166,"teacher_disagreement_score":0.013593866,"about_ca_system_score_codex":0.0023261616,"about_ca_system_score_gemma":0.0020006704,"threshold_uncertainty_score":0.027029455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023975117,0.00016120651,0.97373223,0.00011643448,0.000024825868,0.000029828765,0.000040841293,0.00015300821,0.0017664771],"genre_scores_gemma":[0.8977467,0.0006863835,0.096450925,0.00009039846,0.00016545346,0.00016125415,0.00015159408,0.00013258801,0.0044146823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875414,0.00042082326,0.000042337517,0.000129023,0.0004468274,0.000206817],"domain_scores_gemma":[0.99404645,0.0041882573,0.0004451379,0.00035964,0.0006488577,0.00031165086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003246326,0.0010228066,0.0012370009,0.0018855992,0.0009149554,0.0018571713,0.0019178771,0.0010793585,0.0022001015],"category_scores_gemma":[0.010176534,0.0004064495,0.0016294213,0.0009516217,0.0016989083,0.0029957627,0.0018498243,0.0022381768,0.00028745283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062393396,0.00007439101,0.0009567599,0.00005547606,0.00005168329,0.00016804371,0.00017952966,0.6942615,0.0025359762,0.29375917,0.0005416174,0.007353524],"study_design_scores_gemma":[0.0000016029891,0.000008993793,0.00004422638,0.0000022307613,0.0000042606853,0.000009016939,0.000005759772,0.9638068,0.00018966834,0.035782006,0.00014092374,0.000004535056],"about_ca_topic_score_codex":0.004040955,"about_ca_topic_score_gemma":0.0016672577,"teacher_disagreement_score":0.004040955,"about_ca_system_score_codex":0.0020128866,"about_ca_system_score_gemma":0.0018925257,"threshold_uncertainty_score":0.017168403},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.273968,0.0014239557,0.71236134,0.0016954289,0.00020389092,0.00012384869,0.00028496512,0.0003350449,0.009603477],"genre_scores_gemma":[0.98332226,0.000355523,0.012050442,0.000093121256,0.0001874822,0.00005481317,0.0001022891,0.00007015981,0.0037640147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983272,0.0004932396,0.00007220083,0.00023538554,0.00039954603,0.00047245814],"domain_scores_gemma":[0.99092966,0.006432215,0.000654871,0.0003278159,0.00096735585,0.0006880704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040020226,0.0011418805,0.0015941989,0.0013803822,0.0013266349,0.0026274608,0.0025267883,0.001238775,0.003665237],"category_scores_gemma":[0.012556112,0.0008727147,0.0010877588,0.0011677386,0.002120637,0.0029667304,0.0014675446,0.0015854373,0.0003023363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019898033,0.000112229565,0.0018754556,0.00011266258,0.000093175826,0.00031762762,0.00028988902,0.71489066,0.0042151525,0.26939535,0.0019694131,0.0065292995],"study_design_scores_gemma":[0.000008326078,0.000015469064,0.00025205902,0.0000034304028,0.000013653889,0.000023764163,0.000025314126,0.98103756,0.00017456454,0.018274548,0.00016347294,0.000007768371],"about_ca_topic_score_codex":0.009725398,"about_ca_topic_score_gemma":0.0045519783,"teacher_disagreement_score":0.009725398,"about_ca_system_score_codex":0.0038413794,"about_ca_system_score_gemma":0.0030980147,"threshold_uncertainty_score":0.02787131},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9943041,0.00029859444,0.0023456367,0.00023597392,0.00003111387,0.000007123662,0.0004247697,0.000029595207,0.0023230973],"genre_scores_gemma":[0.99863833,0.00008715794,0.00020262392,0.000012548462,0.000007922598,0.0000030703243,0.00010248289,0.00000997937,0.00093585864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892235,0.00022646888,0.000060756065,0.0001369807,0.00013605242,0.0005173602],"domain_scores_gemma":[0.9635372,0.030499358,0.0029042976,0.00062074116,0.0013580187,0.0010803912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033077786,0.0005122645,0.0005288011,0.0008379526,0.00051726605,0.002387183,0.0010259941,0.0009615197,0.009204015],"category_scores_gemma":[0.017206237,0.00063030294,0.0008837256,0.0012548513,0.00090506097,0.0027035794,0.00070718967,0.0010983543,0.0004910607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005878284,0.00070806,0.12527084,0.00017483254,0.00041771893,0.0012087295,0.0003130924,0.8166247,0.011144161,0.012253143,0.0017761827,0.024230223],"study_design_scores_gemma":[0.00019303798,0.0015047891,0.25215214,0.00005075802,0.0011400278,0.00055255933,0.002309339,0.7076957,0.0110601345,0.021842968,0.0012939314,0.00020457394],"about_ca_topic_score_codex":0.020603152,"about_ca_topic_score_gemma":0.014869892,"teacher_disagreement_score":0.020603152,"about_ca_system_score_codex":0.0021827747,"about_ca_system_score_gemma":0.001786716,"threshold_uncertainty_score":0.04096645},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2293955,0.00055950705,0.7651514,0.0005102422,0.00005633457,0.000048150374,0.00006747292,0.00019639234,0.0040149908],"genre_scores_gemma":[0.9797314,0.00024360833,0.01761958,0.000055050474,0.00003413998,0.000039107053,0.000038296635,0.000042863867,0.0021960095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956304,0.00015316656,0.000015603913,0.00005880662,0.00011946111,0.00008989706],"domain_scores_gemma":[0.99835795,0.00093164353,0.00025784288,0.000103649756,0.00025483893,0.00009397845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014024369,0.00055047806,0.00068122306,0.00069458614,0.00038844696,0.0009182373,0.0011055624,0.0006460201,0.0011295005],"category_scores_gemma":[0.004055324,0.00037083635,0.00084993785,0.0005321631,0.0010218059,0.0012323017,0.0011483955,0.0008820578,0.00009281087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026325022,0.000015772157,0.0007979901,0.000027085243,0.000031317148,0.00008380896,0.000066991815,0.9558187,0.0024169597,0.03759919,0.00028253926,0.0028333704],"study_design_scores_gemma":[0.0000012357552,0.0000035333894,0.000106418294,8.9435935e-7,0.0000019235786,0.000004273734,0.0000058639675,0.9968733,0.000057883015,0.0029004149,0.000042056447,0.0000022789377],"about_ca_topic_score_codex":0.0079282215,"about_ca_topic_score_gemma":0.0031598583,"teacher_disagreement_score":0.0079282215,"about_ca_system_score_codex":0.0014570757,"about_ca_system_score_gemma":0.00096484035,"threshold_uncertainty_score":0.015764177},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8867215,0.0005569268,0.108936764,0.0002828684,0.0000706728,0.00006171344,0.000112276946,0.000222533,0.0030346916],"genre_scores_gemma":[0.99470454,0.000065243505,0.0046088737,0.000010036955,0.000011927593,0.000009349031,0.00001860206,0.00001200895,0.0005593571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910563,0.0002416156,0.000039214512,0.00015785493,0.00013405539,0.00032156555],"domain_scores_gemma":[0.998431,0.00076073286,0.00030416332,0.000110303095,0.0001411284,0.00025248292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016054652,0.00091809424,0.0011442585,0.000822335,0.0012907604,0.0014971416,0.0015806931,0.0011624625,0.002385577],"category_scores_gemma":[0.0022443368,0.00061938365,0.001018107,0.0008605111,0.0011077446,0.0013266363,0.0011614265,0.0007355683,0.00018036804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021624318,0.000060654213,0.0013284794,0.000048284848,0.00002366724,0.00029407753,0.000050891056,0.9884213,0.0020156146,0.0021272614,0.00022975715,0.005183851],"study_design_scores_gemma":[0.000015849348,0.00012190043,0.00056081096,0.000004165229,0.000018152072,0.00009734537,0.000060095208,0.99716526,0.0006324844,0.0011730583,0.00014082868,0.0000099838735],"about_ca_topic_score_codex":0.011449891,"about_ca_topic_score_gemma":0.008961593,"teacher_disagreement_score":0.011449891,"about_ca_system_score_codex":0.0026834398,"about_ca_system_score_gemma":0.0011768528,"threshold_uncertainty_score":0.02276653},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015279347,0.0011859625,0.9745388,0.00045504599,0.00015456078,0.000038742703,0.000114114744,0.0001451319,0.0080883065],"genre_scores_gemma":[0.7519343,0.004590756,0.2263859,0.00023327212,0.00074739504,0.00034337278,0.00033387804,0.00022099243,0.015210187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995571,0.0002170248,0.000021098864,0.000054569526,0.0001121438,0.00003809974],"domain_scores_gemma":[0.9985519,0.00096455705,0.00014422598,0.00010667996,0.00017926631,0.000053346368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006719922,0.0007393813,0.0004114641,0.0013572818,0.00047166465,0.0009768612,0.00047389587,0.0005084884,0.00265057],"category_scores_gemma":[0.0050563794,0.00022470628,0.0006042986,0.0012390091,0.0012585046,0.0015144402,0.0012710824,0.0014430399,0.0004156794],"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.000018248455,0.000018885627,0.00058715895,0.0000695905,0.000020159534,0.00012664654,0.00015609943,0.22251649,0.001313887,0.757646,0.0011713617,0.016355533],"study_design_scores_gemma":[0.000004373143,0.000012408433,0.0001833163,0.000013245289,0.00000399836,0.0000289879,0.00002579095,0.7395963,0.00020382361,0.25701728,0.0028989478,0.000011402516],"about_ca_topic_score_codex":0.0032406375,"about_ca_topic_score_gemma":0.0015221215,"teacher_disagreement_score":0.0032406375,"about_ca_system_score_codex":0.0010039451,"about_ca_system_score_gemma":0.000614049,"threshold_uncertainty_score":0.008867025},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9031424,0.00021585071,0.09166926,0.0004196676,0.000037992006,0.0000688497,0.000106381456,0.00034285118,0.0039966316],"genre_scores_gemma":[0.9960951,0.00007031608,0.0034137212,0.000017909277,0.000010494568,0.000015445683,0.000024619645,0.000011477469,0.00034087192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932194,0.00019987434,0.000027812477,0.0000964256,0.00014505087,0.00020892287],"domain_scores_gemma":[0.9962005,0.002523357,0.00048312414,0.00016084015,0.00039138854,0.00024079476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011415395,0.0005753532,0.00057560636,0.00057970977,0.00079843425,0.0011031291,0.0009474814,0.0010063305,0.0007043194],"category_scores_gemma":[0.006376546,0.0002505613,0.00022037614,0.00088386115,0.00060888554,0.0013541353,0.00050518033,0.00063127535,0.0001301637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017146167,0.00012726572,0.0034218028,0.000040046172,0.00001638529,0.00036010976,0.000055087068,0.96846944,0.01188589,0.0050414465,0.00048847,0.009922602],"study_design_scores_gemma":[0.0000028951974,0.000020835227,0.0004127656,9.713283e-7,0.0000027259327,0.000019271547,0.000020929603,0.9980483,0.00083331804,0.00058653875,0.000048682934,0.0000027659778],"about_ca_topic_score_codex":0.008187062,"about_ca_topic_score_gemma":0.005689108,"teacher_disagreement_score":0.008187062,"about_ca_system_score_codex":0.0017623126,"about_ca_system_score_gemma":0.0010707413,"threshold_uncertainty_score":0.016278803},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30059847,0.0009867895,0.6703549,0.0027047675,0.00037371294,0.00025824868,0.0010115913,0.00085259666,0.022858907],"genre_scores_gemma":[0.976061,0.00032418346,0.011312526,0.00018204827,0.0000978469,0.00016668114,0.0001881977,0.000039488958,0.01162801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998618,0.0003566083,0.00006858015,0.0002834101,0.0002646388,0.0004087544],"domain_scores_gemma":[0.99681646,0.0015516108,0.0005123129,0.00030779917,0.0003828771,0.0004289656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014073611,0.001055576,0.0017708475,0.00077773316,0.0009413662,0.0030172665,0.0038593214,0.002921617,0.0057019535],"category_scores_gemma":[0.0039141392,0.00093078375,0.0011889935,0.0013357259,0.0021239836,0.002677795,0.0013022281,0.0024378607,0.0009910134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028696898,0.00015553029,0.0012089906,0.000085829255,0.000056853383,0.00055936043,0.00020879865,0.90542847,0.0026210996,0.08509168,0.0011683287,0.003128201],"study_design_scores_gemma":[0.00004148201,0.00003580528,0.0001849921,0.0000053895533,0.000020759991,0.00003662405,0.000023082488,0.99070346,0.00016763947,0.008460433,0.0003007395,0.000019491961],"about_ca_topic_score_codex":0.017200794,"about_ca_topic_score_gemma":0.007985954,"teacher_disagreement_score":0.017200794,"about_ca_system_score_codex":0.00250581,"about_ca_system_score_gemma":0.002152829,"threshold_uncertainty_score":0.034201384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2011548,0.0016025924,0.7743076,0.001517255,0.00022189328,0.000060725684,0.00017356512,0.00037624527,0.020585438],"genre_scores_gemma":[0.9561161,0.0010118035,0.029383156,0.00029625825,0.00018545735,0.00009696437,0.00015624343,0.00011432061,0.012639666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995252,0.00020368969,0.000014549737,0.000048408878,0.00012402094,0.000084167],"domain_scores_gemma":[0.99677867,0.0020620085,0.0003023616,0.00019564296,0.00043644727,0.00022485854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022858167,0.0008390736,0.0008268889,0.0010483769,0.00066184346,0.0016837168,0.0018331662,0.0018122533,0.002924776],"category_scores_gemma":[0.011206675,0.0005534495,0.000629311,0.0006921188,0.0024149937,0.0027305253,0.0017983853,0.0020677615,0.00035511277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006383674,0.00003876087,0.00090439094,0.0000547531,0.000021921438,0.00015683146,0.00018138991,0.59861374,0.0009380405,0.39548692,0.001101813,0.0024376803],"study_design_scores_gemma":[0.0000048668444,0.0000058208184,0.00007594838,0.0000053310764,0.000003008332,0.00001067624,0.000016183163,0.96165204,0.00006727095,0.037975878,0.00017915257,0.000003851923],"about_ca_topic_score_codex":0.006823923,"about_ca_topic_score_gemma":0.004858964,"teacher_disagreement_score":0.006823923,"about_ca_system_score_codex":0.0016733969,"about_ca_system_score_gemma":0.0010465806,"threshold_uncertainty_score":0.013568401},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11574772,0.028183265,0.68125904,0.03666919,0.015022055,0.00022465308,0.0015923312,0.002139049,0.11916271],"genre_scores_gemma":[0.9120862,0.0071569127,0.042587973,0.00478299,0.008536405,0.00016735928,0.00045331081,0.00085833325,0.02337041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983387,0.0005076121,0.00007797449,0.00029489098,0.0005703726,0.00021039884],"domain_scores_gemma":[0.97839946,0.017853737,0.0006914826,0.0006783559,0.0015986636,0.0007782156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00471023,0.0017278148,0.0018214649,0.0029433249,0.0016605526,0.002881903,0.0024245637,0.0021938798,0.008152816],"category_scores_gemma":[0.024760796,0.00058418064,0.0010828689,0.0024828564,0.0037165585,0.004132818,0.0021095,0.004304899,0.00082227116],"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.0010336387,0.00010480759,0.0011775313,0.00068241206,0.000102587706,0.0015679598,0.0006653217,0.12611452,0.015929237,0.8018363,0.027296241,0.023489408],"study_design_scores_gemma":[0.000059813974,0.00013146574,0.0017836296,0.00015501284,0.00009135969,0.000356486,0.0001446886,0.66142666,0.0023501504,0.32529408,0.008066998,0.0001396486],"about_ca_topic_score_codex":0.013854563,"about_ca_topic_score_gemma":0.0068960646,"teacher_disagreement_score":0.013854563,"about_ca_system_score_codex":0.0038351845,"about_ca_system_score_gemma":0.0019366734,"threshold_uncertainty_score":0.027826369},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043129437,0.0011549748,0.939974,0.00047026356,0.000109986126,0.00008657578,0.00011716932,0.0003893845,0.014568169],"genre_scores_gemma":[0.7638531,0.0024745886,0.22065862,0.00022687169,0.0002250306,0.00014937212,0.00025687637,0.00046352897,0.011692072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965835,0.000089247595,0.000016804395,0.000034977835,0.00014445755,0.000056247292],"domain_scores_gemma":[0.99789375,0.0014381998,0.00021256402,0.00009695965,0.00030841434,0.00005005837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010067007,0.0008772743,0.0006245769,0.0010907416,0.00048834726,0.0011774673,0.00070152193,0.000900635,0.0054518827],"category_scores_gemma":[0.007988173,0.0002891821,0.00059519656,0.0006789775,0.000948324,0.0027975289,0.00074807176,0.0019058228,0.0011986633],"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.00005896613,0.00011581034,0.0009949405,0.00041274395,0.000031316016,0.00029344604,0.00059458404,0.3036526,0.012277019,0.6315004,0.0037460213,0.046322107],"study_design_scores_gemma":[0.000009186317,0.000022282944,0.00031895307,0.000038093436,0.0000117943955,0.00017133297,0.000093460265,0.89555603,0.0019521825,0.09954173,0.0022578542,0.000027076385],"about_ca_topic_score_codex":0.0016279334,"about_ca_topic_score_gemma":0.0017439539,"teacher_disagreement_score":0.0054518827,"about_ca_system_score_codex":0.0013178437,"about_ca_system_score_gemma":0.0013973375,"threshold_uncertainty_score":0.018238366},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034745075,0.0011836283,0.9420017,0.002325923,0.0003625585,0.00015514073,0.00020894215,0.00024164181,0.018775424],"genre_scores_gemma":[0.8920286,0.0021785437,0.09057303,0.0007265944,0.001442338,0.0003021408,0.00021956382,0.00010177738,0.012427288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745923,0.0008110998,0.000103188926,0.00054499006,0.0005146817,0.0005669176],"domain_scores_gemma":[0.99625814,0.0020065065,0.00053352275,0.00039239603,0.0003996476,0.00040985682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002525731,0.0017079667,0.0013935103,0.0007294491,0.001862876,0.0031809108,0.0029895497,0.00240043,0.008908781],"category_scores_gemma":[0.006750199,0.0009938821,0.001296197,0.0018886259,0.0032822965,0.00586923,0.0036026393,0.0032203742,0.0014756698],"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.00015800186,0.0001793642,0.0013799606,0.00020853044,0.000072984425,0.0006509034,0.00025035208,0.4509733,0.0036499489,0.5264809,0.0056980657,0.010297692],"study_design_scores_gemma":[0.00005099028,0.000090536036,0.00029447052,0.00003747677,0.000039429786,0.00022019705,0.000111361114,0.77730596,0.0008102528,0.21429491,0.006704807,0.000039629438],"about_ca_topic_score_codex":0.0036136655,"about_ca_topic_score_gemma":0.0021090505,"teacher_disagreement_score":0.008908781,"about_ca_system_score_codex":0.0022609504,"about_ca_system_score_gemma":0.0027695205,"threshold_uncertainty_score":0.029802859},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18105936,0.0012834818,0.8070989,0.0005041217,0.00006373355,0.000067485424,0.00010313249,0.00034811712,0.00947159],"genre_scores_gemma":[0.977737,0.00041775592,0.019094596,0.000047780275,0.000056333352,0.000036581307,0.000058655787,0.00007283406,0.0024784831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986004,0.0004962425,0.00003694779,0.00012621829,0.0004242576,0.0003159138],"domain_scores_gemma":[0.9920035,0.00549194,0.0006075827,0.0005096014,0.0011390172,0.00024833845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037531718,0.0008017019,0.0012897097,0.0012695332,0.0008589236,0.0018260255,0.0020451127,0.0009341127,0.0023129464],"category_scores_gemma":[0.0136212725,0.0004710749,0.00045903062,0.002043353,0.0015415634,0.0021084715,0.0012923743,0.0011846658,0.00024607044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008645635,0.000027016991,0.00040410188,0.000030915813,0.000012708799,0.000025409612,0.000038441318,0.9743624,0.0006395434,0.018872326,0.00033471175,0.005166068],"study_design_scores_gemma":[9.810483e-7,0.0000055741757,0.00004269846,0.0000013722545,0.0000018023911,0.0000031440618,0.0000055800583,0.99806815,0.00006928635,0.0017633099,0.000036933798,0.0000011623914],"about_ca_topic_score_codex":0.012278624,"about_ca_topic_score_gemma":0.0053034388,"teacher_disagreement_score":0.012278624,"about_ca_system_score_codex":0.0038978318,"about_ca_system_score_gemma":0.0021150722,"threshold_uncertainty_score":0.028280854},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010733602,0.0017629719,0.0044162404,0.93466365,0.050515313,0.000046862,0.0006907391,0.0003226319,0.0065082293],"genre_scores_gemma":[0.0397908,0.0036750375,0.0067940652,0.75421375,0.1623158,0.00022852494,0.00039839567,0.00070667954,0.031876937],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9911698,0.0018847252,0.0011513141,0.0014477498,0.0035977454,0.0007486069],"domain_scores_gemma":[0.9345827,0.04030546,0.0031246343,0.0024621633,0.018163292,0.0013617062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008930109,0.0018243497,0.0020700023,0.0025692582,0.0041231127,0.003031166,0.006530402,0.022498071,0.029159943],"category_scores_gemma":[0.08991901,0.00097468065,0.002156639,0.00272445,0.005890189,0.008838984,0.0030738863,0.02022404,0.011241174],"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.00008255531,0.0000235334,0.000256904,0.00015501103,0.000020831032,0.00037186913,0.0003336032,0.00055473985,0.0003128661,0.024214325,0.9695488,0.004125066],"study_design_scores_gemma":[0.00014547202,0.00006777411,0.0041582338,0.0007151461,0.00010079801,0.0007829178,0.0008879251,0.011197547,0.0016189128,0.16276406,0.81705993,0.000501297],"about_ca_topic_score_codex":0.036123313,"about_ca_topic_score_gemma":0.0134264175,"teacher_disagreement_score":0.036123313,"about_ca_system_score_codex":0.0063552093,"about_ca_system_score_gemma":0.0032722482,"threshold_uncertainty_score":0.09754968},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3029046,0.0015041133,0.678625,0.0036519067,0.00035730953,0.0002359173,0.0005917093,0.0013663407,0.010763093],"genre_scores_gemma":[0.95847756,0.0007878263,0.02885818,0.000412099,0.00017811592,0.00017684429,0.00027023765,0.0002976339,0.010541593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836546,0.0003594048,0.00007353569,0.0002391699,0.0004700285,0.0004924846],"domain_scores_gemma":[0.9798922,0.011884464,0.0017494188,0.0010709562,0.0038066332,0.0015963732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007212178,0.0011078849,0.0015460212,0.0026594526,0.0017731882,0.0031978164,0.003449007,0.0021610106,0.004716802],"category_scores_gemma":[0.039060406,0.0008763123,0.0008625712,0.0015004785,0.0025952442,0.0042683943,0.0026035765,0.003243197,0.0008455269],"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.0012216046,0.00027111286,0.0059722587,0.00046005042,0.00009423023,0.00049652124,0.0015163781,0.20699938,0.02379135,0.7284647,0.008261473,0.022450855],"study_design_scores_gemma":[0.00006290722,0.00007572401,0.0006326553,0.00004006012,0.00004900252,0.00017444689,0.0001395808,0.9485366,0.0018123112,0.047821127,0.0005900123,0.00006554073],"about_ca_topic_score_codex":0.010034021,"about_ca_topic_score_gemma":0.0035200112,"teacher_disagreement_score":0.010034021,"about_ca_system_score_codex":0.004843545,"about_ca_system_score_gemma":0.004423684,"threshold_uncertainty_score":0.038142085},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28242356,0.0022273907,0.6800163,0.007817669,0.0011552868,0.0003925542,0.001775751,0.00225072,0.021940866],"genre_scores_gemma":[0.960445,0.00055836764,0.021899091,0.00055362575,0.00034689548,0.00013697123,0.00027202026,0.00014908267,0.015638929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949209,0.0013435107,0.00022389216,0.0010071023,0.0006476528,0.0018568689],"domain_scores_gemma":[0.9830949,0.009103319,0.0022398531,0.0016764217,0.002062568,0.0018229214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00849362,0.0017247054,0.003253388,0.002025425,0.0021149002,0.0062105646,0.007338028,0.004175626,0.008834176],"category_scores_gemma":[0.02633011,0.0015499805,0.0017720534,0.0031210645,0.0038427755,0.00493058,0.0036170925,0.005131944,0.0013814351],"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.0015245533,0.0003886293,0.0031158673,0.00035373322,0.00013521865,0.0009234853,0.00055115804,0.46992344,0.0050124465,0.49089488,0.010403044,0.01677359],"study_design_scores_gemma":[0.00013943996,0.00008899323,0.0003973417,0.000019216443,0.000057398047,0.00010325413,0.00006119315,0.94826734,0.00061382493,0.049429175,0.00077587273,0.000046983117],"about_ca_topic_score_codex":0.014826416,"about_ca_topic_score_gemma":0.011703533,"teacher_disagreement_score":0.014826416,"about_ca_system_score_codex":0.007738573,"about_ca_system_score_gemma":0.0050693573,"threshold_uncertainty_score":0.056147575},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017516261,0.00044498433,0.9796596,0.00025534662,0.00004039666,0.000030241708,0.000047268895,0.00014348763,0.0018624093],"genre_scores_gemma":[0.67560995,0.001162334,0.31435922,0.00008777293,0.00020176679,0.00013948134,0.00022883633,0.00031358816,0.0078971395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990409,0.0004632678,0.00004081134,0.00012773587,0.00018116947,0.0001461275],"domain_scores_gemma":[0.9966935,0.0020430626,0.00035896103,0.0003494076,0.0004339007,0.00012122788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026166704,0.0010885146,0.001551098,0.0010335959,0.0010216599,0.0027842394,0.0015194034,0.0012276571,0.0032662086],"category_scores_gemma":[0.007527063,0.0010258133,0.00078238983,0.002263552,0.001417512,0.003496678,0.0013073026,0.0017093623,0.00038636292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000889455,0.000042964537,0.00033295178,0.000041289364,0.000021470993,0.000036540667,0.000050570983,0.92282444,0.0007805229,0.040212926,0.0020851824,0.03348213],"study_design_scores_gemma":[0.0000036351948,0.000006630471,0.000053241652,0.000004101967,0.000006980922,0.000006613395,0.000010522056,0.9809662,0.00020410003,0.018422233,0.00031232706,0.0000033279398],"about_ca_topic_score_codex":0.006885629,"about_ca_topic_score_gemma":0.005852668,"teacher_disagreement_score":0.006885629,"about_ca_system_score_codex":0.0020280213,"about_ca_system_score_gemma":0.0012906631,"threshold_uncertainty_score":0.01471436},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029405155,0.00044632086,0.64243037,0.0031954262,0.0018266444,0.0003385171,0.034374915,0.07301949,0.24142788],"genre_scores_gemma":[0.11165328,0.002093394,0.26528868,0.0027928231,0.00077208097,0.0013039556,0.07919862,0.025519041,0.51137817],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894816,0.00019147553,0.00008455804,0.00021463615,0.00042677706,0.00013436214],"domain_scores_gemma":[0.9980501,0.00056130084,0.00009969178,0.00051242945,0.0006026093,0.00017390602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010158283,0.001413655,0.00085307093,0.0009034645,0.00088191073,0.004830384,0.0019463892,0.0013737528,0.25509766],"category_scores_gemma":[0.005336489,0.00064407685,0.0011533013,0.0014289211,0.00066665246,0.0028301226,0.0017342758,0.0024049927,0.1817556],"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.0006525373,0.00013574511,0.00079574,0.0006002043,0.000044071243,0.00027233726,0.00025042865,0.01932724,0.0069716773,0.11345069,0.7074703,0.1500292],"study_design_scores_gemma":[0.00016347719,0.000069372996,0.00049643795,0.000118429445,0.00002904359,0.00014870623,0.00016163442,0.09951815,0.011349932,0.041062623,0.84681153,0.00007064579],"about_ca_topic_score_codex":0.011144959,"about_ca_topic_score_gemma":0.010232208,"teacher_disagreement_score":0.25509766,"about_ca_system_score_codex":0.0018095269,"about_ca_system_score_gemma":0.0018003182,"threshold_uncertainty_score":0.8533867},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06395921,0.009857173,0.8826452,0.0065647303,0.0011167701,0.0001223018,0.00029001158,0.00044150732,0.035003148],"genre_scores_gemma":[0.9013379,0.004985663,0.08377276,0.0020119832,0.0019384949,0.00016959029,0.00016898519,0.00020481461,0.005409938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951924,0.001352618,0.00027629733,0.0007075323,0.0019735896,0.0004975034],"domain_scores_gemma":[0.9809183,0.015329551,0.0009965259,0.0011875422,0.0011536714,0.0004144196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057645217,0.0008520855,0.001275828,0.0012589961,0.0010663383,0.0023580987,0.0012992492,0.0021701625,0.0021683634],"category_scores_gemma":[0.024002606,0.00063837925,0.0010462531,0.0013027715,0.0049729883,0.0053553046,0.0024190685,0.0040898817,0.000291826],"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.00018887274,0.000055641452,0.0013290613,0.00011485816,0.00004876107,0.00011148755,0.00021575006,0.07235237,0.002240323,0.9015959,0.002212269,0.019534698],"study_design_scores_gemma":[0.00005242874,0.00010493084,0.0004772676,0.000049650414,0.000021766542,0.000036162015,0.000015579839,0.15990892,0.0009093101,0.83386886,0.004525497,0.000029527582],"about_ca_topic_score_codex":0.0043799654,"about_ca_topic_score_gemma":0.0014064186,"teacher_disagreement_score":0.0057645217,"about_ca_system_score_codex":0.0030738278,"about_ca_system_score_gemma":0.0018207445,"threshold_uncertainty_score":0.030486107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07384982,0.00079211604,0.91908556,0.00035536013,0.00013438646,0.000092828624,0.00009860958,0.00036037204,0.005230886],"genre_scores_gemma":[0.87691027,0.0005921348,0.1189644,0.00019033934,0.00014999896,0.0001521295,0.00014339547,0.00012854891,0.002768761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730563,0.00071988447,0.00013772189,0.00048135585,0.0008566819,0.00049873354],"domain_scores_gemma":[0.9953935,0.0023114758,0.0006069223,0.0006106482,0.00073039276,0.00034705005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021887617,0.0010179539,0.0016142988,0.000830513,0.0007686371,0.0022286517,0.0024211013,0.0010067549,0.0011305086],"category_scores_gemma":[0.009152106,0.00055368245,0.00046862077,0.0014271628,0.0014232729,0.0023863749,0.0011695749,0.0016752206,0.0002468228],"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.00008914514,0.000051683957,0.00074686954,0.00005688658,0.00003706389,0.00012066904,0.000057093486,0.8870485,0.0016217701,0.07022189,0.0010458828,0.03890258],"study_design_scores_gemma":[0.000014424095,0.00002750062,0.00012225792,0.000006086184,0.000006777758,0.00004192284,0.000008556416,0.9631811,0.0005245071,0.035295043,0.00075853383,0.000013264043],"about_ca_topic_score_codex":0.007990701,"about_ca_topic_score_gemma":0.0046451893,"teacher_disagreement_score":0.007990701,"about_ca_system_score_codex":0.002243617,"about_ca_system_score_gemma":0.0022683914,"threshold_uncertainty_score":0.016278684},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16045558,0.0025194131,0.7952603,0.0025566658,0.00049420376,0.00010505516,0.00025525325,0.00024465667,0.038108826],"genre_scores_gemma":[0.9148066,0.0020725983,0.05754278,0.0005898801,0.0005271516,0.00016953207,0.00027636118,0.00016374342,0.023851262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993926,0.00013618128,0.000046808513,0.00005941602,0.00025147473,0.00011345798],"domain_scores_gemma":[0.998197,0.00075020635,0.00025784952,0.00008994697,0.00046418293,0.00024082263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023603027,0.0006908937,0.0007269658,0.0016129584,0.0009436992,0.0021357494,0.0011997112,0.0012931118,0.0033513312],"category_scores_gemma":[0.006311448,0.00029385823,0.0014559764,0.0011039743,0.0018810476,0.0031286133,0.0015030267,0.0014904396,0.00052865775],"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.000021524098,0.000027918744,0.0005121686,0.000045828085,0.000012203451,0.00023823699,0.00019054233,0.010683024,0.0017925779,0.9792355,0.0012284593,0.0060120877],"study_design_scores_gemma":[0.000018817329,0.000027845983,0.00047158677,0.000021338532,0.000015266593,0.0002344819,0.000082452934,0.28485247,0.0007014939,0.7117901,0.0017485485,0.000035645866],"about_ca_topic_score_codex":0.0021371748,"about_ca_topic_score_gemma":0.0013103473,"teacher_disagreement_score":0.0033513312,"about_ca_system_score_codex":0.0015372802,"about_ca_system_score_gemma":0.0013206651,"threshold_uncertainty_score":0.0124825835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54123664,0.00045245214,0.43470642,0.0010379119,0.000106196996,0.00006308246,0.00023916463,0.00041529062,0.021742873],"genre_scores_gemma":[0.99500495,0.00012844405,0.003181405,0.0000467768,0.000042562217,0.000022129243,0.000026424734,0.000026983278,0.0015203543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969522,0.0008809888,0.00007873756,0.0004355695,0.00066739414,0.0009849843],"domain_scores_gemma":[0.98966825,0.006274886,0.0016775082,0.0011049472,0.0008409427,0.00043347446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032102528,0.00058321236,0.0010525069,0.00060486764,0.000648567,0.002161466,0.001452959,0.0008862325,0.0029367483],"category_scores_gemma":[0.018494705,0.00053356035,0.00060121133,0.00073676056,0.0023322483,0.0032886537,0.0014474895,0.0012041911,0.00038121358],"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.00025685903,0.000086813976,0.0024082602,0.00007048826,0.000036084894,0.0007831099,0.00016798028,0.5363544,0.003895905,0.4437166,0.001567238,0.010656225],"study_design_scores_gemma":[0.00004931969,0.00010051836,0.0010424756,0.000013340295,0.000020176427,0.00036643207,0.00010200961,0.8189844,0.0013782756,0.17727332,0.00063717325,0.000032565265],"about_ca_topic_score_codex":0.002059504,"about_ca_topic_score_gemma":0.0010666273,"teacher_disagreement_score":0.0032102528,"about_ca_system_score_codex":0.0020649661,"about_ca_system_score_gemma":0.0018575336,"threshold_uncertainty_score":0.016977608},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12140299,0.0021975837,0.8393831,0.005022685,0.0004045255,0.00011583009,0.000480582,0.00076467375,0.03022799],"genre_scores_gemma":[0.90618616,0.0027084178,0.049246896,0.0013750494,0.0005222803,0.00023717758,0.00059531827,0.0004801406,0.038648542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983279,0.0006442784,0.000057433987,0.00021110424,0.00035845477,0.00040072505],"domain_scores_gemma":[0.9840007,0.0093847215,0.001626288,0.0010092027,0.002490205,0.001488873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005752297,0.0014930385,0.0031607328,0.002832578,0.001867942,0.004703325,0.0045780777,0.0038556235,0.00870145],"category_scores_gemma":[0.03595437,0.0015468709,0.0017791629,0.002471177,0.005017852,0.008862173,0.0035343578,0.005099281,0.001259366],"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.000045236207,0.000034903496,0.00049378455,0.000061778985,0.000017675888,0.00008156367,0.00011932744,0.07033099,0.00032074933,0.92314005,0.0027566084,0.0025973315],"study_design_scores_gemma":[0.000019881289,0.000016289228,0.0001797015,0.000018062508,0.000014289301,0.000050790877,0.00004813436,0.6062339,0.00010433405,0.39249614,0.0007951033,0.000023370609],"about_ca_topic_score_codex":0.010966939,"about_ca_topic_score_gemma":0.004568841,"teacher_disagreement_score":0.010966939,"about_ca_system_score_codex":0.005385633,"about_ca_system_score_gemma":0.002554438,"threshold_uncertainty_score":0.039075732},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6539438,0.0014254423,0.32566333,0.002798008,0.00053761783,0.00039047643,0.0011158957,0.00087688817,0.013248476],"genre_scores_gemma":[0.9756884,0.00032817214,0.015193488,0.00024138454,0.00021285072,0.000093423325,0.00018154488,0.000046967685,0.008013762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766374,0.00048078143,0.00011440669,0.0004888904,0.00031193564,0.0009402625],"domain_scores_gemma":[0.9970366,0.0008040318,0.00068184733,0.00021888463,0.00060810853,0.00065056613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027579516,0.0017415764,0.0024601233,0.0011583312,0.0020739154,0.0029674398,0.0045636115,0.0037147228,0.003966399],"category_scores_gemma":[0.004301023,0.0009788624,0.0015275382,0.0018986071,0.0021859694,0.002539922,0.0022248174,0.0022990885,0.00068667973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016432649,0.00045321896,0.0055013173,0.00024245949,0.00013119349,0.0030637085,0.00047121246,0.89992726,0.009904906,0.06473903,0.0033332205,0.010589281],"study_design_scores_gemma":[0.00015721044,0.00019428102,0.0007514008,0.000009999065,0.00006155287,0.0001575358,0.000082919796,0.9872595,0.00074980233,0.009926989,0.00059653766,0.000052116528],"about_ca_topic_score_codex":0.024155743,"about_ca_topic_score_gemma":0.012579214,"teacher_disagreement_score":0.024155743,"about_ca_system_score_codex":0.002891585,"about_ca_system_score_gemma":0.0025368591,"threshold_uncertainty_score":0.048030257},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34701002,0.0031672164,0.63752294,0.0027580622,0.00030965355,0.00010488594,0.00034280916,0.00040365718,0.008380711],"genre_scores_gemma":[0.98085004,0.0018478355,0.012708815,0.00018116727,0.00044609985,0.00007155235,0.00024545006,0.00013765048,0.0035114146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981962,0.0006602623,0.000057268462,0.0003011828,0.00044526818,0.00033984735],"domain_scores_gemma":[0.96853316,0.024972595,0.0017057597,0.00079582824,0.0030969079,0.0008956616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009251853,0.0013186805,0.0018922575,0.0029397449,0.0014102148,0.0032888611,0.004114622,0.0016687964,0.0032993867],"category_scores_gemma":[0.036025908,0.0014073572,0.00088552845,0.002874832,0.0045867544,0.005562595,0.0014718313,0.0033148339,0.00046796797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056022365,0.00021541493,0.004423751,0.00021648107,0.00011244892,0.0004024839,0.0008343034,0.5541002,0.005109492,0.41665384,0.0038405925,0.013530821],"study_design_scores_gemma":[0.000017798146,0.000029056573,0.0006530145,0.000017638078,0.000021316182,0.000041492694,0.00008666487,0.96960896,0.0003250337,0.028973576,0.00020032769,0.000025172856],"about_ca_topic_score_codex":0.011114678,"about_ca_topic_score_gemma":0.0057373336,"teacher_disagreement_score":0.011114678,"about_ca_system_score_codex":0.0058104983,"about_ca_system_score_gemma":0.0032148242,"threshold_uncertainty_score":0.048929036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6896061,0.0007029293,0.29674858,0.0025500376,0.00018046227,0.00014908577,0.0001687373,0.00034432943,0.009549865],"genre_scores_gemma":[0.9898011,0.0001526984,0.0055911653,0.00012740544,0.00008294107,0.00003137891,0.000036809266,0.000014891774,0.0041616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980326,0.00053915626,0.00010361677,0.0003975925,0.0003808639,0.0005461993],"domain_scores_gemma":[0.99271977,0.002971095,0.0012438633,0.0006681608,0.0014077039,0.0009893922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040760683,0.0008119862,0.0011104055,0.0012015972,0.001429011,0.002775919,0.0029610544,0.002253147,0.0036133495],"category_scores_gemma":[0.009543412,0.0006078236,0.00082860916,0.0010028377,0.0025414398,0.0038451583,0.0021296092,0.0032750256,0.00048489808],"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.0015494563,0.00066315953,0.014149624,0.00024499878,0.00014402963,0.0055144946,0.0016343535,0.5201029,0.02005147,0.41016746,0.004235063,0.021542951],"study_design_scores_gemma":[0.00013433582,0.00021765882,0.0011096329,0.000015526288,0.000048927504,0.00043052578,0.00024409941,0.95477486,0.0017219519,0.040182613,0.0010597332,0.00006009709],"about_ca_topic_score_codex":0.006770223,"about_ca_topic_score_gemma":0.0027269062,"teacher_disagreement_score":0.006770223,"about_ca_system_score_codex":0.0027660355,"about_ca_system_score_gemma":0.0015719136,"threshold_uncertainty_score":0.021556556},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13372429,0.00077210774,0.8554361,0.0014247852,0.00026022788,0.00024246098,0.0012686456,0.00044164088,0.0064297444],"genre_scores_gemma":[0.88226694,0.0009717429,0.09960506,0.00036035382,0.00035058675,0.00034352325,0.00061996153,0.000084295345,0.015397649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981665,0.0004949068,0.00012340517,0.0003233837,0.00043253176,0.00045926688],"domain_scores_gemma":[0.99232,0.0041643553,0.0010423157,0.0007507548,0.0010743994,0.00064825226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047109425,0.0006976979,0.0015402846,0.0014778981,0.0017754914,0.0028445025,0.0037366764,0.0019140354,0.006082259],"category_scores_gemma":[0.009885165,0.0009666843,0.0012195812,0.0023084602,0.0022764292,0.0033387186,0.0017143901,0.0024254494,0.0008785893],"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.00046632515,0.0001451119,0.0021450415,0.00011634432,0.00007128275,0.00041268874,0.00025894662,0.24372856,0.0022685144,0.7351867,0.0030489045,0.012151508],"study_design_scores_gemma":[0.000064326785,0.000055305387,0.0005245568,0.0000111740455,0.000028969373,0.00013066108,0.00003167724,0.89497864,0.000306699,0.102907315,0.00093010464,0.000030585965],"about_ca_topic_score_codex":0.011277765,"about_ca_topic_score_gemma":0.009106066,"teacher_disagreement_score":0.011277765,"about_ca_system_score_codex":0.0026956738,"about_ca_system_score_gemma":0.0034149091,"threshold_uncertainty_score":0.024914145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.502608,0.0033464786,0.46913454,0.0022765764,0.0009369275,0.0005018457,0.0023863208,0.0011242583,0.017685015],"genre_scores_gemma":[0.94170666,0.00095911534,0.037135974,0.0002156081,0.0003321723,0.00022895091,0.00050642405,0.000033281405,0.01888188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979855,0.00043630382,0.00013316722,0.00058289466,0.00046492295,0.00039728187],"domain_scores_gemma":[0.9972013,0.0010809541,0.00037616683,0.0003059682,0.0006220204,0.00041359806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002042274,0.0009536967,0.0016959372,0.00076146296,0.0018771152,0.0024508587,0.0035644458,0.0022205506,0.007228656],"category_scores_gemma":[0.0040132655,0.00087161316,0.000993175,0.0015450153,0.0011642178,0.0023017128,0.0013665487,0.0012594566,0.0011540789],"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.0022380082,0.0006551706,0.006624543,0.00073934335,0.0002818082,0.0034605102,0.0005799761,0.75292015,0.015100176,0.16883735,0.0072473213,0.041315693],"study_design_scores_gemma":[0.00026017675,0.00031872684,0.0008156782,0.00001775232,0.000092185655,0.00032983086,0.00007923131,0.9778912,0.0013532825,0.016521832,0.0022564593,0.000063596905],"about_ca_topic_score_codex":0.0070797093,"about_ca_topic_score_gemma":0.0056255125,"teacher_disagreement_score":0.007228656,"about_ca_system_score_codex":0.0017444063,"about_ca_system_score_gemma":0.0021743507,"threshold_uncertainty_score":0.0241822},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11995232,0.0014368194,0.85604477,0.0041148355,0.0002565315,0.00014734006,0.00032090393,0.00023799775,0.017488444],"genre_scores_gemma":[0.9197538,0.0011265473,0.063987345,0.0004850444,0.00041778764,0.00015589134,0.00026976402,0.000127042,0.013676865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988285,0.000417113,0.000037045393,0.00014913669,0.00028704415,0.00028115846],"domain_scores_gemma":[0.99436754,0.0039938805,0.0005562763,0.00019208653,0.00054918,0.00034096258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032874595,0.0010919522,0.0015518832,0.0018484981,0.001136156,0.0028740966,0.0031508193,0.0019104023,0.0057676],"category_scores_gemma":[0.0092186555,0.0009114575,0.0013528385,0.001264546,0.002772173,0.0034048546,0.0022131084,0.0032371231,0.00043011343],"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.0000695607,0.00007038496,0.0007693073,0.000082558916,0.00004173943,0.00016084917,0.00013572,0.61549616,0.0009612436,0.37450328,0.0020974518,0.005611589],"study_design_scores_gemma":[0.0000049131268,0.000006759965,0.0001092118,0.0000057309667,0.000005672664,0.000016234602,0.000015716925,0.96264267,0.00007096165,0.036914285,0.00019993076,0.000007891751],"about_ca_topic_score_codex":0.007884804,"about_ca_topic_score_gemma":0.005459699,"teacher_disagreement_score":0.007884804,"about_ca_system_score_codex":0.0035751008,"about_ca_system_score_gemma":0.002990953,"threshold_uncertainty_score":0.025939286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072591454,0.00040111257,0.91743606,0.00055191416,0.00007472983,0.00020298104,0.00029158886,0.00090909685,0.007541039],"genre_scores_gemma":[0.608175,0.00031661277,0.38706726,0.00023194592,0.00008024379,0.00019095423,0.00035150003,0.00020420217,0.003382181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907863,0.0003524085,0.00002540501,0.00009100617,0.00018768091,0.00026484774],"domain_scores_gemma":[0.99879766,0.0006781803,0.00011828818,0.00010572266,0.00015286563,0.00014731329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015087051,0.00090874644,0.0007499662,0.0007566635,0.00074371067,0.001332183,0.0017618034,0.0015663801,0.004673464],"category_scores_gemma":[0.003516947,0.0004490504,0.0006143768,0.0012923188,0.00041490662,0.0010882408,0.0007289053,0.0009550247,0.00048507281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076042576,0.00014822197,0.0008698572,0.00005956817,0.000036231053,0.000038297923,0.00008187852,0.9414576,0.0014421191,0.008230534,0.0043535233,0.043206036],"study_design_scores_gemma":[0.00001431234,0.000029054983,0.000268651,0.0000046882974,0.000012236765,0.000018493058,0.000021575177,0.99477047,0.0006451834,0.0034053049,0.0008012418,0.000008672755],"about_ca_topic_score_codex":0.014065809,"about_ca_topic_score_gemma":0.014281988,"teacher_disagreement_score":0.014065809,"about_ca_system_score_codex":0.0024538997,"about_ca_system_score_gemma":0.0028924223,"threshold_uncertainty_score":0.02796787},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24083601,0.0029071188,0.7432451,0.0013963389,0.00019735309,0.00010951741,0.00015231805,0.00049003627,0.010666118],"genre_scores_gemma":[0.9829071,0.00054299785,0.013243801,0.00007903304,0.00015307766,0.000030964187,0.00006392763,0.000047385394,0.002931797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973693,0.00090809196,0.00008534775,0.00026122437,0.00095177296,0.0004242501],"domain_scores_gemma":[0.98657644,0.010264378,0.0007184272,0.00042941116,0.0015645061,0.00044671437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006563407,0.0012529363,0.0015123088,0.0020935305,0.0008626497,0.0029469626,0.0020571356,0.001439967,0.0024459846],"category_scores_gemma":[0.01912861,0.00067055307,0.0009045428,0.0018698989,0.0018149232,0.0026075023,0.0014152756,0.0013549854,0.0002996852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027430546,0.00011692754,0.0011182152,0.000070891605,0.000069213085,0.0000979756,0.000095407995,0.88619006,0.0028541472,0.09618634,0.0009163755,0.012010165],"study_design_scores_gemma":[0.0000045820884,0.000025766076,0.00012258872,0.000003106884,0.000008934494,0.0000113555825,0.0000061415426,0.99434584,0.0002102185,0.005195686,0.00005939514,0.0000063112507],"about_ca_topic_score_codex":0.007974653,"about_ca_topic_score_gemma":0.0026386695,"teacher_disagreement_score":0.007974653,"about_ca_system_score_codex":0.004669345,"about_ca_system_score_gemma":0.0030624834,"threshold_uncertainty_score":0.034711063},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7193561,0.0006085694,0.25153878,0.0016821628,0.0001748311,0.00019368269,0.00038247395,0.00036214254,0.025701284],"genre_scores_gemma":[0.9909354,0.000073044335,0.004471571,0.00003894728,0.00002057887,0.000028794655,0.0000624103,0.000031076925,0.004338149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911994,0.00036912953,0.000025617266,0.00014687635,0.000092101436,0.00024642525],"domain_scores_gemma":[0.9987103,0.0006627226,0.00017486334,0.000043449374,0.00022091753,0.0001876663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015555071,0.001381301,0.0017410293,0.0007485635,0.0010865777,0.0023135527,0.0011259881,0.0019980757,0.005345831],"category_scores_gemma":[0.0024474172,0.0007213259,0.0006749684,0.0010624516,0.0010508292,0.0011625832,0.0014216811,0.0011771909,0.00026824616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092908915,0.000022631144,0.0002259635,0.000011997483,0.000015962774,0.000052798594,0.0000137277275,0.9956273,0.0005168377,0.0014486343,0.0003159332,0.0016553227],"study_design_scores_gemma":[0.000016638369,0.000056328496,0.00023063889,0.0000014882107,0.000011877863,0.0000069090815,0.000019461912,0.9988186,0.0001349616,0.00058252754,0.000115302675,0.000005273409],"about_ca_topic_score_codex":0.03241405,"about_ca_topic_score_gemma":0.013315252,"teacher_disagreement_score":0.03241405,"about_ca_system_score_codex":0.003479421,"about_ca_system_score_gemma":0.0018558652,"threshold_uncertainty_score":0.06445074},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46272966,0.0021989096,0.5265311,0.0018565494,0.0002372717,0.000067811896,0.00012183744,0.00034267825,0.0059141717],"genre_scores_gemma":[0.99245054,0.0003454715,0.005147687,0.00006760395,0.00008767218,0.000024222249,0.000033423737,0.000028217824,0.0018150634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833447,0.0007028263,0.000054515673,0.0001860632,0.00035970996,0.00036254418],"domain_scores_gemma":[0.9902705,0.0070482343,0.00078633346,0.00028175223,0.0010923762,0.0005207307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036728717,0.00053317857,0.0012813848,0.0010273688,0.0013342733,0.0031401808,0.0013311881,0.0010476629,0.0020567842],"category_scores_gemma":[0.023448579,0.000853863,0.00031293786,0.001159015,0.0017486247,0.0036758077,0.0014555681,0.0010452052,0.00014885835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036953297,0.00007905387,0.0027471706,0.00007344419,0.000037945112,0.00022082683,0.00026415425,0.81546915,0.0023650064,0.16666605,0.0016159758,0.010091805],"study_design_scores_gemma":[0.000009518368,0.0000124857825,0.0002491811,0.00000459127,0.000008616007,0.000020341611,0.000033543474,0.9777385,0.00012423989,0.021625062,0.00016678077,0.0000071444124],"about_ca_topic_score_codex":0.009425082,"about_ca_topic_score_gemma":0.0060242754,"teacher_disagreement_score":0.009425082,"about_ca_system_score_codex":0.0033344026,"about_ca_system_score_gemma":0.001363341,"threshold_uncertainty_score":0.02419293},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4559038,0.00027200294,0.5194913,0.0034542996,0.00018402393,0.00038820642,0.00031841968,0.00060126005,0.01938663],"genre_scores_gemma":[0.9597138,0.00009191512,0.037637427,0.00013860343,0.000075120166,0.000108396096,0.0000824999,0.00005230153,0.0020998248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946114,0.0024735362,0.00033570034,0.00067364064,0.00045491196,0.0014507899],"domain_scores_gemma":[0.97623026,0.014769792,0.0019179729,0.0028337666,0.0017725786,0.0024756056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071469024,0.0007967049,0.0027687107,0.0015843222,0.0017167953,0.0038144707,0.002247799,0.0027686593,0.005584208],"category_scores_gemma":[0.03506816,0.0010639831,0.00062683545,0.0023150877,0.001571903,0.0047395104,0.0028907107,0.0017714839,0.00071747333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041372553,0.0015202967,0.01090123,0.0004593644,0.00026836107,0.0008193193,0.0008265658,0.6711073,0.006803841,0.14871614,0.014685123,0.13975528],"study_design_scores_gemma":[0.00032522186,0.00020736155,0.0018163836,0.00004760214,0.00009599092,0.00019030744,0.00065493246,0.7473423,0.0021802122,0.24552672,0.0015764483,0.000036571655],"about_ca_topic_score_codex":0.0032684836,"about_ca_topic_score_gemma":0.002676667,"teacher_disagreement_score":0.0071469024,"about_ca_system_score_codex":0.0017058321,"about_ca_system_score_gemma":0.00596396,"threshold_uncertainty_score":0.037796915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48781282,0.0020155895,0.49103165,0.0022507233,0.00016697404,0.00008499489,0.0002219851,0.0013830442,0.015032309],"genre_scores_gemma":[0.98630255,0.0005257573,0.009603729,0.00016933685,0.0001446132,0.000047983624,0.00008143488,0.0001286971,0.002995828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936754,0.00019009132,0.000018362422,0.00009044276,0.00019290774,0.00014068483],"domain_scores_gemma":[0.99371356,0.0038979822,0.0008421332,0.00042188837,0.00079719245,0.00032720985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028476855,0.0009011303,0.00078950473,0.001546281,0.00052369805,0.0013616165,0.0016801393,0.0012905181,0.0027245265],"category_scores_gemma":[0.019671503,0.0004754127,0.0006519007,0.0007688261,0.0019659062,0.0025225445,0.0012838098,0.0024060202,0.00053818745],"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.0005668384,0.00020486569,0.009729502,0.00029438743,0.0000777439,0.0016642539,0.0013469926,0.3778818,0.02681198,0.55354804,0.003949978,0.023923576],"study_design_scores_gemma":[0.000028456465,0.00006359704,0.0023139985,0.00002985416,0.000021958438,0.00022354437,0.00008990921,0.9399323,0.0014472122,0.05536132,0.00044839556,0.000039475275],"about_ca_topic_score_codex":0.004818724,"about_ca_topic_score_gemma":0.0016887931,"teacher_disagreement_score":0.004818724,"about_ca_system_score_codex":0.0020296471,"about_ca_system_score_gemma":0.0008988125,"threshold_uncertainty_score":0.015060186},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09129493,0.0009064318,0.892319,0.0020977275,0.00013388536,0.000096147494,0.000038864146,0.00019605542,0.012917029],"genre_scores_gemma":[0.9303676,0.00025862895,0.062403433,0.0002616893,0.00025161184,0.00011198553,0.00002415585,0.00012451805,0.0061963806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934022,0.0039153397,0.00016468206,0.00038318333,0.0016078892,0.0005266284],"domain_scores_gemma":[0.9684391,0.025457565,0.0009031058,0.0024423632,0.0019369333,0.000820891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00979823,0.0005410379,0.0016628221,0.0011213532,0.0023172859,0.002858359,0.002958291,0.0013798316,0.008243688],"category_scores_gemma":[0.045248035,0.00059528253,0.0007546232,0.0015866719,0.0039726584,0.009388119,0.0030931411,0.0024229402,0.00051888655],"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.0006857684,0.00022890896,0.002164089,0.00012843002,0.00006392756,0.00021426378,0.0005346299,0.2958444,0.0034489296,0.65433025,0.0026080452,0.039748408],"study_design_scores_gemma":[0.00002866991,0.000073621115,0.00036600092,0.000017125676,0.000024365645,0.00005209443,0.0001008442,0.78150535,0.0011498929,0.21549128,0.0011687377,0.000022012988],"about_ca_topic_score_codex":0.0033060529,"about_ca_topic_score_gemma":0.0040544863,"teacher_disagreement_score":0.00979823,"about_ca_system_score_codex":0.0022037115,"about_ca_system_score_gemma":0.0018870375,"threshold_uncertainty_score":0.05181861},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26389754,0.0008785982,0.72187316,0.0018111431,0.0002550763,0.00019720942,0.00036191437,0.0005168116,0.010208484],"genre_scores_gemma":[0.9935661,0.00010488275,0.0040515843,0.00004851026,0.000023883427,0.000049996426,0.000043230106,0.000017784525,0.0020940918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984012,0.000521573,0.00006605375,0.0003401886,0.00024132025,0.00042954434],"domain_scores_gemma":[0.9968245,0.001675059,0.00054154155,0.00010948495,0.0005838954,0.00026547778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003016859,0.0017155078,0.0024056528,0.0010067482,0.0009813532,0.003014746,0.0016389686,0.0025768138,0.0023250685],"category_scores_gemma":[0.0046349773,0.0009862595,0.0010610158,0.00083945075,0.0018600842,0.0013751934,0.002651832,0.0015425003,0.00022856811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011097206,0.000030952375,0.00024236423,0.00003970776,0.000035845136,0.000054213855,0.00003058754,0.99255836,0.0012062682,0.0037650308,0.00019199835,0.0017337542],"study_design_scores_gemma":[0.00000781744,0.000043707638,0.00015433185,0.0000038418193,0.000010845102,0.0000039321008,0.000006134247,0.99854773,0.00015755463,0.0010231803,0.00003453008,0.0000064127894],"about_ca_topic_score_codex":0.01729456,"about_ca_topic_score_gemma":0.008060303,"teacher_disagreement_score":0.01729456,"about_ca_system_score_codex":0.0022160618,"about_ca_system_score_gemma":0.002573169,"threshold_uncertainty_score":0.034387767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2025714,0.00036402637,0.7944387,0.00038286604,0.00012175845,0.0001584133,0.0000684153,0.00039045836,0.0015040074],"genre_scores_gemma":[0.96550626,0.00014941292,0.033303767,0.00006047915,0.000040222076,0.000055837492,0.00005148948,0.00002337064,0.000809273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977888,0.0007904784,0.00013425881,0.0003553254,0.00059842144,0.0003326457],"domain_scores_gemma":[0.99393964,0.0044122897,0.00035572823,0.00018210453,0.0007890302,0.00032122692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037960762,0.00066735613,0.0013439499,0.00072078034,0.0008911348,0.0019051034,0.0017513436,0.0010295464,0.0011464385],"category_scores_gemma":[0.009528586,0.0007019677,0.0004103843,0.0007736053,0.00076339743,0.002035365,0.0006053466,0.00090913044,0.00014673991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027268429,0.0004992777,0.006505395,0.00039649173,0.000103214516,0.00042978209,0.00033949767,0.85171205,0.033846,0.036749333,0.0022218232,0.064470254],"study_design_scores_gemma":[0.000043660613,0.00008135714,0.00041279604,0.0000039080596,0.000016697231,0.000022722119,0.00001549047,0.99419135,0.0022934831,0.0028025394,0.00009943845,0.000016422771],"about_ca_topic_score_codex":0.0044543683,"about_ca_topic_score_gemma":0.002826767,"teacher_disagreement_score":0.0044543683,"about_ca_system_score_codex":0.0020107315,"about_ca_system_score_gemma":0.001771382,"threshold_uncertainty_score":0.020075798},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53082645,0.0010084407,0.44388744,0.0034189366,0.000261757,0.0005770625,0.00059497287,0.0013939718,0.018030867],"genre_scores_gemma":[0.96858203,0.000102500875,0.028996516,0.00018583128,0.000058893813,0.000068511334,0.00007542373,0.000049635342,0.0018806387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770445,0.0008476677,0.00008177508,0.00028291656,0.0002715442,0.00081161567],"domain_scores_gemma":[0.9963463,0.0018239556,0.00037195336,0.00021620188,0.00072859105,0.00051296427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027541956,0.0008237059,0.001100764,0.0012206802,0.0015166497,0.0018933899,0.0013228158,0.0017824273,0.0042790677],"category_scores_gemma":[0.0058852322,0.0003908482,0.00039689837,0.0007999113,0.001112495,0.0014751969,0.00088652474,0.00085097586,0.00035169066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015711389,0.00030323883,0.0020271812,0.00016101851,0.00005336321,0.00016716855,0.00014392425,0.9251845,0.007348366,0.03171651,0.0063083665,0.025015285],"study_design_scores_gemma":[0.000039291397,0.000087889995,0.00035954468,0.000009220333,0.000020386267,0.000022978655,0.00004202375,0.99063957,0.0012545501,0.0073063495,0.00020666338,0.00001161468],"about_ca_topic_score_codex":0.014839071,"about_ca_topic_score_gemma":0.010853434,"teacher_disagreement_score":0.014839071,"about_ca_system_score_codex":0.004167113,"about_ca_system_score_gemma":0.005065254,"threshold_uncertainty_score":0.030234635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8678124,0.0006663193,0.12707214,0.00090333854,0.0001280506,0.000066318025,0.00044821866,0.0005221931,0.0023809585],"genre_scores_gemma":[0.99687433,0.00011357819,0.0018559904,0.000038232443,0.000040437775,0.000014118025,0.00010088328,0.000021816788,0.0009406383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901414,0.00018182858,0.000054557575,0.00021145031,0.00020268607,0.00033529522],"domain_scores_gemma":[0.99392253,0.0031800556,0.00073678204,0.000313111,0.0011976062,0.00064990815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020982688,0.0006736289,0.0010870969,0.0012351807,0.0010079478,0.0020218128,0.0021540965,0.0016280162,0.0017570616],"category_scores_gemma":[0.006430951,0.0006149585,0.00044109437,0.0014420514,0.0013231605,0.0017092297,0.0010061273,0.0010120445,0.00038700821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027678863,0.00040398602,0.018209293,0.00037425864,0.00017607208,0.0023650455,0.0009594109,0.79488873,0.031841394,0.1282331,0.00566842,0.014112391],"study_design_scores_gemma":[0.000023150978,0.000049659284,0.0008239796,0.0000041822273,0.000020157528,0.00010062227,0.000049794722,0.9943634,0.00059393584,0.0038304562,0.000112351845,0.000028355056],"about_ca_topic_score_codex":0.0071784654,"about_ca_topic_score_gemma":0.0030816917,"teacher_disagreement_score":0.0071784654,"about_ca_system_score_codex":0.0022361553,"about_ca_system_score_gemma":0.0016410672,"threshold_uncertainty_score":0.016224563},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96179175,0.0002437619,0.031832505,0.00031763938,0.000049779926,0.0000468309,0.0001294632,0.0007048862,0.0048833727],"genre_scores_gemma":[0.99751663,0.000023260809,0.0017300859,0.000016108557,0.000015813075,0.0000071842755,0.000038186652,0.00002212128,0.0006305863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979194,0.0007001103,0.00005381861,0.00026228934,0.00044395446,0.00062050944],"domain_scores_gemma":[0.9935588,0.0041666226,0.00026765288,0.0002321387,0.00124284,0.0005320097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019354296,0.0009257262,0.0011749543,0.0008311567,0.001462312,0.0017798744,0.001319776,0.0012435877,0.0038395312],"category_scores_gemma":[0.00395999,0.0003714554,0.00042639274,0.0013770013,0.0010619451,0.0011054197,0.000782155,0.0009002622,0.0003919777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046259663,0.00048510585,0.0070406646,0.00009318745,0.00013632339,0.00030749178,0.00017711887,0.93606275,0.023862688,0.006003039,0.0019278079,0.019277792],"study_design_scores_gemma":[0.000023826018,0.00034731312,0.0017263873,0.0000014248747,0.00003997881,0.00002655329,0.000055898017,0.9941778,0.0032011918,0.00029915903,0.000084676154,0.000015747435],"about_ca_topic_score_codex":0.025252042,"about_ca_topic_score_gemma":0.0077896933,"teacher_disagreement_score":0.025252042,"about_ca_system_score_codex":0.0035779898,"about_ca_system_score_gemma":0.002090981,"threshold_uncertainty_score":0.05021012},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30800927,0.00046295056,0.682161,0.00051048363,0.000088860565,0.00007355315,0.00010446246,0.00040550975,0.008183846],"genre_scores_gemma":[0.9821983,0.00011715138,0.016613208,0.00004881729,0.000024910138,0.000047112717,0.00004428676,0.000020664922,0.00088553043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998461,0.00028684307,0.0000854917,0.0003029161,0.0005137345,0.0003500813],"domain_scores_gemma":[0.99391043,0.0031997084,0.0010683127,0.00027061297,0.0012834077,0.00026746155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021371422,0.00053901295,0.00060930813,0.00071528356,0.00094716414,0.0012822737,0.000811323,0.0007054019,0.001767825],"category_scores_gemma":[0.01230355,0.00019695633,0.00033663123,0.00039126838,0.0012535959,0.0020960057,0.001269486,0.0010234017,0.00020471915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006100515,0.00013447231,0.00436798,0.0003184455,0.00006725273,0.00066334713,0.0008124136,0.64496726,0.073550485,0.22459954,0.0013245496,0.048584238],"study_design_scores_gemma":[0.000031578013,0.00008553403,0.0004074281,0.000015072691,0.0000106382395,0.00008077597,0.00009395176,0.95274544,0.0073602195,0.038421817,0.0007323129,0.000015256925],"about_ca_topic_score_codex":0.005059847,"about_ca_topic_score_gemma":0.0020112463,"teacher_disagreement_score":0.005059847,"about_ca_system_score_codex":0.0012904782,"about_ca_system_score_gemma":0.002158152,"threshold_uncertainty_score":0.011302412},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034978677,0.000116738265,0.9623826,0.0002035142,0.000030326924,0.000041566316,0.000029565415,0.00013853048,0.0020784435],"genre_scores_gemma":[0.7688864,0.00037572448,0.22453934,0.00018403963,0.0001397068,0.00025048087,0.00013237156,0.0002031125,0.0052888845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903107,0.00046661706,0.000044687476,0.00014573609,0.00018255622,0.00012938879],"domain_scores_gemma":[0.985307,0.012598391,0.0006190429,0.00034030664,0.00076109136,0.0003742327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038913002,0.00092502125,0.0011142376,0.0021591904,0.001306358,0.002348613,0.0018103748,0.0017243277,0.003333477],"category_scores_gemma":[0.018434923,0.0010651189,0.00093890517,0.0011481331,0.003027511,0.0044985204,0.0020419222,0.0020420484,0.00051004736],"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.00016602836,0.0002838075,0.0021253473,0.00024335537,0.000094082236,0.0001906053,0.00043685237,0.35905504,0.004762625,0.60045654,0.0018777985,0.030307984],"study_design_scores_gemma":[0.000012853457,0.000008027104,0.00010572708,0.000011489614,0.0000059757654,0.000016052043,0.000036338035,0.853592,0.00043927916,0.14562036,0.00014118006,0.000010663799],"about_ca_topic_score_codex":0.0026773314,"about_ca_topic_score_gemma":0.002537634,"teacher_disagreement_score":0.0038913002,"about_ca_system_score_codex":0.0009695432,"about_ca_system_score_gemma":0.0018049207,"threshold_uncertainty_score":0.020579457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028652798,0.00025948547,0.96720046,0.00021945807,0.000100916295,0.00008326447,0.00009091431,0.001160309,0.002232278],"genre_scores_gemma":[0.59061646,0.00033971292,0.4020702,0.00014805616,0.0001133853,0.00014115134,0.00022453579,0.00036749998,0.0059790355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765164,0.0009249935,0.00016018472,0.00026607487,0.00053279643,0.00046435892],"domain_scores_gemma":[0.9959518,0.0016200654,0.00030668484,0.0010577516,0.00072785607,0.0003357681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039715003,0.00083285646,0.0013011793,0.0009365558,0.0017575852,0.0027545122,0.0027437783,0.0009559318,0.0038492428],"category_scores_gemma":[0.010462859,0.00094461633,0.00097165845,0.0010393333,0.0009416456,0.0027396164,0.0017260597,0.0015762066,0.0011018793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010007714,0.0002311605,0.0010148879,0.000165885,0.000113349866,0.00028114516,0.0003046222,0.76748395,0.018243317,0.10057117,0.0059862803,0.10460342],"study_design_scores_gemma":[0.000014038451,0.000029325129,0.00007856663,0.000005641491,0.000017277374,0.0000311015,0.00001718625,0.98194355,0.0019584256,0.015194488,0.0006924897,0.000017842807],"about_ca_topic_score_codex":0.0058965,"about_ca_topic_score_gemma":0.0074155685,"teacher_disagreement_score":0.0058965,"about_ca_system_score_codex":0.0024251633,"about_ca_system_score_gemma":0.0026116811,"threshold_uncertainty_score":0.021003544},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2063412,0.0006409901,0.7901597,0.00033160782,0.000055855817,0.00003458482,0.00011008805,0.00023274032,0.0020931894],"genre_scores_gemma":[0.9729646,0.00023647917,0.024762979,0.000023833993,0.00003375706,0.00003263019,0.000049254562,0.000020043208,0.0018764712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976593,0.000066039145,0.000014290742,0.000038663686,0.0000741743,0.00004096915],"domain_scores_gemma":[0.9991296,0.000530809,0.00012417466,0.00004887074,0.0001255347,0.00004097518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086103764,0.00037770093,0.00038321395,0.00038910983,0.0002783097,0.0009778049,0.0010105517,0.0006835799,0.0006733994],"category_scores_gemma":[0.0022606517,0.00020522907,0.00038783255,0.00039585377,0.00051586697,0.000817858,0.00033678918,0.0005445972,0.00012728931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008394501,0.000039255294,0.002013756,0.000043494892,0.000024477942,0.00010638049,0.0000772882,0.95735013,0.004751798,0.029725702,0.00028654686,0.005497326],"study_design_scores_gemma":[0.0000015696427,0.000003991241,0.00014435686,9.1388864e-7,0.0000019319145,0.0000049814207,0.0000029488424,0.9977582,0.00023661986,0.0017885234,0.000054468983,0.0000015875227],"about_ca_topic_score_codex":0.008706346,"about_ca_topic_score_gemma":0.003191336,"teacher_disagreement_score":0.008706346,"about_ca_system_score_codex":0.0011512942,"about_ca_system_score_gemma":0.00085664104,"threshold_uncertainty_score":0.017311335},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057152747,0.000079499725,0.9931774,0.000043568696,0.0000148404615,0.000020047612,0.000016830243,0.0001831643,0.00074939354],"genre_scores_gemma":[0.4746932,0.00026536672,0.51980203,0.000100047204,0.00005653967,0.00026082588,0.00018892426,0.0002233932,0.0044096787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989096,0.00037502372,0.000054716304,0.00014079761,0.0003679511,0.00015199075],"domain_scores_gemma":[0.9975834,0.0015345756,0.00022846386,0.00021406982,0.00033497027,0.00010451691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022221399,0.0007612014,0.001270666,0.00067621045,0.000771162,0.0014701057,0.0023646927,0.00090628554,0.0026959672],"category_scores_gemma":[0.00642662,0.0006149966,0.0007497075,0.0008354668,0.0007914369,0.0019321874,0.001232763,0.0014039864,0.00048117473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046381832,0.000018819994,0.00032182512,0.000031160707,0.000017914852,0.000024700603,0.000055941357,0.948015,0.00059250614,0.029430253,0.00031530112,0.021130227],"study_design_scores_gemma":[0.0000017713675,0.0000025348781,0.000009800466,0.0000011171746,8.890523e-7,0.000002186004,0.0000024630226,0.99615127,0.000063690524,0.0036436042,0.00011958431,0.0000010166405],"about_ca_topic_score_codex":0.013094483,"about_ca_topic_score_gemma":0.009836481,"teacher_disagreement_score":0.013094483,"about_ca_system_score_codex":0.0023661554,"about_ca_system_score_gemma":0.002635925,"threshold_uncertainty_score":0.02603656},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14317119,0.0005035756,0.85053396,0.000865384,0.000102605896,0.00014055679,0.00092016475,0.0005642733,0.0031983291],"genre_scores_gemma":[0.93849814,0.0007110833,0.053598788,0.00015513317,0.00015105585,0.00025163096,0.0011846828,0.00022452972,0.0052248733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787045,0.0009067893,0.000083074054,0.00048756815,0.0003614834,0.0002906136],"domain_scores_gemma":[0.9927583,0.0042283977,0.0011268369,0.00065470376,0.0010219245,0.00020978482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005838145,0.0012543764,0.0013395528,0.0015229101,0.00066678046,0.0022906393,0.003286683,0.0014430267,0.0035026514],"category_scores_gemma":[0.016102435,0.00079205853,0.001298661,0.002450502,0.0015918668,0.0027748856,0.0008774106,0.0022987244,0.0010129387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009627408,0.00008753116,0.0043060686,0.00004313658,0.00009398005,0.00017536785,0.00019366058,0.93819964,0.0009667702,0.045945458,0.002167777,0.0077244462],"study_design_scores_gemma":[0.0000071204026,0.000015037595,0.0010877544,0.0000051426614,0.000009633453,0.00002367635,0.000019229656,0.9921314,0.00009511597,0.0061866352,0.00040375817,0.000015556483],"about_ca_topic_score_codex":0.022979703,"about_ca_topic_score_gemma":0.009992845,"teacher_disagreement_score":0.022979703,"about_ca_system_score_codex":0.0023753198,"about_ca_system_score_gemma":0.0015358039,"threshold_uncertainty_score":0.045691907},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35293645,0.0016122061,0.6149543,0.0038508256,0.00084637245,0.00014841123,0.0009422232,0.0005390219,0.024170207],"genre_scores_gemma":[0.97802573,0.00034227964,0.007406893,0.00012705378,0.00012527998,0.000066085704,0.0001470999,0.00004222774,0.013717194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994636,0.00016615336,0.00001830945,0.00012591062,0.000081831575,0.0001441058],"domain_scores_gemma":[0.9987987,0.00053372455,0.00013699652,0.00006211732,0.00024404228,0.00022427578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008289642,0.00091737375,0.0019979835,0.00073848484,0.0010151225,0.0026239718,0.0027548715,0.0035818524,0.0037458814],"category_scores_gemma":[0.0035266832,0.0010754331,0.0010022541,0.0012599797,0.0017354477,0.0027776158,0.0016768442,0.0017541687,0.00047115682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009112793,0.000053189895,0.0004385694,0.000028165845,0.000022034817,0.00013729627,0.000041185383,0.97566414,0.00069569936,0.019902362,0.0008641118,0.0020620932],"study_design_scores_gemma":[0.000005958232,0.000006648505,0.00004265991,0.0000011350986,0.0000031614854,0.000005198265,0.0000049113833,0.9986908,0.000025964842,0.0011320225,0.000077672405,0.0000038839676],"about_ca_topic_score_codex":0.020836117,"about_ca_topic_score_gemma":0.0058806925,"teacher_disagreement_score":0.020836117,"about_ca_system_score_codex":0.0017056233,"about_ca_system_score_gemma":0.0016986246,"threshold_uncertainty_score":0.0414297},"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":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025283126,0.001340013,0.005514512,0.037582953,0.94766,0.000034968813,0.001695924,0.0005988578,0.005319993],"genre_scores_gemma":[0.040353756,0.0091448035,0.025688777,0.05645005,0.51684755,0.00032101784,0.0054678028,0.0035692295,0.3421571],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99555343,0.0008352089,0.0007720936,0.000677062,0.001677789,0.00048441094],"domain_scores_gemma":[0.9601711,0.0066997274,0.0009705603,0.003658236,0.027093768,0.0014066198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033791955,0.003342257,0.0020466207,0.005334953,0.0041168756,0.0049474644,0.003965753,0.0065272506,0.086747065],"category_scores_gemma":[0.062927,0.0013008844,0.0021216434,0.005692308,0.0029996233,0.0054879705,0.002729719,0.010895074,0.048088007],"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.000034040768,0.000005816773,0.000050927807,0.000112631744,0.000012566255,0.00008081918,0.000030483845,0.0001521636,0.000057719386,0.0067204004,0.988015,0.004727436],"study_design_scores_gemma":[0.000048803384,0.000020871048,0.00077954534,0.00017994808,0.00003477415,0.00038123084,0.000077391385,0.0019235519,0.0006355944,0.019715892,0.9761363,0.00006613042],"about_ca_topic_score_codex":0.019324204,"about_ca_topic_score_gemma":0.018436952,"teacher_disagreement_score":0.086747065,"about_ca_system_score_codex":0.0046737455,"about_ca_system_score_gemma":0.0045765634,"threshold_uncertainty_score":0.29019785},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036251978,0.00011843444,0.9835909,0.00021328815,0.000049089824,0.000035242672,0.00003375777,0.000037439142,0.012296707],"genre_scores_gemma":[0.4638028,0.00087897055,0.5224381,0.00047034133,0.00037642848,0.00036175974,0.0001891759,0.00015497243,0.011327467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827874,0.0007895644,0.00006644219,0.000210499,0.00044880976,0.00020610163],"domain_scores_gemma":[0.9986999,0.00057812355,0.0001303426,0.00024360818,0.00023028557,0.00011769601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021323673,0.0007323215,0.0007337476,0.00083702133,0.0006931621,0.001346193,0.0013132547,0.00075743074,0.004631496],"category_scores_gemma":[0.0034433834,0.00049487443,0.0014590292,0.0010202219,0.0016824172,0.003222043,0.0021216716,0.0028974144,0.0005874651],"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.000009366904,0.000036276786,0.00011600635,0.00003428856,0.000011710438,0.000043503955,0.00007136966,0.032075364,0.0005287725,0.956346,0.0008135333,0.009913725],"study_design_scores_gemma":[0.000008662758,0.00002394779,0.00014482405,0.000018406394,0.000009205528,0.000054156593,0.000024326398,0.18943441,0.0004340102,0.80330014,0.0065379366,0.000009875496],"about_ca_topic_score_codex":0.0014147689,"about_ca_topic_score_gemma":0.0013412711,"teacher_disagreement_score":0.004631496,"about_ca_system_score_codex":0.001625364,"about_ca_system_score_gemma":0.0016566309,"threshold_uncertainty_score":0.01549387},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44741443,0.006136814,0.48075503,0.004473605,0.00038183897,0.00009194933,0.0001815915,0.00015275387,0.060411893],"genre_scores_gemma":[0.97314507,0.0017860236,0.013238525,0.0002477114,0.00029558473,0.000047751702,0.000057423273,0.000028025448,0.011153927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996345,0.00012316743,0.000015681459,0.000048551723,0.00010404757,0.0000739751],"domain_scores_gemma":[0.9990107,0.0004270055,0.00020656515,0.000056226716,0.00015521498,0.00014428094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012142226,0.00043396748,0.0005305973,0.001099563,0.000862704,0.0015023971,0.00078482146,0.0009915517,0.0020190917],"category_scores_gemma":[0.0039575924,0.00024210215,0.00052765995,0.0009989543,0.0015256157,0.0023341407,0.0009977967,0.001070283,0.0002966888],"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.000010646519,0.000011684196,0.00050716946,0.000022787794,0.000004806571,0.00013544207,0.0001531051,0.016133074,0.00046579313,0.9798933,0.00042714586,0.002235078],"study_design_scores_gemma":[0.000021610798,0.000028174964,0.00056189054,0.000032250733,0.000008929941,0.00017241032,0.00014933695,0.3638012,0.00044162027,0.6308466,0.0039101476,0.000025748648],"about_ca_topic_score_codex":0.004031183,"about_ca_topic_score_gemma":0.0022724192,"teacher_disagreement_score":0.004031183,"about_ca_system_score_codex":0.0018644691,"about_ca_system_score_gemma":0.0009329092,"threshold_uncertainty_score":0.013527691},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5262453,0.00034708015,0.46704763,0.00050619245,0.000042669504,0.00007641525,0.00015765474,0.00045425238,0.0051227924],"genre_scores_gemma":[0.9829069,0.00019396997,0.014923399,0.00003152913,0.000024033725,0.000045360957,0.000053099135,0.000037316076,0.0017843851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990588,0.00033436948,0.000032837295,0.00014024289,0.00014180351,0.00029186788],"domain_scores_gemma":[0.99656916,0.002240456,0.0004552552,0.00015163579,0.00027305973,0.00031049442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020426044,0.00096688047,0.0011322282,0.0011138433,0.0008552485,0.0019094169,0.0018072934,0.0011554862,0.0021636763],"category_scores_gemma":[0.006194616,0.00077219814,0.00054054434,0.0018670585,0.0017257779,0.002311402,0.0010084506,0.0006711463,0.00038120194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013002116,0.000041090538,0.00047101732,0.000024288614,0.000019995472,0.00010049576,0.000044728422,0.98266995,0.00197933,0.0106361285,0.00032171435,0.0035613778],"study_design_scores_gemma":[0.000015737087,0.000042146326,0.000109516055,0.0000029709533,0.000008208035,0.000014565728,0.000025572546,0.989017,0.0006590526,0.009991579,0.000106665546,0.0000069266594],"about_ca_topic_score_codex":0.006033571,"about_ca_topic_score_gemma":0.0037132052,"teacher_disagreement_score":0.006033571,"about_ca_system_score_codex":0.0030787268,"about_ca_system_score_gemma":0.0015003299,"threshold_uncertainty_score":0.022337854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9604477,0.00017677214,0.037076753,0.0004438651,0.000020891026,0.000021592754,0.000024578627,0.000069843794,0.0017181319],"genre_scores_gemma":[0.99938095,0.000028255092,0.00047418932,0.000011633383,0.0000040564873,0.000003212602,0.0000048936417,0.000002483745,0.00009027189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984458,0.0006792338,0.00005068308,0.00013712964,0.00025873835,0.00042839634],"domain_scores_gemma":[0.9908003,0.005810206,0.0016371786,0.000293081,0.00087302946,0.0005861142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00260075,0.0007039486,0.000539938,0.0005673084,0.00061951205,0.001059419,0.0005526817,0.0009043295,0.00065788184],"category_scores_gemma":[0.011380106,0.00031887693,0.00035714306,0.00046232628,0.0014939678,0.0011766125,0.000726175,0.0008037091,0.000079199875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002501447,0.00017628653,0.011128559,0.000047226033,0.000078234276,0.0003574033,0.0003637925,0.9533702,0.0063996683,0.021877151,0.00039260057,0.0055586575],"study_design_scores_gemma":[0.000010125429,0.000106216714,0.0018983379,0.0000032921303,0.000016850683,0.000028378923,0.00009130589,0.9941835,0.0005800261,0.0030279586,0.000038469727,0.000015570444],"about_ca_topic_score_codex":0.008613519,"about_ca_topic_score_gemma":0.0037251383,"teacher_disagreement_score":0.008613519,"about_ca_system_score_codex":0.0018210356,"about_ca_system_score_gemma":0.0012329197,"threshold_uncertainty_score":0.017126799},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017812086,0.000727304,0.97711253,0.0005367962,0.000029963103,0.0000504388,0.000038190406,0.00008981335,0.003602738],"genre_scores_gemma":[0.8136426,0.002269662,0.17775865,0.00017601464,0.00021064063,0.00027037613,0.00010015745,0.00010402776,0.0054678693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984542,0.00077707827,0.00006121789,0.00015098233,0.000410105,0.00014637772],"domain_scores_gemma":[0.98910785,0.0094977515,0.00062632276,0.00013029529,0.0004768308,0.00016096931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00586436,0.00096719735,0.0013992045,0.0017408644,0.00074426585,0.0017362292,0.0014606953,0.0013980897,0.0025079085],"category_scores_gemma":[0.013934487,0.0009408054,0.0016438453,0.0019878699,0.0017259569,0.002036902,0.0014345202,0.0019504776,0.00013733473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016333273,0.000017300175,0.00032517262,0.000051054118,0.00002582901,0.000054367818,0.000056749337,0.8792462,0.00021513349,0.114046395,0.00022259663,0.0057229702],"study_design_scores_gemma":[0.0000033326407,0.000009918619,0.00007345303,0.0000064720984,0.0000055666114,0.0000131531115,0.000008487591,0.9709396,0.000057177956,0.028624598,0.0002520881,0.000006176397],"about_ca_topic_score_codex":0.0065008346,"about_ca_topic_score_gemma":0.0039699837,"teacher_disagreement_score":0.0065008346,"about_ca_system_score_codex":0.0024387422,"about_ca_system_score_gemma":0.0019418419,"threshold_uncertainty_score":0.031014085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51594555,0.0009458387,0.4773539,0.00090781983,0.0001991757,0.00013017636,0.00022195523,0.00052799535,0.0037675898],"genre_scores_gemma":[0.9916602,0.00016273484,0.0072674765,0.000026326892,0.000051208743,0.000026959697,0.000050484494,0.0000142021845,0.000740464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947187,0.0019681656,0.0002534856,0.0006180828,0.0014377671,0.0010037184],"domain_scores_gemma":[0.97449976,0.01815883,0.0020515753,0.00085943204,0.0032528997,0.0011775118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01041737,0.0010077073,0.0020922,0.0014536378,0.0011845812,0.004412375,0.0030794616,0.0014401699,0.0021058586],"category_scores_gemma":[0.024698814,0.0007200893,0.0005792522,0.0017115045,0.0022248789,0.004243787,0.0010322974,0.0011356646,0.00022148332],"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.0015030745,0.00026107565,0.0036826716,0.00015205014,0.000092755305,0.00026619976,0.00019746907,0.87026435,0.004055992,0.10633774,0.0009420731,0.012244477],"study_design_scores_gemma":[0.000018624156,0.000036468464,0.00020363399,0.0000028359025,0.000013144546,0.000015936801,0.000013459377,0.9956866,0.00038917453,0.0035771565,0.000034557794,0.000008307058],"about_ca_topic_score_codex":0.009015123,"about_ca_topic_score_gemma":0.005085682,"teacher_disagreement_score":0.01041737,"about_ca_system_score_codex":0.005551286,"about_ca_system_score_gemma":0.0044623152,"threshold_uncertainty_score":0.05509299},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48625445,0.00059091265,0.50319636,0.00070977036,0.00009479665,0.00011924367,0.0001607825,0.00024873725,0.008624961],"genre_scores_gemma":[0.9855338,0.00013845664,0.013360994,0.000028622351,0.000018081664,0.000030221716,0.000029627963,0.000021303986,0.0008388763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989931,0.0003579688,0.000033909117,0.00012811906,0.00016927658,0.00031764887],"domain_scores_gemma":[0.9948171,0.0033501987,0.0009524756,0.0001868955,0.00039227676,0.00030095267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022343253,0.0009213392,0.0008886458,0.0008193518,0.0007293456,0.0017164765,0.0013459316,0.0012021215,0.0012948884],"category_scores_gemma":[0.009392426,0.0004573447,0.0004986338,0.0009573619,0.0011165609,0.0019452197,0.0007126579,0.0010067367,0.00011085319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024569425,0.000021975824,0.00032700924,0.000007468937,0.00000882064,0.00001587402,0.000011834961,0.9924349,0.0004544887,0.005191461,0.00010557604,0.0013960187],"study_design_scores_gemma":[0.000004008212,0.000013671261,0.00010762154,0.0000013330625,0.000005256153,0.0000049446926,0.0000096959375,0.9985331,0.00014704943,0.0010939835,0.000075481184,0.00000382599],"about_ca_topic_score_codex":0.009307818,"about_ca_topic_score_gemma":0.0052315905,"teacher_disagreement_score":0.009307818,"about_ca_system_score_codex":0.003098717,"about_ca_system_score_gemma":0.0022597194,"threshold_uncertainty_score":0.022482812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49921694,0.0007756989,0.4896122,0.00075278204,0.00017151925,0.00013574444,0.00034925947,0.00026886846,0.008717011],"genre_scores_gemma":[0.97463346,0.00037591357,0.020077117,0.00007977242,0.000054390883,0.0000730204,0.000106642285,0.00002542221,0.004574342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990916,0.00022849592,0.0000503474,0.00019051717,0.00017936835,0.00025957177],"domain_scores_gemma":[0.9968144,0.0014807861,0.00071734906,0.00019616281,0.0003597428,0.00043152098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018209422,0.0008316403,0.00085466646,0.00091367296,0.00065378466,0.0020458456,0.0022270563,0.0015428815,0.002191887],"category_scores_gemma":[0.0048207804,0.00063262327,0.0008185113,0.0012026449,0.0014686855,0.0023796763,0.0012342441,0.0013709611,0.00031141227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012290035,0.00007421476,0.0024882457,0.000028207698,0.00002804341,0.00028763813,0.00012963271,0.9537294,0.0015038317,0.03825975,0.00041308845,0.0029350016],"study_design_scores_gemma":[0.000009350678,0.000027169588,0.0001769741,0.000003299489,0.0000074356262,0.000028120563,0.000019207326,0.994709,0.00011042454,0.0046898974,0.00021147887,0.000007579996],"about_ca_topic_score_codex":0.012062367,"about_ca_topic_score_gemma":0.006078919,"teacher_disagreement_score":0.012062367,"about_ca_system_score_codex":0.0026264589,"about_ca_system_score_gemma":0.0014608394,"threshold_uncertainty_score":0.023984313},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055079814,0.00008224207,0.9913886,0.00012997101,0.000038597875,0.00009474584,0.00007373432,0.0018093428,0.00087471993],"genre_scores_gemma":[0.08146564,0.00009643171,0.9157126,0.000115219205,0.000040613028,0.0002796159,0.00024149379,0.00018272141,0.0018656658],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996574,0.000057734516,0.000037126945,0.00008057774,0.00011460656,0.000052453845],"domain_scores_gemma":[0.99912816,0.0004766857,0.00008274929,0.00007516725,0.00019045056,0.000046764097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009989357,0.0010154945,0.0006415818,0.0013605419,0.00088836346,0.0011776406,0.0013763452,0.0013409179,0.0058138026],"category_scores_gemma":[0.0045587295,0.00046577016,0.0005550208,0.0010758754,0.00056647713,0.0011325598,0.0013012103,0.0014716065,0.0024619845],"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.00050128245,0.000264699,0.0038664693,0.00026599056,0.000113084694,0.00038942386,0.00032347703,0.41456416,0.013665426,0.056576617,0.009801652,0.49966767],"study_design_scores_gemma":[0.00010791127,0.00004685943,0.00027098274,0.000014269147,0.00001540907,0.00009355977,0.000023063205,0.97800285,0.0033533797,0.01604234,0.002008801,0.00002058366],"about_ca_topic_score_codex":0.007069292,"about_ca_topic_score_gemma":0.0072730333,"teacher_disagreement_score":0.007069292,"about_ca_system_score_codex":0.0011437834,"about_ca_system_score_gemma":0.0026503052,"threshold_uncertainty_score":0.019449115},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19132797,0.0010074424,0.7824995,0.00037662033,0.000117318166,0.000090189234,0.00013030262,0.00039748676,0.024053177],"genre_scores_gemma":[0.978515,0.00032440524,0.015225455,0.000039141392,0.000046307847,0.000033633754,0.000040894407,0.000043416283,0.005731775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989286,0.0002199386,0.000029686613,0.00009723549,0.0004694525,0.00025512496],"domain_scores_gemma":[0.99834955,0.0006796808,0.0002987464,0.00014937087,0.00038734564,0.00013528537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015144987,0.00039612272,0.0005120062,0.0007731922,0.00051202305,0.0011682081,0.0012234667,0.00048449353,0.0037041283],"category_scores_gemma":[0.003638204,0.0002834255,0.00031757692,0.00060398824,0.0006311009,0.0013729988,0.0007606702,0.00045815608,0.0003317726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034498924,0.000049288064,0.0009935118,0.000100940015,0.00002779268,0.00033242392,0.000089321016,0.75650436,0.00901183,0.21136975,0.0011857384,0.019990034],"study_design_scores_gemma":[0.0000069588127,0.000028055601,0.00012450184,0.000003416353,0.000006137261,0.000039900457,0.000009734056,0.98962677,0.0006823163,0.008847139,0.00062056567,0.0000045244433],"about_ca_topic_score_codex":0.002149888,"about_ca_topic_score_gemma":0.00089260156,"teacher_disagreement_score":0.0037041283,"about_ca_system_score_codex":0.001617322,"about_ca_system_score_gemma":0.0011685665,"threshold_uncertainty_score":0.012391567},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13792619,0.0009689094,0.8386034,0.0025178257,0.0001434174,0.00011131916,0.0001837914,0.00021237199,0.019332822],"genre_scores_gemma":[0.91267097,0.00053952984,0.07790696,0.00023757578,0.0002161259,0.00013090447,0.00023144818,0.00007411163,0.007992474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909675,0.00033432798,0.000025181453,0.0000897669,0.00030733456,0.00014672287],"domain_scores_gemma":[0.99662423,0.002318562,0.00027586854,0.00015296186,0.00047036237,0.00015799628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024722856,0.0005841071,0.00073260773,0.0012820874,0.0008658895,0.002060744,0.0018211397,0.0011426655,0.0031458058],"category_scores_gemma":[0.008909224,0.0004479636,0.00063812867,0.00079519703,0.0016460717,0.0018390976,0.0018268027,0.001696563,0.00024954425],"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.000052649502,0.000054641718,0.000934103,0.000058079004,0.00002077628,0.000070748334,0.00010571855,0.41537154,0.0007764969,0.57133234,0.0020754419,0.009147398],"study_design_scores_gemma":[0.0000073076,0.0000065734566,0.00018543056,0.000005571706,0.000003618252,0.00001012277,0.000012014084,0.92372906,0.00007790588,0.07569446,0.00026290378,0.0000050974613],"about_ca_topic_score_codex":0.006895585,"about_ca_topic_score_gemma":0.0047056694,"teacher_disagreement_score":0.006895585,"about_ca_system_score_codex":0.0031190221,"about_ca_system_score_gemma":0.002735736,"threshold_uncertainty_score":0.022630215},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023957614,0.0005115409,0.96819687,0.00029710625,0.00006412206,0.00008660867,0.00016514279,0.0004932379,0.0062277126],"genre_scores_gemma":[0.43964925,0.00065719715,0.5521448,0.00011262688,0.00009442133,0.00078976323,0.00034404534,0.00031690908,0.005890965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994742,0.00025854362,0.00001918518,0.000040243613,0.00016129547,0.00004652323],"domain_scores_gemma":[0.9967263,0.0024896658,0.00017592899,0.000120274904,0.00042395614,0.00006382351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017553555,0.00088226085,0.0007753441,0.0010934486,0.00074126007,0.0011215439,0.0011645068,0.0012250206,0.003961145],"category_scores_gemma":[0.0078579625,0.00044504038,0.00062402285,0.0008387783,0.0007675842,0.0009925129,0.0007851974,0.0011170704,0.0005059526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003722473,0.00002945297,0.00038930072,0.000063925116,0.000016982369,0.000029451397,0.000031418254,0.9620068,0.00057135103,0.0203628,0.0007108263,0.015750457],"study_design_scores_gemma":[0.0000030290576,0.000002561504,0.000021011736,0.0000029833907,0.0000010971368,0.0000022265135,0.0000020874354,0.99775404,0.00008569465,0.0019669249,0.00015717273,0.0000012194762],"about_ca_topic_score_codex":0.007714839,"about_ca_topic_score_gemma":0.004809618,"teacher_disagreement_score":0.007714839,"about_ca_system_score_codex":0.00130032,"about_ca_system_score_gemma":0.0016814723,"threshold_uncertainty_score":0.015339851},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019804824,0.00049357093,0.97396857,0.00036606056,0.000038716153,0.00004078145,0.00009995979,0.00045700616,0.004730501],"genre_scores_gemma":[0.85163575,0.0013264831,0.14070994,0.00016390254,0.00020429345,0.0003470181,0.0004502867,0.0003632952,0.0047990973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958456,0.0012977854,0.00018144972,0.00040670476,0.0015259789,0.0007425939],"domain_scores_gemma":[0.9796799,0.016280074,0.0009714844,0.00090838206,0.0015360792,0.0006241457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007598372,0.0019509085,0.0019651712,0.002253856,0.001445976,0.0045051044,0.0030134977,0.0026783643,0.003790107],"category_scores_gemma":[0.03713745,0.0013951322,0.0011468071,0.0018967439,0.002099878,0.005441863,0.0025154648,0.0038304632,0.000801577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005890288,0.00003338353,0.00022833137,0.00004539463,0.000019213709,0.00004120123,0.00007290105,0.91380703,0.000628144,0.07974183,0.00054549373,0.0047782008],"study_design_scores_gemma":[0.0000028251284,0.0000035017208,0.000020216612,0.000003997626,0.0000023451355,0.000002738501,0.0000047533963,0.9829184,0.00011686822,0.016812494,0.000108847176,0.0000029289995],"about_ca_topic_score_codex":0.015109922,"about_ca_topic_score_gemma":0.006018839,"teacher_disagreement_score":0.015109922,"about_ca_system_score_codex":0.0054584723,"about_ca_system_score_gemma":0.004351126,"threshold_uncertainty_score":0.040184498},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09120855,0.00068583695,0.9011776,0.00045616998,0.000056743283,0.00009479577,0.0001766477,0.0006754746,0.0054682116],"genre_scores_gemma":[0.92882603,0.00035214116,0.0687109,0.00012964648,0.00005734764,0.000094694755,0.000113820795,0.000097569675,0.0016178191],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731404,0.0008588479,0.00015937089,0.0004047122,0.00067707355,0.0005858245],"domain_scores_gemma":[0.99050283,0.0056145587,0.0017169394,0.0008442658,0.0007709486,0.0005504194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037722117,0.0014434597,0.0013943765,0.00076620036,0.0006389374,0.00188235,0.0016500707,0.0011929668,0.0025819307],"category_scores_gemma":[0.01506347,0.00065827725,0.0007111158,0.00093897176,0.0016580818,0.0019472917,0.0019619733,0.001845864,0.00036858523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019102135,0.00007027658,0.0006189971,0.00009106894,0.000027463235,0.000056043536,0.0000676205,0.9570039,0.0022435628,0.03068787,0.0006118136,0.008330495],"study_design_scores_gemma":[0.000012157182,0.000042187286,0.00009821249,0.000008866741,0.00000432438,0.000013817786,0.000006781349,0.9896365,0.00069393084,0.009324351,0.0001517262,0.00000713603],"about_ca_topic_score_codex":0.0036074936,"about_ca_topic_score_gemma":0.0017108414,"teacher_disagreement_score":0.0037722117,"about_ca_system_score_codex":0.0025885038,"about_ca_system_score_gemma":0.002431498,"threshold_uncertainty_score":0.019949615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58735484,0.0002899527,0.40554535,0.000977117,0.00009051539,0.00014002621,0.0008363301,0.000513231,0.0042526415],"genre_scores_gemma":[0.9730592,0.00028821547,0.022938574,0.000087929344,0.000082528284,0.0001357438,0.0005241768,0.00005282268,0.0028308993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998744,0.000493692,0.00006101584,0.00023627383,0.000242113,0.00022282042],"domain_scores_gemma":[0.9946985,0.0030741848,0.0010248782,0.0003217933,0.0006145872,0.00026607222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002157733,0.00081585563,0.00074887637,0.00093163014,0.0006145405,0.0018732134,0.002277542,0.002306976,0.0021813584],"category_scores_gemma":[0.0110177845,0.00074503187,0.0006765424,0.0015762015,0.0007118728,0.00200299,0.0009017285,0.0019898317,0.0004942149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047406957,0.00007144461,0.0044665146,0.000019562776,0.000028022114,0.000068939495,0.00016654673,0.97662157,0.000587152,0.013939196,0.00052026624,0.003463396],"study_design_scores_gemma":[0.000006246666,0.000014688202,0.000517972,0.000001934044,0.000004391509,0.000011176977,0.000022683458,0.9970202,0.000069459245,0.0021336325,0.00019006178,0.000007575664],"about_ca_topic_score_codex":0.0212085,"about_ca_topic_score_gemma":0.014935147,"teacher_disagreement_score":0.0212085,"about_ca_system_score_codex":0.0019594308,"about_ca_system_score_gemma":0.0013911587,"threshold_uncertainty_score":0.042170107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16543181,0.0028993278,0.78020936,0.0025337732,0.00043796815,0.00012184573,0.0004928249,0.00035811737,0.047514934],"genre_scores_gemma":[0.9008946,0.004791783,0.07105849,0.0012414546,0.0013337256,0.00024517122,0.00041086107,0.00035108812,0.019672869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991503,0.00020600986,0.00003284845,0.00016557526,0.00029782948,0.00014744204],"domain_scores_gemma":[0.99076045,0.0059776963,0.0010186264,0.0005559774,0.0012479548,0.00043934942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033094725,0.00073031127,0.0009912768,0.0019619146,0.0009758747,0.0022624407,0.0019713072,0.0010875429,0.0076213325],"category_scores_gemma":[0.018098662,0.00050197076,0.00078769785,0.0016838129,0.0050747064,0.0054362114,0.0011167825,0.0036430224,0.0017284103],"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.000058212456,0.00009298395,0.0021315592,0.00008505324,0.00001847302,0.00027226875,0.0005692178,0.020865811,0.0038245644,0.95919585,0.0028193982,0.010066607],"study_design_scores_gemma":[0.000034870143,0.00009706504,0.003709153,0.00013160006,0.000035526646,0.0005410839,0.00022803144,0.37216076,0.0030714597,0.61512655,0.0047741565,0.00008969818],"about_ca_topic_score_codex":0.0048880912,"about_ca_topic_score_gemma":0.0025241468,"teacher_disagreement_score":0.0076213325,"about_ca_system_score_codex":0.0023160009,"about_ca_system_score_gemma":0.0012784683,"threshold_uncertainty_score":0.025495827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5799523,0.00020599893,0.4147746,0.000562814,0.000035834168,0.00011607437,0.00017764638,0.0005046529,0.0036701695],"genre_scores_gemma":[0.9873115,0.000051908453,0.012199577,0.000042316737,0.00001810542,0.000052501407,0.0000831466,0.00006190421,0.00017905985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99294347,0.0026533846,0.00036696237,0.0010127118,0.0024252892,0.0005982671],"domain_scores_gemma":[0.88589436,0.07933554,0.01461251,0.012164863,0.006003603,0.0019891213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010794935,0.00056051335,0.0007980726,0.0012276892,0.0008408077,0.0020199334,0.0016337514,0.0012118137,0.0008028295],"category_scores_gemma":[0.0906195,0.0006384459,0.00048948324,0.00087561656,0.0025115795,0.004009105,0.0016091228,0.0019941696,0.00017812467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007296417,0.00027497104,0.051438496,0.00023467885,0.00021972701,0.00051529816,0.0011118368,0.73268235,0.049047932,0.13293742,0.0006842684,0.030123293],"study_design_scores_gemma":[0.00002075895,0.00021653654,0.0061244518,0.000015527834,0.000018094626,0.0002727993,0.00012709039,0.94595575,0.0083114235,0.038456757,0.0004476347,0.00003307002],"about_ca_topic_score_codex":0.0011117804,"about_ca_topic_score_gemma":0.0005422067,"teacher_disagreement_score":0.010794935,"about_ca_system_score_codex":0.0015639679,"about_ca_system_score_gemma":0.0014646456,"threshold_uncertainty_score":0.057089746},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71466684,0.0002488468,0.28066444,0.0001332075,0.000014002619,0.000025679685,0.000052898584,0.0001298312,0.0040642386],"genre_scores_gemma":[0.99616027,0.00005408157,0.0034105552,0.000012059762,0.000015116699,0.00000873635,0.00002503354,0.0000075840503,0.00030656016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994355,0.00012697422,0.00002155126,0.00007327676,0.00025467324,0.00008800341],"domain_scores_gemma":[0.9948827,0.003053248,0.0006554019,0.0003263734,0.00090536854,0.0001769434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014887963,0.00034952257,0.00037149433,0.0008998793,0.00034801319,0.000859823,0.0007387495,0.0004164512,0.00066131196],"category_scores_gemma":[0.009348504,0.0002467861,0.00024677388,0.0005234924,0.00073240005,0.0011266216,0.000698979,0.00045178432,0.00008328944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004038296,0.00017934601,0.019498399,0.000098389224,0.00006953054,0.0010258887,0.0003028713,0.6692756,0.09225603,0.17693746,0.0004692531,0.03948346],"study_design_scores_gemma":[0.0000029190523,0.00001914815,0.0016033958,0.000003156456,0.0000051848756,0.00012457166,0.000019939107,0.98760986,0.0028108861,0.007695643,0.00009542208,0.000009924129],"about_ca_topic_score_codex":0.0010252417,"about_ca_topic_score_gemma":0.0006470534,"teacher_disagreement_score":0.0014887963,"about_ca_system_score_codex":0.0010979453,"about_ca_system_score_gemma":0.00050491217,"threshold_uncertainty_score":0.00796622},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074023984,0.0006025313,0.9034907,0.0014322015,0.00024579477,0.00013720377,0.0002832871,0.0002875104,0.019496832],"genre_scores_gemma":[0.9471519,0.00046138876,0.040857296,0.00026007096,0.00015125859,0.00022556365,0.00012448554,0.000040772007,0.01072715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998398,0.00055045006,0.000093257964,0.00026803085,0.00034626777,0.00034391237],"domain_scores_gemma":[0.9957671,0.002137099,0.0007398606,0.00041061288,0.00052490743,0.0004203286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021437958,0.00096299715,0.0007833279,0.00055673905,0.00042319275,0.002078286,0.0015829395,0.0018519387,0.0036590137],"category_scores_gemma":[0.0072053657,0.00048094068,0.00069468305,0.00049319817,0.0017318865,0.0017032308,0.0018750054,0.0015653736,0.00042707822],"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.00013562973,0.00014083422,0.0009302438,0.00008864736,0.000034344735,0.00030968423,0.00017844199,0.3929633,0.0025869831,0.5863907,0.001646336,0.014594774],"study_design_scores_gemma":[0.000059633407,0.00006230716,0.0002699586,0.00001523011,0.000015292517,0.00005069161,0.000023450462,0.9053873,0.0005707837,0.091652855,0.0018661842,0.000026274594],"about_ca_topic_score_codex":0.0024849891,"about_ca_topic_score_gemma":0.00096694403,"teacher_disagreement_score":0.0036590137,"about_ca_system_score_codex":0.0011978335,"about_ca_system_score_gemma":0.000990984,"threshold_uncertainty_score":0.012240589},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083538376,0.0017406833,0.9052928,0.001419212,0.00014887367,0.00005972581,0.00012482522,0.00020119417,0.007474205],"genre_scores_gemma":[0.92176986,0.0026810605,0.06322049,0.00033120095,0.00018470634,0.00015021647,0.00017348409,0.00008622258,0.011402767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896944,0.00024277743,0.000052677184,0.00019314305,0.00032751285,0.00021457892],"domain_scores_gemma":[0.9958717,0.0024911598,0.00066066626,0.00017876264,0.00054637034,0.00025140427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039234217,0.00087971066,0.0009453137,0.0015194244,0.00074919406,0.0016934768,0.0016287272,0.0012990519,0.0020689524],"category_scores_gemma":[0.013452838,0.0005136369,0.0011404103,0.0009841139,0.0021588472,0.0032555799,0.0017259109,0.0025900602,0.0002523053],"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.000090378795,0.000042888943,0.0009362416,0.0001143162,0.000043792737,0.00016686736,0.0003218423,0.4043153,0.0033611897,0.5782225,0.0011931089,0.011191611],"study_design_scores_gemma":[0.0000069255684,0.000009376381,0.000114794384,0.00000875838,0.0000058121086,0.000021029027,0.000023672086,0.94678706,0.00021659108,0.052443095,0.00035382772,0.0000090344365],"about_ca_topic_score_codex":0.009162788,"about_ca_topic_score_gemma":0.0035828224,"teacher_disagreement_score":0.009162788,"about_ca_system_score_codex":0.0039930213,"about_ca_system_score_gemma":0.001453215,"threshold_uncertainty_score":0.028971493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010125333,0.0002273629,0.9841488,0.00022713728,0.000046337926,0.000037527207,0.00010447353,0.00014897987,0.004933886],"genre_scores_gemma":[0.8298373,0.0014926147,0.15861306,0.00018634283,0.000307617,0.00033788825,0.00020339612,0.00011058519,0.00891111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989214,0.00033909787,0.000050211238,0.00011616268,0.00045799962,0.00011512764],"domain_scores_gemma":[0.9988721,0.00064748287,0.00013754623,0.000107064014,0.00018848883,0.000047338548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016253553,0.00078381365,0.0007477992,0.0006248763,0.0007757103,0.00180756,0.0014226448,0.00079803186,0.0016413877],"category_scores_gemma":[0.0034960334,0.00040774723,0.0007520599,0.00084892317,0.0012467721,0.0022742115,0.0010780401,0.0012775456,0.00031003743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014582281,0.000015960946,0.00018920422,0.000015732778,0.000011154126,0.00006338411,0.000049456004,0.77618694,0.0011944233,0.21906994,0.0003684476,0.0028207467],"study_design_scores_gemma":[0.0000018976923,0.0000034300592,0.00002647471,0.0000016019691,0.0000027911085,0.000007221464,0.000002996845,0.97956043,0.00007857794,0.019952683,0.0003581624,0.0000037049992],"about_ca_topic_score_codex":0.010235299,"about_ca_topic_score_gemma":0.005324419,"teacher_disagreement_score":0.010235299,"about_ca_system_score_codex":0.001567335,"about_ca_system_score_gemma":0.0016628664,"threshold_uncertainty_score":0.02035147},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032248534,0.020923464,0.87971616,0.0017663873,0.0009274491,0.000066835775,0.00007269672,0.00036511096,0.06391338],"genre_scores_gemma":[0.8754444,0.024296153,0.08315267,0.00090596,0.0021248478,0.0001292248,0.000085156666,0.00012473948,0.013736868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931324,0.00028191746,0.000020292518,0.000057634883,0.00025475,0.000072239825],"domain_scores_gemma":[0.99898356,0.00068680436,0.00007258982,0.0000891337,0.00013235868,0.000035515102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082930113,0.00061929337,0.00046667675,0.0005760259,0.0005713658,0.0009118801,0.0006509871,0.0009269111,0.0015942636],"category_scores_gemma":[0.0027189092,0.00025457863,0.00031499786,0.0009465516,0.0016909634,0.0014944631,0.0009630513,0.0010214292,0.00049075537],"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.000093571616,0.000049149625,0.00045770913,0.00016561935,0.00002016635,0.00023386427,0.0001969034,0.21060437,0.00545754,0.67123616,0.0044461526,0.10703883],"study_design_scores_gemma":[0.000011723687,0.00007609279,0.00025679506,0.00007578919,0.000016316637,0.0001662682,0.000040024766,0.46370474,0.0019694963,0.5154514,0.018206129,0.000025236828],"about_ca_topic_score_codex":0.0010229435,"about_ca_topic_score_gemma":0.00048064484,"teacher_disagreement_score":0.0015942636,"about_ca_system_score_codex":0.000980231,"about_ca_system_score_gemma":0.00046431198,"threshold_uncertainty_score":0.007112086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58770746,0.001116925,0.3989453,0.00046673906,0.00008309925,0.00018676944,0.00021816962,0.0016732512,0.009602316],"genre_scores_gemma":[0.9729494,0.00014137359,0.025484404,0.000026692007,0.000028311546,0.000055379376,0.00014918263,0.00004770164,0.0011175218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986518,0.00038893986,0.000053124346,0.0001460565,0.00044170197,0.00031850027],"domain_scores_gemma":[0.9969451,0.0012111148,0.00036191085,0.00037229757,0.0008781725,0.00023149265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021217978,0.0004559822,0.00038980707,0.0007395944,0.00058221235,0.0008616282,0.00065288803,0.00038546434,0.0017945801],"category_scores_gemma":[0.0062928745,0.0002056965,0.00027507002,0.00091105077,0.0004755018,0.0009393906,0.00056024734,0.00042565688,0.0002977134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093499955,0.0002866784,0.006291627,0.00013206202,0.00005965356,0.00009969496,0.00018670893,0.8774154,0.015401614,0.021499572,0.0040276833,0.07366427],"study_design_scores_gemma":[0.000018060115,0.00014659423,0.0009801207,0.0000032130376,0.000009568858,0.000012702237,0.00002041082,0.9946517,0.0018212337,0.002029987,0.00029856953,0.000007838992],"about_ca_topic_score_codex":0.0073604444,"about_ca_topic_score_gemma":0.0031848096,"teacher_disagreement_score":0.0073604444,"about_ca_system_score_codex":0.0017480364,"about_ca_system_score_gemma":0.0018749537,"threshold_uncertainty_score":0.014635205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052387625,0.00034005404,0.9422164,0.00036134702,0.00007116442,0.00008924315,0.00037800107,0.0005622639,0.0035939515],"genre_scores_gemma":[0.92838013,0.00079433393,0.062464993,0.00007954088,0.00010614329,0.0003586315,0.00083548296,0.00011761794,0.0068631726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901736,0.0003278983,0.00005745315,0.0002457166,0.00025536623,0.00009628183],"domain_scores_gemma":[0.9985781,0.0008490567,0.00020142742,0.00007315248,0.00024848143,0.000049818238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012586359,0.0011950333,0.0011838665,0.0013814488,0.0005031768,0.0017507485,0.001932442,0.0013796568,0.001956044],"category_scores_gemma":[0.0047208196,0.0007124093,0.0012014237,0.0011833502,0.00058974815,0.00236222,0.0010007899,0.0014670492,0.0006981422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029003708,0.000030200645,0.0012577274,0.000025594363,0.000043352527,0.000048246595,0.000070882874,0.9763609,0.0005104529,0.0152163915,0.00035333162,0.006053881],"study_design_scores_gemma":[0.0000021934106,0.000005000296,0.00013227863,0.0000015390475,0.0000042115344,0.000005482446,0.000003364822,0.99760276,0.000047092093,0.0020418258,0.00015001775,0.000004229426],"about_ca_topic_score_codex":0.010864117,"about_ca_topic_score_gemma":0.0059221946,"teacher_disagreement_score":0.010864117,"about_ca_system_score_codex":0.0012288942,"about_ca_system_score_gemma":0.00063527114,"threshold_uncertainty_score":0.021601737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029481573,0.004447651,0.91665924,0.0018054356,0.0002984373,0.00022590115,0.00090735924,0.00096374424,0.045210544],"genre_scores_gemma":[0.7490431,0.010845782,0.21607856,0.0004685847,0.00038314715,0.00081406033,0.0014642483,0.0003445936,0.020557893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988268,0.0004786026,0.00008716042,0.00016849712,0.0003023245,0.00013661105],"domain_scores_gemma":[0.99898916,0.00055902253,0.00010402702,0.00009403796,0.00019296826,0.00006080743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012431554,0.00086944783,0.0010005349,0.0007495261,0.00078851264,0.0029466334,0.0023196859,0.0018578662,0.004677203],"category_scores_gemma":[0.0034531197,0.00046267878,0.0008841854,0.0012819598,0.0008680335,0.001645195,0.0013310412,0.001251997,0.0009520561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015645812,0.000012353812,0.0003843653,0.0000561129,0.00001862144,0.00004909663,0.00006142166,0.9454856,0.00034553267,0.046435785,0.000958461,0.006177013],"study_design_scores_gemma":[0.000013781569,0.000015072253,0.00022655292,0.000031586453,0.000016482445,0.000034734963,0.00003754914,0.9612389,0.0003666379,0.027687458,0.010312253,0.000018973926],"about_ca_topic_score_codex":0.019192498,"about_ca_topic_score_gemma":0.0064258617,"teacher_disagreement_score":0.019192498,"about_ca_system_score_codex":0.0020636378,"about_ca_system_score_gemma":0.002677254,"threshold_uncertainty_score":0.038161576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98392594,0.0003059148,0.013094793,0.0003264951,0.000025778558,0.000017225957,0.00003454652,0.00010571517,0.0021635657],"genre_scores_gemma":[0.9992405,0.000035612637,0.00052320684,0.000013940138,0.000010531252,0.0000024240899,0.000009112145,0.0000055674923,0.00015912829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842453,0.00044914166,0.000042516192,0.0002136604,0.00030351226,0.000566662],"domain_scores_gemma":[0.9854182,0.009193121,0.0027333726,0.00053246,0.0007366921,0.0013862676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029701893,0.00070189574,0.0006438553,0.0005723946,0.0005714856,0.0016331552,0.0008925743,0.0013667464,0.0017813568],"category_scores_gemma":[0.018551253,0.00027441778,0.00026384008,0.00060700584,0.0014948223,0.001654028,0.0012110405,0.0015020102,0.00023184242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026229487,0.0012842813,0.048994604,0.00013780409,0.0001564163,0.00071591407,0.00048221447,0.85236144,0.027036926,0.012361413,0.0014402244,0.052405883],"study_design_scores_gemma":[0.000066277134,0.0010913938,0.019573476,0.00001783806,0.00008423416,0.00020341566,0.0004448075,0.9635252,0.009188646,0.0054502436,0.000296162,0.000058370784],"about_ca_topic_score_codex":0.0039948802,"about_ca_topic_score_gemma":0.0024820417,"teacher_disagreement_score":0.0039948802,"about_ca_system_score_codex":0.0011959415,"about_ca_system_score_gemma":0.00075423636,"threshold_uncertainty_score":0.01570803},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06149156,0.00045905015,0.92853385,0.0007934883,0.0000888399,0.00008346453,0.000089035835,0.00007839585,0.008382353],"genre_scores_gemma":[0.95438564,0.0004946573,0.03879979,0.00017268278,0.00012316296,0.0001604633,0.000056995803,0.000043473323,0.0057630846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855524,0.00066747254,0.000047398462,0.00021878068,0.00030071588,0.00021037686],"domain_scores_gemma":[0.9975489,0.001204815,0.00042220566,0.00018604787,0.00035588356,0.00028217028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035425473,0.0012037468,0.0012551999,0.0007481,0.0004662975,0.0022158013,0.00213072,0.0016036272,0.002612522],"category_scores_gemma":[0.008426083,0.000663475,0.0012090442,0.00067781727,0.0035220846,0.003187178,0.0015097945,0.0023682455,0.00022983168],"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.0000616872,0.000070235925,0.00035752967,0.00006489879,0.000037589743,0.00011233564,0.000103184815,0.3048099,0.0023814489,0.68798023,0.0006435424,0.0033773826],"study_design_scores_gemma":[0.000018421086,0.00004123667,0.00013115564,0.000011312659,0.000009848819,0.000020489464,0.000012294681,0.8950917,0.0004272031,0.10383932,0.000381968,0.00001504822],"about_ca_topic_score_codex":0.0024089336,"about_ca_topic_score_gemma":0.0011616334,"teacher_disagreement_score":0.0035425473,"about_ca_system_score_codex":0.0027288585,"about_ca_system_score_gemma":0.0015856284,"threshold_uncertainty_score":0.019799411},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044636812,0.001092523,0.9435098,0.0013066079,0.00018096762,0.00008425862,0.00035223528,0.0002729667,0.008563808],"genre_scores_gemma":[0.9133075,0.002258493,0.056949012,0.00047634644,0.0005440825,0.0003104855,0.00080411835,0.00030379594,0.025046164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991542,0.00024337086,0.00004167255,0.00013792218,0.00021025527,0.0002125913],"domain_scores_gemma":[0.99546474,0.0027107703,0.00044478616,0.0002493811,0.00077855896,0.00035179977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018751196,0.0015539556,0.0019969807,0.0011720591,0.0010799242,0.0025753998,0.0020048611,0.0024364672,0.006697843],"category_scores_gemma":[0.010196216,0.00090154295,0.0016869925,0.0010714199,0.0020625512,0.004906183,0.0022160544,0.0025463714,0.0009276541],"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.00020795535,0.000094017065,0.0007292012,0.0002246631,0.00006813213,0.000299386,0.00030803293,0.4704684,0.0048090233,0.5062466,0.005846135,0.010698399],"study_design_scores_gemma":[0.000008080249,0.000011653649,0.000073843155,0.0000064829737,0.0000062208533,0.000027143446,0.0000143627785,0.93747354,0.00014811645,0.0619781,0.00023911223,0.000013360758],"about_ca_topic_score_codex":0.010462212,"about_ca_topic_score_gemma":0.003870604,"teacher_disagreement_score":0.010462212,"about_ca_system_score_codex":0.0016562926,"about_ca_system_score_gemma":0.0021482746,"threshold_uncertainty_score":0.022406459},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014386203,0.00006265477,0.995375,0.00013849279,0.00004796272,0.000024020535,0.000046649966,0.00013444769,0.0027322304],"genre_scores_gemma":[0.30389902,0.0008116656,0.6809066,0.000473295,0.0005779597,0.0004295787,0.00023535448,0.000261992,0.012404523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705434,0.0007832833,0.00017900497,0.00041114897,0.00130749,0.00026482233],"domain_scores_gemma":[0.9978241,0.0010903283,0.00019997275,0.00032903877,0.00041471727,0.00014197119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050286474,0.0010263876,0.0009802207,0.000930211,0.0013566472,0.003619874,0.0026017197,0.0015016977,0.0033017818],"category_scores_gemma":[0.0064038425,0.0006676233,0.0015099276,0.0012748119,0.0024700768,0.004963274,0.0027082954,0.0038481222,0.001017343],"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.000016622342,0.000020385241,0.00006766065,0.000018966897,0.000009331904,0.00007328472,0.00006542978,0.043523192,0.00078747224,0.94847083,0.00075503415,0.006191867],"study_design_scores_gemma":[0.00001255064,0.00003963,0.00006587363,0.00001558527,0.000023286699,0.00010111182,0.0000163465,0.4989048,0.001168439,0.49135387,0.008271929,0.00002656256],"about_ca_topic_score_codex":0.002056885,"about_ca_topic_score_gemma":0.0016802201,"teacher_disagreement_score":0.0050286474,"about_ca_system_score_codex":0.0021346454,"about_ca_system_score_gemma":0.0025635944,"threshold_uncertainty_score":0.02659434},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068114754,0.0008955317,0.9853909,0.00041933314,0.000081639264,0.000044087305,0.00010515029,0.00029633316,0.0059556076],"genre_scores_gemma":[0.19712698,0.0030421314,0.7874982,0.00027532873,0.00021151212,0.00052994775,0.0005145279,0.0002550737,0.010546243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963963,0.00015494712,0.000017014001,0.00003077273,0.00012953962,0.00002811978],"domain_scores_gemma":[0.9989292,0.0007430532,0.00007793881,0.00009873043,0.00012617714,0.00002493907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010556258,0.0006566134,0.0005036185,0.00083362625,0.00043569994,0.00087323657,0.0011481489,0.0010450965,0.004490469],"category_scores_gemma":[0.003132363,0.00031476968,0.0006425976,0.0010936065,0.00060366996,0.0012900911,0.00082857325,0.0015396541,0.0012704114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033706867,0.00012459554,0.00097609987,0.00020156094,0.000053508713,0.00012763687,0.00007851714,0.58290267,0.002106786,0.3242568,0.0045964983,0.08454158],"study_design_scores_gemma":[0.0000054655134,0.0000033496374,0.000067752524,0.000009744112,0.0000023320167,0.000011986707,0.0000053191557,0.9635465,0.0002546863,0.03458052,0.001507703,0.0000046096543],"about_ca_topic_score_codex":0.0030291148,"about_ca_topic_score_gemma":0.0034976152,"teacher_disagreement_score":0.004490469,"about_ca_system_score_codex":0.0007667175,"about_ca_system_score_gemma":0.0011371581,"threshold_uncertainty_score":0.015022099},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085778624,0.0011884908,0.8998114,0.002983156,0.00010211066,0.0000574785,0.00012770796,0.00016794726,0.009783034],"genre_scores_gemma":[0.9599491,0.00076897227,0.037368976,0.00030796125,0.00014945984,0.000059487145,0.000037356764,0.00007817596,0.0012805777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704,0.0012968895,0.00011716782,0.0003605617,0.0008058777,0.00037949634],"domain_scores_gemma":[0.98175216,0.014576884,0.0017256109,0.00086437276,0.0007551999,0.0003256225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007034788,0.0009537439,0.0015484461,0.0007848241,0.00072186923,0.0027313058,0.002373097,0.002520442,0.0016974588],"category_scores_gemma":[0.027262816,0.00084595126,0.00087799353,0.0011967466,0.00343044,0.0049812463,0.0017378632,0.0036038172,0.00014702702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003746943,0.000022211487,0.0004230397,0.00007604435,0.00003844039,0.00011098375,0.00012946117,0.8070153,0.0006266125,0.18305075,0.0005007164,0.007969031],"study_design_scores_gemma":[0.000012330901,0.000036208814,0.00020164304,0.000023700573,0.000011250006,0.000049822367,0.00006330697,0.7716618,0.00045572655,0.22691207,0.00054942287,0.000022718377],"about_ca_topic_score_codex":0.0022111603,"about_ca_topic_score_gemma":0.0011617518,"teacher_disagreement_score":0.007034788,"about_ca_system_score_codex":0.0021075315,"about_ca_system_score_gemma":0.0015658947,"threshold_uncertainty_score":0.037203968},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40011364,0.0012833717,0.5409993,0.0049779,0.0003948084,0.00034017282,0.0031254129,0.0011737266,0.047591727],"genre_scores_gemma":[0.9479225,0.0006019454,0.009580449,0.00019341304,0.00016952971,0.0001998238,0.000716239,0.00012676438,0.040489357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858654,0.00042124913,0.000045398618,0.0002960664,0.00017201235,0.00047875725],"domain_scores_gemma":[0.9934977,0.0040532225,0.0006953742,0.0003223002,0.0006196984,0.0008117825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024880772,0.0011167321,0.0021008493,0.0014531999,0.0016182769,0.0046588434,0.003929257,0.0041101673,0.021985441],"category_scores_gemma":[0.007849937,0.001850544,0.0013462623,0.002343459,0.0026178814,0.0042940266,0.0017318644,0.00330192,0.0022486954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026385539,0.00013676722,0.0012532007,0.000034986286,0.000042636355,0.00024123024,0.00017446313,0.84320474,0.0006138809,0.1485328,0.0028604816,0.0026409882],"study_design_scores_gemma":[0.000042358184,0.000021803457,0.00024303008,0.000007454058,0.000019801524,0.000019487168,0.00003191636,0.97976685,0.00007862802,0.019382464,0.0003599678,0.000026278605],"about_ca_topic_score_codex":0.043927033,"about_ca_topic_score_gemma":0.023714827,"teacher_disagreement_score":0.043927033,"about_ca_system_score_codex":0.00400668,"about_ca_system_score_gemma":0.0030284738,"threshold_uncertainty_score":0.08734274},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05295368,0.00021192219,0.94059205,0.00016006173,0.00003475424,0.00002215701,0.00006515314,0.0005165397,0.0054437052],"genre_scores_gemma":[0.78123134,0.0004031008,0.21360964,0.00005180378,0.0000657285,0.000084075735,0.000115375595,0.00018011629,0.004258811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995421,0.00014717894,0.000026084732,0.00003584182,0.00018710998,0.00006169468],"domain_scores_gemma":[0.9983165,0.0012899099,0.00012318688,0.00010568957,0.000115143324,0.000049485086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010443118,0.00045638747,0.0005593555,0.0008813387,0.0005677406,0.0016117694,0.0009030879,0.0004941028,0.0027800708],"category_scores_gemma":[0.0065344158,0.00036692416,0.00047691574,0.00095317705,0.0011197297,0.002050004,0.0011694228,0.0009755317,0.00044906858],"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.00008972844,0.000028086519,0.0004883539,0.0000588408,0.000012836022,0.00015837897,0.00024737185,0.29753125,0.0023845464,0.67073214,0.0007399795,0.027528409],"study_design_scores_gemma":[0.000011402576,0.000009788343,0.00004615054,0.000007745196,0.0000032051478,0.000014280855,0.000017437167,0.8670212,0.00095820136,0.13131453,0.00059028144,0.000005822394],"about_ca_topic_score_codex":0.001944631,"about_ca_topic_score_gemma":0.001983085,"teacher_disagreement_score":0.0027800708,"about_ca_system_score_codex":0.0011616107,"about_ca_system_score_gemma":0.0009222975,"threshold_uncertainty_score":0.009300292},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35848334,0.0006311519,0.63285136,0.00094872346,0.00008904595,0.000072533505,0.00009662684,0.00037924066,0.006447967],"genre_scores_gemma":[0.9916332,0.00014140287,0.0069732512,0.00004644934,0.000026914293,0.000032400374,0.00002140801,0.000021292846,0.001103637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989618,0.0004280344,0.000047269215,0.00018099195,0.0002099417,0.00017189315],"domain_scores_gemma":[0.99572146,0.002446542,0.00073354825,0.0002485663,0.00046949013,0.0003803755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002523962,0.0007392992,0.0009315698,0.0005718022,0.00064591016,0.0014553784,0.0015321304,0.00082707335,0.0016098729],"category_scores_gemma":[0.00890612,0.0003560221,0.0005540688,0.00043227465,0.0028348404,0.0017119999,0.0013718624,0.0011937062,0.00015001194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001627371,0.00012715855,0.0012547957,0.00007697662,0.00004491681,0.00017722114,0.00019886573,0.7494355,0.0057982723,0.23585935,0.0009065717,0.0059577445],"study_design_scores_gemma":[0.000021712309,0.000033165306,0.00021149406,0.0000029231946,0.000006342731,0.00001247028,0.00002052769,0.9735555,0.00031136125,0.025710076,0.00010597848,0.000008430977],"about_ca_topic_score_codex":0.0040040817,"about_ca_topic_score_gemma":0.001453878,"teacher_disagreement_score":0.0040040817,"about_ca_system_score_codex":0.0018768472,"about_ca_system_score_gemma":0.0008832752,"threshold_uncertainty_score":0.013617516},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044280443,0.00064437767,0.9482256,0.00034509855,0.00007561354,0.000036257396,0.0001889779,0.000329163,0.005874416],"genre_scores_gemma":[0.9222415,0.0007357017,0.06577996,0.00012486876,0.00011391961,0.00017497093,0.00043121484,0.00018006052,0.010217836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993411,0.00022097149,0.00002385575,0.0000858574,0.00019477673,0.00013343996],"domain_scores_gemma":[0.9983406,0.00092544337,0.00016916683,0.00013352596,0.00030273662,0.0001285631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012381762,0.0005885325,0.0010709715,0.0008747052,0.0005781179,0.0012541936,0.0018521318,0.00095814344,0.0044466695],"category_scores_gemma":[0.0051095826,0.00055713055,0.0009736699,0.00083155785,0.0008546371,0.0019155635,0.0009990161,0.0013854112,0.00054446206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042896245,0.000017483184,0.0006327037,0.000032488108,0.000022763195,0.000069363174,0.000053208616,0.89352846,0.00064777734,0.09947165,0.0008510781,0.0046301605],"study_design_scores_gemma":[0.0000013674437,0.000001719999,0.000033477685,0.0000014694011,0.0000012620246,0.0000038835483,0.0000027100239,0.9913657,0.00003473604,0.008434312,0.000117665266,0.000001692616],"about_ca_topic_score_codex":0.016216278,"about_ca_topic_score_gemma":0.00804027,"teacher_disagreement_score":0.016216278,"about_ca_system_score_codex":0.0021238613,"about_ca_system_score_gemma":0.001534986,"threshold_uncertainty_score":0.03224379},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8348222,0.0005171694,0.15841141,0.0012866517,0.00013275335,0.00006912909,0.0002676362,0.00040285994,0.0040901857],"genre_scores_gemma":[0.9943445,0.00009276602,0.0037264912,0.000085920066,0.00004657381,0.000026010015,0.00008591196,0.000038391656,0.0015534267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815935,0.00046812478,0.000083712956,0.00033398435,0.0005324696,0.00042227207],"domain_scores_gemma":[0.9855952,0.0072100246,0.0031946287,0.0012150822,0.0015628979,0.001222179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006673583,0.0006097151,0.0013870847,0.0015422564,0.0008003539,0.0018906371,0.0026557106,0.0012544899,0.0024627515],"category_scores_gemma":[0.022871217,0.0006381244,0.00093674543,0.0010761941,0.002556474,0.0018289979,0.0013351922,0.0017936919,0.00035549994],"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.00067733735,0.00031927213,0.022272129,0.00015049538,0.00022603087,0.0011767582,0.0006484447,0.6230088,0.0062645413,0.32244936,0.004956397,0.017850455],"study_design_scores_gemma":[0.00004835122,0.000075566146,0.002921303,0.000013772936,0.000024108806,0.000079585356,0.00006844127,0.94117004,0.000750219,0.054515596,0.00029022855,0.0000428092],"about_ca_topic_score_codex":0.015259416,"about_ca_topic_score_gemma":0.009010681,"teacher_disagreement_score":0.015259416,"about_ca_system_score_codex":0.00366319,"about_ca_system_score_gemma":0.0018530689,"threshold_uncertainty_score":0.035293758},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02313707,0.0005079771,0.9712775,0.001229552,0.000060244864,0.000056921584,0.00016224096,0.00011649782,0.0034520326],"genre_scores_gemma":[0.80629164,0.0011540294,0.18631554,0.00031224996,0.00030594095,0.0003264397,0.00026142836,0.00011933502,0.004913424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984754,0.0006453071,0.000051409057,0.0002669613,0.00030906242,0.0002517903],"domain_scores_gemma":[0.9961588,0.0028711578,0.00042711638,0.000085440144,0.0002646228,0.00019298425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023522535,0.0011184227,0.0015439527,0.0010022856,0.00073588727,0.0017441896,0.0018637417,0.0017422537,0.0024325554],"category_scores_gemma":[0.0061998586,0.0011991588,0.0011159271,0.0014180561,0.0012767117,0.0019502948,0.0010316721,0.0015601201,0.00017498192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017736658,0.000007788572,0.00012723968,0.00001943836,0.000015899479,0.000024768276,0.000014906181,0.98407656,0.00011626922,0.012945486,0.00027006297,0.0023638406],"study_design_scores_gemma":[0.0000077610375,0.000009793791,0.000077242024,0.0000051819948,0.0000068066292,0.000007756228,0.000008877231,0.9884327,0.00008553713,0.011109786,0.0002401835,0.000008310694],"about_ca_topic_score_codex":0.013893093,"about_ca_topic_score_gemma":0.0071386914,"teacher_disagreement_score":0.013893093,"about_ca_system_score_codex":0.0025687597,"about_ca_system_score_gemma":0.0027622182,"threshold_uncertainty_score":0.027624488},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32077464,0.00019819746,0.6740669,0.0003682253,0.000023179491,0.000035396344,0.00006217373,0.00035254666,0.0041186903],"genre_scores_gemma":[0.9482935,0.000113673166,0.050055876,0.00003943838,0.000020016572,0.000021660937,0.00004857489,0.00004477234,0.0013624842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998072,0.00006474635,0.0000073399106,0.000017431132,0.00007427993,0.000029013718],"domain_scores_gemma":[0.99820435,0.00125299,0.00017633142,0.00009050642,0.0002272148,0.000048616537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011270575,0.00022353524,0.0002116447,0.0004937076,0.00029731658,0.00069639256,0.0007034088,0.0003871643,0.0010040671],"category_scores_gemma":[0.004947617,0.00020525293,0.00029230997,0.00042109535,0.0007826527,0.0009515891,0.00039631687,0.0006401022,0.00014019133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016706703,0.000078522,0.005879372,0.00005339091,0.000019799092,0.00012492927,0.0003118645,0.88614494,0.0080619175,0.07334086,0.0006532281,0.025164055],"study_design_scores_gemma":[0.000004983799,0.0000061117958,0.00016655789,0.0000019198046,0.0000013418331,0.000007902178,0.000010844565,0.9965528,0.0007042467,0.002463197,0.00007674149,0.0000033556948],"about_ca_topic_score_codex":0.008478194,"about_ca_topic_score_gemma":0.004232988,"teacher_disagreement_score":0.008478194,"about_ca_system_score_codex":0.0011347932,"about_ca_system_score_gemma":0.0011482752,"threshold_uncertainty_score":0.016857684},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42660353,0.00035383066,0.5671524,0.0010541528,0.00007428221,0.00008111624,0.00011343841,0.0004031452,0.004164048],"genre_scores_gemma":[0.9878984,0.000117083444,0.011161435,0.00003840448,0.0000181171,0.000039180024,0.000022620365,0.000023943645,0.00068083993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887043,0.00040067962,0.000052596617,0.00016664191,0.00016462179,0.00034495434],"domain_scores_gemma":[0.9967303,0.0018203916,0.000541061,0.00032392668,0.00021371956,0.00037053117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029823042,0.0009811751,0.0009267936,0.0004777575,0.00087816926,0.0012797286,0.0016297075,0.0012419358,0.001736931],"category_scores_gemma":[0.009139747,0.00040308712,0.0005068161,0.0008950428,0.0015290006,0.002268087,0.0016229035,0.0011040043,0.00019800176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079869424,0.000017881459,0.00035276744,0.0000177614,0.000012876389,0.00009004496,0.000064324864,0.9828992,0.0013348858,0.010785767,0.00020588373,0.004138738],"study_design_scores_gemma":[0.00002656774,0.0000580357,0.00027732895,0.0000070726837,0.000010085843,0.000028898146,0.000076025746,0.9755704,0.0008021302,0.022825373,0.0003026694,0.000015495702],"about_ca_topic_score_codex":0.005845392,"about_ca_topic_score_gemma":0.0031446426,"teacher_disagreement_score":0.005845392,"about_ca_system_score_codex":0.0013558142,"about_ca_system_score_gemma":0.0014292601,"threshold_uncertainty_score":0.015772104},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016394401,0.30213094,0.021207903,0.07662274,0.0076291705,0.00016496822,0.0035334167,0.000540229,0.57177633],"genre_scores_gemma":[0.26188663,0.443794,0.018134825,0.014510455,0.0038834536,0.0001450381,0.0014779727,0.00041686784,0.2557507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9942017,0.00056085055,0.00025091736,0.0005501189,0.0034799667,0.00095641206],"domain_scores_gemma":[0.9882885,0.0022942491,0.00027969514,0.00027002653,0.0080313645,0.0008362243],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0035113117,0.00095393514,0.00086994126,0.008060314,0.009539496,0.006397628,0.0016571,0.0019918971,0.017129658],"category_scores_gemma":[0.011429551,0.0006947158,0.00063940254,0.015763262,0.008473473,0.0031745892,0.0020927566,0.0033496495,0.002848166],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00014878095,0.000082957115,0.0025894884,0.0008726498,0.00003624073,0.00045473923,0.0034252992,0.0046878518,0.00056172005,0.5995328,0.17603342,0.21157408],"study_design_scores_gemma":[0.0000116620895,0.000022618011,0.0037946198,0.00088804646,0.000023940467,0.000103476545,0.0007543253,0.0013950622,0.00043552788,0.028282993,0.9642032,0.00008454994],"about_ca_topic_score_codex":0.979498,"about_ca_topic_score_gemma":0.96733475,"teacher_disagreement_score":0.9904605,"about_ca_system_score_codex":0.1774264,"about_ca_system_score_gemma":0.19612046,"threshold_uncertainty_score":0.9540688},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039321864,0.000597415,0.98723793,0.0008003828,0.00025815074,0.000022706054,0.00009298798,0.0001615671,0.0068967184],"genre_scores_gemma":[0.5370015,0.0036696843,0.4300331,0.001363507,0.0020071196,0.000567677,0.0005173002,0.00052585383,0.024314294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974322,0.0013845218,0.00010574671,0.00029194623,0.00061722076,0.00016840473],"domain_scores_gemma":[0.99421245,0.0037586559,0.0004256311,0.0009303733,0.00047598284,0.0001969744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048287017,0.0013465168,0.0013068445,0.0015141404,0.000924043,0.0021530085,0.0023640888,0.0026124835,0.007112345],"category_scores_gemma":[0.012752888,0.0006917524,0.00200324,0.0017292612,0.003377338,0.006917537,0.0030780022,0.005548391,0.0016306001],"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.000007733167,0.0000074088816,0.00006280426,0.000023351298,0.000009028168,0.000041771913,0.000037383124,0.006505814,0.0002498778,0.989705,0.00063433294,0.0027153948],"study_design_scores_gemma":[0.00001466211,0.000030917996,0.000059145248,0.000032374755,0.000011719312,0.00007119435,0.000012126324,0.17298019,0.0003309072,0.82031,0.0061267433,0.000020076443],"about_ca_topic_score_codex":0.0014870401,"about_ca_topic_score_gemma":0.00090878445,"teacher_disagreement_score":0.007112345,"about_ca_system_score_codex":0.0014487844,"about_ca_system_score_gemma":0.0018714073,"threshold_uncertainty_score":0.025536954},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10436509,0.0007763467,0.8838473,0.00066178344,0.00011476248,0.000076856195,0.000105544634,0.00026607735,0.0097862175],"genre_scores_gemma":[0.8977806,0.0006298463,0.09351185,0.00019133442,0.00016841541,0.00014782259,0.00029826036,0.00026730125,0.0070044855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974443,0.001001785,0.000113386675,0.00023060001,0.00073876575,0.00047118324],"domain_scores_gemma":[0.9890681,0.006231614,0.0009247405,0.0008184774,0.0021264073,0.00083064893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055772085,0.0010658203,0.0011778498,0.0025188916,0.0011604511,0.0034819532,0.0012453722,0.0009937249,0.0026376948],"category_scores_gemma":[0.02430573,0.0007302757,0.0010072341,0.0015120086,0.0021426834,0.0050595496,0.0021239736,0.0019201209,0.0004100435],"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.0002285785,0.00009812277,0.002201179,0.000086179636,0.000037693753,0.00010554117,0.00042191293,0.11740945,0.00462244,0.84921277,0.002694157,0.022881996],"study_design_scores_gemma":[0.000009369034,0.000021431295,0.00042808056,0.000019330197,0.000014111261,0.000025335265,0.000053092153,0.6973086,0.0010392918,0.30051604,0.00055136235,0.0000139256745],"about_ca_topic_score_codex":0.0046885824,"about_ca_topic_score_gemma":0.0022767824,"teacher_disagreement_score":0.0055772085,"about_ca_system_score_codex":0.002406833,"about_ca_system_score_gemma":0.0019294461,"threshold_uncertainty_score":0.029495418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7869986,0.0010942633,0.19524854,0.0003957622,0.000050295082,0.000052513467,0.0000707503,0.0002708156,0.015818385],"genre_scores_gemma":[0.99685234,0.00018825468,0.0022111556,0.000020034782,0.00002035803,0.000007052024,0.000018447861,0.00001577526,0.00066671154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988967,0.00038753555,0.000015203017,0.000069814996,0.00039381033,0.00023692645],"domain_scores_gemma":[0.99733377,0.0017540161,0.00030853538,0.0001239925,0.00034932312,0.00013047589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013319834,0.0009569233,0.0004564725,0.0005872171,0.00034939346,0.0012622145,0.00049548305,0.00051170524,0.001951589],"category_scores_gemma":[0.006003288,0.00023454403,0.00026650558,0.00049846293,0.0008912656,0.0010458117,0.0005623102,0.00067622814,0.00018623767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002385753,0.00009080963,0.0024268883,0.00007222818,0.0000584276,0.00012671352,0.00010810024,0.9327735,0.016883185,0.0315337,0.00041428843,0.015273589],"study_design_scores_gemma":[0.000004023584,0.00007664066,0.0007605306,0.000004919325,0.000010584832,0.000027557375,0.00002255065,0.9956214,0.001273988,0.002063767,0.00012888215,0.0000051911575],"about_ca_topic_score_codex":0.004630406,"about_ca_topic_score_gemma":0.0017389279,"teacher_disagreement_score":0.004630406,"about_ca_system_score_codex":0.00162219,"about_ca_system_score_gemma":0.0006849297,"threshold_uncertainty_score":0.011769831},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97590464,0.0003977836,0.021727672,0.0003360988,0.000034222365,0.000028853128,0.000116759926,0.00018205382,0.0012718772],"genre_scores_gemma":[0.99893266,0.00008145013,0.0006304657,0.000017068513,0.000013072961,0.000010849903,0.000030007981,0.0000069811013,0.0002774955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792945,0.0005837094,0.00009115499,0.0002506632,0.00042380858,0.00072119676],"domain_scores_gemma":[0.9857355,0.009803788,0.0018768001,0.0006282133,0.0011229058,0.00083273323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003420317,0.00095657184,0.0014540774,0.0011637637,0.00086687837,0.0016354666,0.0018359718,0.0019073117,0.0010366644],"category_scores_gemma":[0.010986985,0.0006441302,0.00066427863,0.0009856644,0.0015238973,0.0020395827,0.00092330377,0.0011193526,0.00013284088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063214544,0.00016688528,0.0059710336,0.00008344769,0.00010519642,0.00023127385,0.00026842335,0.9764142,0.0041599227,0.0076033343,0.00054609106,0.003817986],"study_design_scores_gemma":[0.00002539737,0.000083804094,0.0010872943,0.0000033755337,0.0000245772,0.000022371372,0.000026057885,0.99598455,0.00052386743,0.0021689169,0.00003200028,0.000017803111],"about_ca_topic_score_codex":0.012385727,"about_ca_topic_score_gemma":0.006338006,"teacher_disagreement_score":0.012385727,"about_ca_system_score_codex":0.0029156613,"about_ca_system_score_gemma":0.0015332067,"threshold_uncertainty_score":0.024627268},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13954355,0.0010908894,0.84822685,0.002724072,0.000103948914,0.00014256124,0.00030493425,0.00021149713,0.007651683],"genre_scores_gemma":[0.95645916,0.0011904262,0.032055106,0.00024679178,0.00018002148,0.00017685333,0.00019468194,0.00007954317,0.009417356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963052,0.0016684945,0.00014790919,0.00051719695,0.00068284007,0.00067840156],"domain_scores_gemma":[0.9693727,0.025081659,0.002685243,0.00072063174,0.0013382189,0.0008016788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009851968,0.0014657814,0.0024552974,0.0017687314,0.0009937566,0.0035473292,0.002858099,0.0030363176,0.003699554],"category_scores_gemma":[0.04243604,0.0017801658,0.0011590288,0.0019357067,0.0036486122,0.006203717,0.0023909223,0.0036928705,0.00039781144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006433293,0.000046721372,0.0009698243,0.000050473205,0.00003430926,0.00012363987,0.00011798721,0.7157311,0.0003212456,0.27796206,0.0007040955,0.0038742118],"study_design_scores_gemma":[0.00001669954,0.000013808459,0.00024011529,0.000008420335,0.000008230677,0.000016672437,0.00002172964,0.9356492,0.00005892634,0.06375107,0.00019879603,0.000016281874],"about_ca_topic_score_codex":0.014160872,"about_ca_topic_score_gemma":0.007017505,"teacher_disagreement_score":0.014160872,"about_ca_system_score_codex":0.0057301326,"about_ca_system_score_gemma":0.002493776,"threshold_uncertainty_score":0.052102804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74463695,0.00020940015,0.24907179,0.0004698735,0.00006511136,0.00009896704,0.00012826353,0.00040508085,0.0049144207],"genre_scores_gemma":[0.98813474,0.0000589338,0.008976588,0.000046789555,0.000019860485,0.000032802225,0.000043336364,0.000017630688,0.0026692448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878615,0.00022745763,0.000043150845,0.0002596466,0.00017086472,0.00051279535],"domain_scores_gemma":[0.9966978,0.0009351805,0.0006792717,0.0003301262,0.0004749132,0.00088277465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012118038,0.0008228437,0.001245549,0.00078104116,0.0012045526,0.0018319661,0.0025431328,0.0017237287,0.00461788],"category_scores_gemma":[0.004429583,0.00082564884,0.00044447446,0.0013776638,0.0020088425,0.002440752,0.0016870525,0.0010472084,0.0008677044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005540723,0.00021430827,0.0031170687,0.000033860702,0.000059623628,0.00066283136,0.00019697135,0.95972115,0.009548487,0.013997484,0.00082227925,0.011071824],"study_design_scores_gemma":[0.00007627814,0.00014473598,0.0005876058,0.000005395203,0.000024975685,0.00009080179,0.0001539467,0.98432356,0.0017221156,0.012444901,0.00040052473,0.000025223357],"about_ca_topic_score_codex":0.005806726,"about_ca_topic_score_gemma":0.0049682595,"teacher_disagreement_score":0.005806726,"about_ca_system_score_codex":0.0021321988,"about_ca_system_score_gemma":0.00093543524,"threshold_uncertainty_score":0.015470207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049049858,0.0026224267,0.93303275,0.001710139,0.0005234432,0.00013048764,0.00008526819,0.0006270901,0.012218461],"genre_scores_gemma":[0.9711891,0.0012749126,0.015670614,0.00023588697,0.00039927344,0.00010981548,0.0000623909,0.00007883588,0.010979172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986689,0.00037766827,0.00005107827,0.00020684293,0.00043928603,0.00025626214],"domain_scores_gemma":[0.99641633,0.0020396223,0.0003993091,0.00019096618,0.0007407035,0.0002129748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023605577,0.000828918,0.0009513783,0.00070065807,0.00098208,0.003524825,0.0017694193,0.0010859676,0.0049401624],"category_scores_gemma":[0.007645885,0.000343122,0.00027963985,0.0007932761,0.0015642138,0.0023732563,0.0013309004,0.001529782,0.00045299873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009999961,0.0001945143,0.001730745,0.00024767732,0.00009990819,0.00024564326,0.00034360692,0.77400655,0.011078843,0.09789777,0.0061578806,0.10699683],"study_design_scores_gemma":[0.00001933689,0.000043130698,0.00018896512,0.000007845491,0.000015405647,0.000029311019,0.000022631102,0.98889065,0.00074301864,0.009129873,0.00089818356,0.000011573716],"about_ca_topic_score_codex":0.006564756,"about_ca_topic_score_gemma":0.0039061736,"teacher_disagreement_score":0.006564756,"about_ca_system_score_codex":0.0020550184,"about_ca_system_score_gemma":0.0012213041,"threshold_uncertainty_score":0.01652646},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33342537,0.00017318035,0.65080476,0.00043724987,0.00007791281,0.00011734554,0.00044403606,0.0005759558,0.013944192],"genre_scores_gemma":[0.9718391,0.00007682381,0.024659647,0.00002806551,0.000011832162,0.000050383343,0.00018337315,0.00004756049,0.0031031964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997086,0.000076800075,0.000011778494,0.0000467943,0.000058151203,0.00009783623],"domain_scores_gemma":[0.9994918,0.00023294835,0.00007442289,0.00003703141,0.00007073884,0.00009288997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000554717,0.00034024974,0.00045643075,0.0002454626,0.0003727793,0.000837997,0.00086034386,0.00059298764,0.0032375415],"category_scores_gemma":[0.0012442968,0.00040632475,0.00036443298,0.00040281977,0.00025888562,0.0007581793,0.00049639755,0.0008075059,0.0003466035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001358347,0.000036831123,0.0014659046,0.000039673294,0.000016742495,0.00018602313,0.00009144786,0.9735188,0.0023681603,0.0045833685,0.0011424469,0.016414784],"study_design_scores_gemma":[0.0000069518683,0.0000651977,0.00065562426,0.0000052379905,0.000007228255,0.000030464933,0.00013018808,0.9930767,0.0009357916,0.0039479295,0.001130306,0.00000834178],"about_ca_topic_score_codex":0.005924494,"about_ca_topic_score_gemma":0.008104142,"teacher_disagreement_score":0.005924494,"about_ca_system_score_codex":0.00054513424,"about_ca_system_score_gemma":0.00103382,"threshold_uncertainty_score":0.011780024},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062375113,0.00055358344,0.9338017,0.00038350394,0.00005650283,0.00012109992,0.000052735188,0.00018578849,0.0024699308],"genre_scores_gemma":[0.919158,0.00046549676,0.07818235,0.00010048053,0.00004490674,0.00015429637,0.000049790688,0.00004581189,0.0017988608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761236,0.0008256897,0.00013766089,0.00034395405,0.00047451197,0.00060576055],"domain_scores_gemma":[0.9952749,0.0028892376,0.00083073624,0.0001561458,0.000476817,0.0003720824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003879754,0.00100233,0.001914069,0.00077838334,0.0006984929,0.0020012257,0.0019490728,0.0016157597,0.0013655969],"category_scores_gemma":[0.0072766948,0.0013782332,0.0009770901,0.00070387416,0.0013223863,0.0013983679,0.0015574539,0.0014519072,0.00015901377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013920659,0.00005875566,0.00022488854,0.00006842595,0.00002322018,0.000037166556,0.000042354917,0.97517973,0.0017202316,0.016077034,0.00019808148,0.0062308693],"study_design_scores_gemma":[0.000020045802,0.000029070665,0.00004519632,0.000003641953,0.000005324445,0.0000038598246,0.000005322125,0.9959103,0.00037178313,0.0035124873,0.00008841671,0.00000455235],"about_ca_topic_score_codex":0.0063062166,"about_ca_topic_score_gemma":0.0051018824,"teacher_disagreement_score":0.0063062166,"about_ca_system_score_codex":0.0036423823,"about_ca_system_score_gemma":0.006359411,"threshold_uncertainty_score":0.026427448},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10787482,0.0010678947,0.884578,0.00072314485,0.000041740128,0.00007456746,0.000019161267,0.000116719515,0.0055038994],"genre_scores_gemma":[0.9267777,0.00058560463,0.07174613,0.00012360103,0.000040541465,0.000057895573,0.000009684182,0.00004352327,0.0006153546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595404,0.0028248997,0.0000796975,0.00021280575,0.00062685926,0.0003017397],"domain_scores_gemma":[0.98357254,0.013367485,0.001343312,0.0005950749,0.00081395457,0.00030759085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038140772,0.00091992435,0.0009952514,0.0005986625,0.0006673272,0.0016030624,0.0011274435,0.0015369838,0.0012805485],"category_scores_gemma":[0.022137854,0.0007765316,0.0005165908,0.0006733416,0.0013210928,0.0027665459,0.0013276228,0.0012789932,0.00025443788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099219935,0.000034416575,0.00064090965,0.000048876784,0.000022465774,0.00008837673,0.000035411813,0.96910435,0.0027995172,0.014400499,0.0001463033,0.012579634],"study_design_scores_gemma":[0.00001711938,0.00013651735,0.00016625691,0.000010851324,0.000014899627,0.00006561134,0.000018195806,0.9894555,0.0031068495,0.0067358008,0.00026188706,0.000010489248],"about_ca_topic_score_codex":0.0012064058,"about_ca_topic_score_gemma":0.0010120407,"teacher_disagreement_score":0.0038140772,"about_ca_system_score_codex":0.001369495,"about_ca_system_score_gemma":0.00084185705,"threshold_uncertainty_score":0.020170987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91802436,0.00026596177,0.077107884,0.00046053054,0.0000355038,0.000104706654,0.00006940655,0.00013040502,0.0038012743],"genre_scores_gemma":[0.99387956,0.00008751369,0.004553361,0.00006975251,0.000027072138,0.000022085396,0.000032583182,0.000011724881,0.0013163278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978204,0.00062035915,0.00005522434,0.0004909106,0.00018712018,0.000826097],"domain_scores_gemma":[0.99572766,0.0020624644,0.00067148724,0.00021177235,0.0003009008,0.0010257317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032545603,0.0011256379,0.0014497242,0.00091178494,0.0021213626,0.0032852965,0.0020487644,0.002210526,0.00320707],"category_scores_gemma":[0.004213819,0.00088023883,0.00078972563,0.001202469,0.0019671977,0.003117903,0.0021623878,0.0015596456,0.0003441679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022787165,0.0010925521,0.01623124,0.00006814083,0.00028241923,0.0024987098,0.00050257606,0.9117384,0.011687658,0.027343452,0.0018229445,0.024453204],"study_design_scores_gemma":[0.000104068,0.0005582042,0.0062391334,0.000010148508,0.00009074921,0.00038743543,0.00072317536,0.98246723,0.0013854239,0.0074895737,0.0004851587,0.000059729602],"about_ca_topic_score_codex":0.013310749,"about_ca_topic_score_gemma":0.009312828,"teacher_disagreement_score":0.013310749,"about_ca_system_score_codex":0.0028198604,"about_ca_system_score_gemma":0.0014727693,"threshold_uncertainty_score":0.026466548},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17218846,0.00013762177,0.8268691,0.000056575438,0.000009329363,0.000044509048,0.000055725624,0.00024774042,0.00039104122],"genre_scores_gemma":[0.9145796,0.00014951506,0.08467807,0.000015171115,0.000019094938,0.000048119076,0.000072243834,0.000015088696,0.00042317278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999511,0.00012423095,0.000027080985,0.00009678578,0.00020003498,0.000040885727],"domain_scores_gemma":[0.99813855,0.001128783,0.00032178906,0.00011264511,0.00024506115,0.000053149124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075402146,0.0007200921,0.00045698296,0.0010798852,0.00036979333,0.0007315152,0.0008328437,0.0008004378,0.00039553706],"category_scores_gemma":[0.004606901,0.0004376205,0.00028714738,0.0006067548,0.0003912732,0.0010124082,0.00056756526,0.000598735,0.00008566417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020168972,0.00009455035,0.010542877,0.000065325126,0.00006921035,0.00024695805,0.000109674584,0.9015824,0.019569492,0.004331249,0.0002465133,0.06293997],"study_design_scores_gemma":[0.0000028583117,0.000023003866,0.00069519674,0.0000014504419,0.0000058620285,0.000034807388,0.0000064038745,0.9968231,0.0019285373,0.00042574995,0.000048053986,0.0000051036764],"about_ca_topic_score_codex":0.004562312,"about_ca_topic_score_gemma":0.0022510022,"teacher_disagreement_score":0.004562312,"about_ca_system_score_codex":0.0008381699,"about_ca_system_score_gemma":0.0006161019,"threshold_uncertainty_score":0.009071529},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56971174,0.0038810964,0.39020154,0.0045479215,0.0021500846,0.0008726415,0.0009932097,0.007511227,0.020130582],"genre_scores_gemma":[0.9538732,0.00093871035,0.03867515,0.0014746898,0.00015294451,0.0007713014,0.0004928753,0.00080749474,0.0028136708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917414,0.003566394,0.0009109374,0.0012281727,0.0012869659,0.0012661389],"domain_scores_gemma":[0.89672035,0.06677736,0.004880626,0.024920959,0.0032778694,0.0034228049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015228278,0.0013975145,0.001659647,0.00084189436,0.001819563,0.0031857237,0.0018124975,0.0016099258,0.006166543],"category_scores_gemma":[0.084902525,0.0014812145,0.0011261785,0.0008070109,0.0022399856,0.0060696234,0.004498668,0.003981752,0.0020536936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00599253,0.0017607993,0.038255442,0.0012901863,0.0011036559,0.0011773525,0.0022467412,0.7125328,0.050414547,0.07728188,0.0114354985,0.09650856],"study_design_scores_gemma":[0.00089126825,0.0039567146,0.020137057,0.0007522225,0.0010013286,0.0007099159,0.0012302441,0.70841324,0.06586861,0.1577022,0.03885359,0.0004836321],"about_ca_topic_score_codex":0.0017350089,"about_ca_topic_score_gemma":0.0021130927,"teacher_disagreement_score":0.015228278,"about_ca_system_score_codex":0.0013874539,"about_ca_system_score_gemma":0.002430877,"threshold_uncertainty_score":0.08053577},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35333198,0.0008040617,0.63184553,0.0011946199,0.00016948032,0.00012621401,0.00021559061,0.00056521513,0.011747304],"genre_scores_gemma":[0.9784759,0.00014184655,0.019438133,0.000056493787,0.000023945902,0.000029143366,0.00003721668,0.000047265752,0.0017500785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986765,0.00047407273,0.0000501627,0.00017808391,0.0002144982,0.0004067011],"domain_scores_gemma":[0.99520504,0.0029724848,0.00058893714,0.00030024137,0.00047460414,0.00045876403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022751433,0.00096068316,0.0014140818,0.00050836627,0.00085647416,0.0020883926,0.0013135086,0.0010658735,0.0024127236],"category_scores_gemma":[0.009932638,0.0007643372,0.00037751428,0.0008457711,0.0013951275,0.0018556964,0.0010925797,0.001234194,0.00041386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001805648,0.00004671845,0.00029767974,0.000028600387,0.000009310352,0.000050204293,0.00004899573,0.97761166,0.000928881,0.015764585,0.000543353,0.004489409],"study_design_scores_gemma":[0.000024323419,0.00002901758,0.00008589503,0.0000028870193,0.000004754958,0.000010196352,0.000024533416,0.9899234,0.00045737237,0.009278385,0.00015064355,0.000008537021],"about_ca_topic_score_codex":0.0075584357,"about_ca_topic_score_gemma":0.0049040555,"teacher_disagreement_score":0.0075584357,"about_ca_system_score_codex":0.002922809,"about_ca_system_score_gemma":0.002954555,"threshold_uncertainty_score":0.021206498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027514694,0.000111406516,0.9946668,0.000145266,0.000013674481,0.000020125908,0.0000103383645,0.000113898335,0.0021670144],"genre_scores_gemma":[0.7456462,0.0006368164,0.24419242,0.0002981475,0.00022710327,0.0005096638,0.000087043096,0.0002095768,0.008193042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989674,0.0005001562,0.000025078647,0.00015943672,0.00023980277,0.000108067994],"domain_scores_gemma":[0.9976978,0.0015492542,0.00018978781,0.00006670342,0.00038910506,0.00010724659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033802283,0.0010423547,0.0011875315,0.0006312284,0.00054016936,0.0013302129,0.0014719554,0.0014056212,0.0037409659],"category_scores_gemma":[0.005971422,0.0006004096,0.00065484917,0.00048153882,0.0013659786,0.0010848561,0.0015570229,0.0018812258,0.0005044499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037219717,0.000033609795,0.00015774685,0.0000756025,0.000018876322,0.00004011368,0.000043671407,0.96072215,0.0013118938,0.025003819,0.0007930342,0.011762264],"study_design_scores_gemma":[0.000004099691,0.0000098321625,0.000012755571,0.0000030158703,0.0000029132163,0.000002973835,0.0000035165776,0.99761707,0.00008695545,0.0020815087,0.00017301585,0.0000023319335],"about_ca_topic_score_codex":0.0054754824,"about_ca_topic_score_gemma":0.0026547648,"teacher_disagreement_score":0.0054754824,"about_ca_system_score_codex":0.0017246691,"about_ca_system_score_gemma":0.0018583932,"threshold_uncertainty_score":0.017876565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06067975,0.0009206661,0.93408656,0.0002740256,0.00004705875,0.00007210217,0.00003711243,0.00029158132,0.0035911563],"genre_scores_gemma":[0.92970467,0.0005409468,0.067826316,0.0000927671,0.000051017694,0.00015894187,0.00004353433,0.000066487606,0.0015153869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976878,0.0011410333,0.000075397365,0.0002735144,0.0004244995,0.00039773004],"domain_scores_gemma":[0.99742115,0.0017343573,0.00029170755,0.00021553725,0.00018633832,0.00015096743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027098504,0.0009319813,0.0011422314,0.0007989016,0.000970612,0.0017415306,0.0014043507,0.001086279,0.0014350394],"category_scores_gemma":[0.0084026335,0.0007103392,0.0005185137,0.0012741558,0.001919843,0.00248046,0.0015104646,0.0010082052,0.0002748008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005113342,0.000022847395,0.00011314494,0.00003208933,0.00001415589,0.000031708038,0.000055037206,0.9520967,0.0013262589,0.037672043,0.0002905294,0.008294322],"study_design_scores_gemma":[0.000009074705,0.000015361244,0.000029170762,0.0000041831377,0.0000045358274,0.000009414951,0.000010857687,0.97918093,0.00030909604,0.020074336,0.0003468102,0.000006231472],"about_ca_topic_score_codex":0.0036266223,"about_ca_topic_score_gemma":0.0027114323,"teacher_disagreement_score":0.0036266223,"about_ca_system_score_codex":0.0027724907,"about_ca_system_score_gemma":0.0017948629,"threshold_uncertainty_score":0.020115972},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116594456,0.0015257511,0.8512547,0.001345574,0.00017751857,0.00013189644,0.00037552128,0.00073653675,0.027858],"genre_scores_gemma":[0.9192628,0.0019533092,0.06689361,0.0004888527,0.00035296922,0.0003848868,0.0005066832,0.00043249992,0.009724286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817073,0.0005818755,0.000096900854,0.0003028006,0.00050921435,0.00033860613],"domain_scores_gemma":[0.98080724,0.014311471,0.0013672293,0.0010926953,0.00135068,0.0010705832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042636814,0.0014286825,0.0014479299,0.0050376668,0.0018549813,0.0034051167,0.003467707,0.0015843766,0.009985843],"category_scores_gemma":[0.027298464,0.00077856844,0.0020806557,0.0035196438,0.003269716,0.009021912,0.0030940098,0.0035189528,0.0007863977],"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.00013428481,0.00009670198,0.0014982768,0.00016622715,0.00004358571,0.0002413227,0.0002633317,0.08732957,0.0018190484,0.8943081,0.0026802935,0.011419309],"study_design_scores_gemma":[0.000021438722,0.00005524125,0.00045416408,0.00005182694,0.000047213412,0.00016147239,0.00007104382,0.55883795,0.0011370264,0.43784323,0.0012809413,0.000038431408],"about_ca_topic_score_codex":0.0021925776,"about_ca_topic_score_gemma":0.0014432941,"teacher_disagreement_score":0.009985843,"about_ca_system_score_codex":0.004096518,"about_ca_system_score_gemma":0.0017680008,"threshold_uncertainty_score":0.03340596},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25769368,0.00029456464,0.737867,0.00023084534,0.00007110419,0.00011242245,0.00023241152,0.00033603082,0.0031619056],"genre_scores_gemma":[0.98040867,0.0001518495,0.01730485,0.000051475286,0.000039308732,0.000053461856,0.00015272437,0.00005994574,0.0017777708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990434,0.00017342475,0.000037246773,0.0002448276,0.00028849006,0.00021263404],"domain_scores_gemma":[0.99652207,0.0012813392,0.0008973501,0.0004841568,0.00055498583,0.00026003452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002019184,0.00069343427,0.00074848573,0.0010981293,0.00040097977,0.0011732912,0.0024235721,0.0010076368,0.0032179707],"category_scores_gemma":[0.009212869,0.00040512378,0.00078546983,0.0009554947,0.0013702733,0.002086977,0.0014766298,0.0014623125,0.00038373418],"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.00034924207,0.00007899279,0.0072391415,0.00008225614,0.000046756664,0.00036632764,0.00032841688,0.793205,0.015658397,0.16336918,0.0009372492,0.018339],"study_design_scores_gemma":[0.000009100115,0.000047597412,0.00059249275,0.0000043492764,0.0000076072374,0.00010992343,0.000025272719,0.98592085,0.0011644198,0.011703717,0.00039486276,0.000019903526],"about_ca_topic_score_codex":0.0017001057,"about_ca_topic_score_gemma":0.000708836,"teacher_disagreement_score":0.0032179707,"about_ca_system_score_codex":0.0014037965,"about_ca_system_score_gemma":0.0008688403,"threshold_uncertainty_score":0.010765195},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8347787,0.0007288436,0.15967879,0.0006744688,0.00010174375,0.000046835677,0.00010733579,0.0002074005,0.0036758205],"genre_scores_gemma":[0.99555886,0.00010555967,0.0026447265,0.000042952262,0.000038126756,0.000014309511,0.000039601648,0.000018385397,0.0015374691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910766,0.00014627962,0.000032170254,0.00012748591,0.00019218268,0.00039421066],"domain_scores_gemma":[0.99596846,0.0022123258,0.0006812253,0.00017192776,0.00049396465,0.000472151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021112333,0.0006476121,0.00074484164,0.0010778665,0.0007820622,0.0014611189,0.0023467334,0.0009971205,0.0023556813],"category_scores_gemma":[0.0063892226,0.00036984816,0.00064260955,0.0007126222,0.001144378,0.0016737133,0.0009158114,0.0011492091,0.00021738478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041650308,0.0001986092,0.0075214864,0.00008322915,0.00009199396,0.0005344286,0.0003870812,0.90285146,0.00644506,0.07363475,0.0009566849,0.0068787076],"study_design_scores_gemma":[0.000010072178,0.00002045851,0.0004310546,0.0000017930076,0.000008183728,0.000020485493,0.000028218314,0.9962961,0.00019011713,0.0029022167,0.00008279291,0.000008369334],"about_ca_topic_score_codex":0.013555057,"about_ca_topic_score_gemma":0.0042358935,"teacher_disagreement_score":0.013555057,"about_ca_system_score_codex":0.002692677,"about_ca_system_score_gemma":0.0014082829,"threshold_uncertainty_score":0.026952326},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060613956,0.0014483663,0.91993487,0.0022907602,0.00019429938,0.00012830469,0.000119941265,0.00016631895,0.069655724],"genre_scores_gemma":[0.5428985,0.0057932665,0.39621708,0.0018492382,0.00091653655,0.0017814107,0.0002684551,0.00024129932,0.050034158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867225,0.00038599942,0.000087857916,0.00021544157,0.0004774127,0.00016106894],"domain_scores_gemma":[0.99893326,0.00045089403,0.00013343511,0.00020154212,0.0002020731,0.0000787054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019057955,0.00088242267,0.00043496522,0.0008808215,0.0012897102,0.0024949566,0.0010861963,0.0018275838,0.007529019],"category_scores_gemma":[0.0026602156,0.00063574535,0.0010480742,0.0007213579,0.0043247147,0.0033207387,0.0020200422,0.002419034,0.0014224999],"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.0000014434448,0.0000032946573,0.000024119692,0.000021906424,0.0000027071972,0.000017294393,0.000050831528,0.0033473435,0.00022283861,0.9937243,0.00053366023,0.0020502177],"study_design_scores_gemma":[0.000012645371,0.000015683061,0.000046473848,0.000024905687,0.000004334159,0.00005033823,0.000028980068,0.015767246,0.00022772186,0.95658284,0.02723148,0.000007305441],"about_ca_topic_score_codex":0.0012195888,"about_ca_topic_score_gemma":0.0008881197,"teacher_disagreement_score":0.007529019,"about_ca_system_score_codex":0.0019400923,"about_ca_system_score_gemma":0.0012381915,"threshold_uncertainty_score":0.025187075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005680203,0.0003161176,0.99189585,0.000145544,0.000022292583,0.0000130791,0.000017768552,0.00009532729,0.0018138422],"genre_scores_gemma":[0.6834853,0.0034858342,0.30294156,0.0004009701,0.0003237727,0.00024088776,0.00015806984,0.0002504803,0.008713074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989121,0.00031450883,0.000041585998,0.00009008036,0.00052041677,0.000121371966],"domain_scores_gemma":[0.9969242,0.0021423113,0.00026505554,0.0002785356,0.00031559172,0.000074304524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032591268,0.0007049349,0.0007519549,0.0010351796,0.0005007741,0.0011798836,0.0020848666,0.0008351926,0.0022878065],"category_scores_gemma":[0.010709215,0.0004960246,0.00078301894,0.0010635807,0.0011396436,0.0026099042,0.001189711,0.0022632603,0.00047484343],"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.000022170227,0.000024681356,0.0004403943,0.00005982691,0.000019900952,0.00009908422,0.00015393825,0.51391536,0.0013185283,0.4676734,0.0009135862,0.015359068],"study_design_scores_gemma":[0.0000024249505,0.0000053857584,0.00007806579,0.000007684232,0.000005236984,0.00003045919,0.000007958928,0.94391006,0.00016488288,0.055220265,0.00056150544,0.0000059952204],"about_ca_topic_score_codex":0.0032780562,"about_ca_topic_score_gemma":0.0018887429,"teacher_disagreement_score":0.0032780562,"about_ca_system_score_codex":0.0015596175,"about_ca_system_score_gemma":0.0008410536,"threshold_uncertainty_score":0.017236114},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35234627,0.0018847452,0.5561076,0.0049497746,0.00033291025,0.00020399137,0.001996992,0.0005876209,0.081590086],"genre_scores_gemma":[0.9528187,0.0007432666,0.013201932,0.00022005475,0.00010034424,0.000084153646,0.00035342065,0.000040785268,0.032437455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996032,0.00013424792,0.00001678383,0.000070694114,0.0000545375,0.00012044217],"domain_scores_gemma":[0.9991843,0.00035708185,0.00009980451,0.00005992678,0.00011641176,0.00018251441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009211027,0.00065088255,0.001694108,0.00067513343,0.001048753,0.0027302217,0.0028733476,0.0030364275,0.009806002],"category_scores_gemma":[0.0027202636,0.0008699392,0.0011999238,0.0012808394,0.001459494,0.0029380317,0.0015058538,0.0015709521,0.0008997498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013614795,0.00008231521,0.0011527096,0.000058126527,0.00006279141,0.00052603043,0.00009480849,0.8661903,0.00063026446,0.124219276,0.0027733592,0.0040738573],"study_design_scores_gemma":[0.00003201087,0.000042793105,0.00028567138,0.0000071611294,0.000019490804,0.000050124094,0.00004562811,0.97223365,0.000051868425,0.026475554,0.00073832675,0.000017659515],"about_ca_topic_score_codex":0.014907863,"about_ca_topic_score_gemma":0.010079723,"teacher_disagreement_score":0.014907863,"about_ca_system_score_codex":0.0011711753,"about_ca_system_score_gemma":0.0014937537,"threshold_uncertainty_score":0.03280437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5536567,0.0009929205,0.43309534,0.0017584191,0.00049349724,0.000105847495,0.0002078686,0.000865688,0.008823764],"genre_scores_gemma":[0.99598557,0.00009376121,0.0018834833,0.00003351318,0.00003600511,0.000014956922,0.00001885958,0.00001607885,0.0019178834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856204,0.00030735493,0.00007274641,0.00034660962,0.00028290384,0.0004283257],"domain_scores_gemma":[0.9961281,0.0021054156,0.00051025505,0.00019077772,0.00060114975,0.00046431352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023440365,0.0011963756,0.0019713636,0.00091378833,0.0012051263,0.0036545382,0.0027341037,0.0016518428,0.002013836],"category_scores_gemma":[0.0066815563,0.0007048458,0.000661011,0.0009851543,0.0023711415,0.0013611406,0.001669262,0.0017854687,0.0002606614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004877851,0.00010960923,0.00084793736,0.00006470345,0.000050430128,0.00031885467,0.00014993813,0.9665468,0.006686832,0.018021466,0.0005469299,0.0061688134],"study_design_scores_gemma":[0.00001740598,0.000028210236,0.00016456291,0.0000022026345,0.000010800788,0.000012822278,0.000008702513,0.9977592,0.0002476959,0.0016701856,0.00006989983,0.000008234103],"about_ca_topic_score_codex":0.02062512,"about_ca_topic_score_gemma":0.007533738,"teacher_disagreement_score":0.02062512,"about_ca_system_score_codex":0.0025878267,"about_ca_system_score_gemma":0.0020267852,"threshold_uncertainty_score":0.04101014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28648847,0.0010785162,0.70868206,0.00051836285,0.000037754577,0.00008191506,0.00006172975,0.00012087665,0.0029302435],"genre_scores_gemma":[0.97498035,0.00041362311,0.023216775,0.00004226238,0.00005064956,0.00004329841,0.00003361424,0.000028148064,0.0011913265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998789,0.0005679366,0.00003690155,0.00013778408,0.00025110698,0.00021721801],"domain_scores_gemma":[0.9967051,0.0025787721,0.00032880678,0.000060975595,0.00024812727,0.00007832394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022113211,0.0005212459,0.0006617908,0.0006549506,0.0006039626,0.001229177,0.001130122,0.001278324,0.0008962841],"category_scores_gemma":[0.008292253,0.00049712724,0.0002728436,0.0008953209,0.0010966621,0.0019598578,0.00066194404,0.00061166845,0.00011196377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011761143,0.000031581923,0.0008064416,0.000049892507,0.000018417059,0.000093522765,0.000080172824,0.9616301,0.0031013906,0.021610908,0.00027272862,0.012187286],"study_design_scores_gemma":[0.0000055450787,0.000014667635,0.00016997085,0.0000036954111,0.0000042435145,0.000015400792,0.000020760152,0.9947272,0.0004055677,0.0045237183,0.00010546476,0.0000037259224],"about_ca_topic_score_codex":0.007861049,"about_ca_topic_score_gemma":0.0032589857,"teacher_disagreement_score":0.007861049,"about_ca_system_score_codex":0.0020919612,"about_ca_system_score_gemma":0.00089865614,"threshold_uncertainty_score":0.015630603},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35766506,0.0017993744,0.6101143,0.0011441616,0.00019137506,0.00017795026,0.00046958466,0.0010415782,0.027396733],"genre_scores_gemma":[0.9861545,0.00042526991,0.009159959,0.000055625074,0.000044559252,0.00004971703,0.00013133703,0.00005852156,0.0039205323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986186,0.0003448565,0.000040789193,0.00017887985,0.0005115381,0.00030532613],"domain_scores_gemma":[0.9971686,0.0013877605,0.00036484437,0.00022873569,0.00068308186,0.00016708046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015520909,0.0011939922,0.00081355724,0.000586908,0.0005282331,0.00153369,0.001972486,0.0013898086,0.0031429061],"category_scores_gemma":[0.0059168492,0.00039846922,0.00049448444,0.0008269283,0.0008613532,0.0017871489,0.0006162916,0.0010831971,0.0009438661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006458568,0.000028144443,0.00042410282,0.000017164873,0.000008533489,0.00006382769,0.000033419677,0.9855827,0.0015558032,0.009796349,0.00027271442,0.0021525212],"study_design_scores_gemma":[0.0000034454406,0.000022716391,0.000085929336,0.0000017916233,0.0000026754542,0.000014051157,0.0000049525893,0.9984706,0.00021827013,0.0010043668,0.00016704814,0.0000041777475],"about_ca_topic_score_codex":0.010016483,"about_ca_topic_score_gemma":0.0027326648,"teacher_disagreement_score":0.010016483,"about_ca_system_score_codex":0.0018900351,"about_ca_system_score_gemma":0.0013350022,"threshold_uncertainty_score":0.019916356},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058342637,0.000092268856,0.9936991,0.00004307074,0.000013824044,0.00002410241,0.000009994721,0.00010689878,0.0001765316],"genre_scores_gemma":[0.49832436,0.00029638104,0.49912676,0.00014543413,0.00011218554,0.00016147755,0.00015444781,0.00015612361,0.0015227789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698645,0.0012672793,0.00013288454,0.0003294901,0.00111452,0.00016939103],"domain_scores_gemma":[0.98641807,0.009596756,0.0011703902,0.0008771378,0.0016780406,0.00025961176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00645206,0.0007536519,0.0010538498,0.0011566778,0.00037788926,0.0012350566,0.0018879089,0.00093111466,0.0010261955],"category_scores_gemma":[0.029833145,0.0006465935,0.00046374422,0.0006316557,0.001431265,0.002786666,0.0016825781,0.0016211724,0.00022466472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027865532,0.00010182,0.0029493948,0.00014834372,0.00010168879,0.000115662064,0.0001791016,0.74953175,0.0071022045,0.11932419,0.0013513943,0.1188158],"study_design_scores_gemma":[0.000010253202,0.0000469478,0.0002672584,0.0000053292943,0.000006293268,0.000027155267,0.000006017151,0.98122555,0.0014053033,0.0165134,0.00047211535,0.000014472826],"about_ca_topic_score_codex":0.0013396383,"about_ca_topic_score_gemma":0.0011480061,"teacher_disagreement_score":0.00645206,"about_ca_system_score_codex":0.0012404309,"about_ca_system_score_gemma":0.001315993,"threshold_uncertainty_score":0.03412211},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23917004,0.00031180546,0.75158066,0.0015306725,0.000096589,0.00016188885,0.0001308363,0.0002475647,0.0067699784],"genre_scores_gemma":[0.9821039,0.00012368888,0.015451411,0.00006672094,0.000033474225,0.00004505343,0.00003304404,0.000048037913,0.002094615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997572,0.00095331465,0.000085897045,0.00029567422,0.0004466157,0.00064650824],"domain_scores_gemma":[0.9921692,0.005126003,0.0009296335,0.00033103256,0.00068533147,0.0007587918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004839899,0.0010316407,0.0019941793,0.0009350107,0.0010790259,0.0031168896,0.0022985942,0.0014856127,0.0027008667],"category_scores_gemma":[0.013120834,0.00087650435,0.0006852298,0.0008650446,0.002458773,0.0027419992,0.0020014131,0.0019222238,0.00027077098],"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.00018801646,0.00006235544,0.0003743175,0.000027435986,0.000021925503,0.00005613084,0.000084635736,0.96024585,0.0011825126,0.03329974,0.00053957774,0.003917531],"study_design_scores_gemma":[0.000010255445,0.00001641872,0.000075587515,0.000002700452,0.0000039971605,0.000006162595,0.000017675397,0.9900682,0.00017911717,0.0095340945,0.00007857145,0.000007275515],"about_ca_topic_score_codex":0.012564652,"about_ca_topic_score_gemma":0.0050861645,"teacher_disagreement_score":0.012564652,"about_ca_system_score_codex":0.0057941484,"about_ca_system_score_gemma":0.003771126,"threshold_uncertainty_score":0.042039692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.804552,0.00052828324,0.18425438,0.0019383942,0.00024085223,0.00016468501,0.0003741501,0.00039747817,0.007549784],"genre_scores_gemma":[0.98986036,0.00013080343,0.006002661,0.00013221208,0.00016856918,0.000044281358,0.000085222135,0.000039493054,0.003536332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998492,0.00037296096,0.00007098229,0.00026433854,0.0002961067,0.0005035619],"domain_scores_gemma":[0.997138,0.0013773737,0.00044701574,0.00015890997,0.00042156916,0.000457042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029490972,0.0010638493,0.0015319758,0.0009467251,0.0014091582,0.002700837,0.0020220734,0.0020334627,0.0023547425],"category_scores_gemma":[0.006674847,0.00089605135,0.00070567254,0.0010028677,0.001868664,0.0030810505,0.0014030032,0.0013631111,0.00051092345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010673901,0.00035850448,0.010965368,0.0001422637,0.000066259985,0.0026149524,0.0007337778,0.8388791,0.00980173,0.12289967,0.0035344001,0.008936551],"study_design_scores_gemma":[0.000036190042,0.00004928398,0.0005273694,0.0000038354096,0.000009127067,0.00006429332,0.00005688207,0.992732,0.00020234467,0.006184114,0.00011876391,0.000015813817],"about_ca_topic_score_codex":0.014501952,"about_ca_topic_score_gemma":0.007817394,"teacher_disagreement_score":0.014501952,"about_ca_system_score_codex":0.002910805,"about_ca_system_score_gemma":0.0015501574,"threshold_uncertainty_score":0.028835118},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41849104,0.0012855504,0.53177345,0.0035653736,0.0003162016,0.00042498237,0.0015548181,0.0005299079,0.042058703],"genre_scores_gemma":[0.96906036,0.0005570034,0.017629176,0.000163824,0.000079545876,0.0001662752,0.0002729355,0.000044997287,0.012025797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985545,0.00036953896,0.000048952574,0.00022095787,0.00021601915,0.00058998907],"domain_scores_gemma":[0.9968778,0.00130505,0.00063553645,0.00016968443,0.00057323417,0.00043864414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020662437,0.0013585996,0.0011743781,0.0012469473,0.0017994454,0.0036068817,0.0031476007,0.0028697732,0.0063663814],"category_scores_gemma":[0.007251297,0.0007853845,0.0010087346,0.0015075634,0.00217511,0.0025008854,0.0021828804,0.0022731016,0.0006425465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008235319,0.00007813903,0.0019578757,0.00003609171,0.000022140975,0.00021916139,0.0001930803,0.84724474,0.0010687193,0.14607696,0.001207111,0.0018137196],"study_design_scores_gemma":[0.000022329139,0.0000211355,0.00029824275,0.0000068078402,0.0000104439705,0.000016140233,0.000059938913,0.9816001,0.00010081415,0.017118951,0.00073154125,0.000013555687],"about_ca_topic_score_codex":0.10934378,"about_ca_topic_score_gemma":0.06879115,"teacher_disagreement_score":0.10934378,"about_ca_system_score_codex":0.00790532,"about_ca_system_score_gemma":0.005406554,"threshold_uncertainty_score":0.21741462},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006382776,0.0027622876,0.98343927,0.00047339578,0.0003098029,0.000023898025,0.00002755837,0.00019832262,0.006382745],"genre_scores_gemma":[0.70589644,0.01304264,0.2566722,0.0009857011,0.0031653084,0.00030235297,0.000110043715,0.00035054263,0.019474791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995727,0.00012521388,0.000016852046,0.000034401226,0.00020817111,0.000042676536],"domain_scores_gemma":[0.9986676,0.0009789607,0.00009583778,0.0000765572,0.00015145335,0.000029612615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011747965,0.00087441894,0.0004905466,0.0009957463,0.0004818017,0.0011364748,0.00067395956,0.000808625,0.0036307578],"category_scores_gemma":[0.0042398474,0.00032710028,0.0005421731,0.0012355008,0.0013217365,0.0013097641,0.00078451046,0.0012587407,0.0005638123],"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.000041707008,0.00004818583,0.000566112,0.00013527228,0.000045146026,0.00022962241,0.00016955363,0.28998786,0.0043525174,0.6269437,0.004122052,0.07335815],"study_design_scores_gemma":[0.00000394307,0.000030254301,0.00016182713,0.00002175647,0.000010658165,0.00012160979,0.00002113626,0.7847445,0.00070762506,0.20951587,0.004646881,0.000013951042],"about_ca_topic_score_codex":0.0017277581,"about_ca_topic_score_gemma":0.0010690943,"teacher_disagreement_score":0.0036307578,"about_ca_system_score_codex":0.0009380449,"about_ca_system_score_gemma":0.0005088887,"threshold_uncertainty_score":0.012146115},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4106017,0.002135745,0.5727244,0.0009185085,0.00013140644,0.00009853429,0.00016577274,0.00049091363,0.012732923],"genre_scores_gemma":[0.9900851,0.000512859,0.007765243,0.000034851935,0.000040710427,0.000024969439,0.00006191074,0.000031250995,0.0014430739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920964,0.0003178811,0.000028151868,0.0000648469,0.00023603866,0.00014339355],"domain_scores_gemma":[0.99733895,0.0018570315,0.00018968989,0.000080272046,0.00043118472,0.00010282482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00148311,0.00038695658,0.00037648567,0.000696775,0.0005033337,0.0012609961,0.0006174916,0.000521346,0.0012404391],"category_scores_gemma":[0.00668653,0.00029518612,0.0002985553,0.00061141315,0.00086378935,0.0013801188,0.00044930002,0.00057966885,0.0001202245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004613076,0.000029773293,0.0014676446,0.000029949913,0.000021637592,0.000105344305,0.00008870153,0.9439493,0.002040426,0.047374707,0.0004919047,0.004354602],"study_design_scores_gemma":[0.0000019567162,0.000006203381,0.000222355,0.0000019627605,0.0000023210116,0.0000043910595,0.0000102300655,0.995197,0.000115089664,0.0043357434,0.000099869845,0.0000029352816],"about_ca_topic_score_codex":0.022064615,"about_ca_topic_score_gemma":0.005400404,"teacher_disagreement_score":0.022064615,"about_ca_system_score_codex":0.0027044138,"about_ca_system_score_gemma":0.0011911398,"threshold_uncertainty_score":0.043872416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52007735,0.0022400788,0.40310535,0.018395366,0.0005554452,0.00014615711,0.00037923074,0.00022405958,0.05487697],"genre_scores_gemma":[0.9790724,0.00067919807,0.013903868,0.00071659184,0.00024648404,0.00006137696,0.00004204829,0.000039645183,0.00523836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806947,0.0011006182,0.00006821824,0.00018048173,0.00029312234,0.00028816704],"domain_scores_gemma":[0.99092066,0.0062841573,0.000798348,0.00039157295,0.0006970992,0.0009082117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004465973,0.00060939614,0.0011848367,0.00076967396,0.0015143278,0.0026936517,0.0015731697,0.0026202768,0.0048438325],"category_scores_gemma":[0.011395728,0.0004921446,0.00087595166,0.00076534954,0.0031478535,0.0040262663,0.002138558,0.0024905945,0.00032107302],"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.000085106396,0.00007707384,0.0008068654,0.00005731658,0.000026433816,0.0003854069,0.00022160156,0.117910534,0.0006932245,0.87340456,0.0029955239,0.0033362748],"study_design_scores_gemma":[0.000056645953,0.00003841479,0.00031570587,0.000022182325,0.00001543002,0.00009143262,0.00013507118,0.47035646,0.00010381592,0.5275037,0.0013200155,0.00004106628],"about_ca_topic_score_codex":0.0040348265,"about_ca_topic_score_gemma":0.0022795831,"teacher_disagreement_score":0.0048438325,"about_ca_system_score_codex":0.002366698,"about_ca_system_score_gemma":0.002123151,"threshold_uncertainty_score":0.023618579},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04700217,0.00081820233,0.94842255,0.00038190032,0.00004880831,0.00005362047,0.000071901995,0.0003740215,0.0028267582],"genre_scores_gemma":[0.9109131,0.0012260976,0.08477959,0.0002117205,0.00010243378,0.00018860285,0.00015184033,0.00008899661,0.002337684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985917,0.0006049017,0.00004962304,0.0001984596,0.0004320431,0.00012320085],"domain_scores_gemma":[0.9865878,0.010482908,0.0012908524,0.000580525,0.00084567576,0.00021224478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026813387,0.00085793744,0.0006829743,0.0017309404,0.0006276356,0.0013310196,0.001272433,0.0015607026,0.001788311],"category_scores_gemma":[0.019225078,0.00049505936,0.0008941682,0.0016841767,0.0020048497,0.0027927242,0.0009252795,0.0017061831,0.0002830442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005393077,0.00005544207,0.0019178732,0.000055944674,0.000036355254,0.00015752684,0.0001045943,0.7858595,0.0011137908,0.19457243,0.0006647711,0.015407796],"study_design_scores_gemma":[0.0000042769216,0.0000119627775,0.00024065675,0.000008359748,0.0000049814375,0.000031925178,0.000011348619,0.9671734,0.000217637,0.031961977,0.00032388352,0.000009659357],"about_ca_topic_score_codex":0.0055113123,"about_ca_topic_score_gemma":0.002920595,"teacher_disagreement_score":0.0055113123,"about_ca_system_score_codex":0.0017762935,"about_ca_system_score_gemma":0.0011119155,"threshold_uncertainty_score":0.014180481},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034730423,0.0040175593,0.91537267,0.006209239,0.00027509758,0.00014078013,0.0006445553,0.00024038184,0.038369242],"genre_scores_gemma":[0.8028899,0.0066343443,0.13319209,0.0010372032,0.0010552292,0.0009322459,0.0008529552,0.00026293698,0.05314308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981312,0.00093619246,0.00007720539,0.00027827398,0.00035324844,0.00022385268],"domain_scores_gemma":[0.9983973,0.001087784,0.00019616015,0.00005877037,0.00013078665,0.00012923496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021008581,0.0012829975,0.0014303427,0.0009673352,0.0009999727,0.0034064678,0.002164636,0.0036264427,0.0064814063],"category_scores_gemma":[0.0052703484,0.00071471254,0.0011191639,0.0023645316,0.0020321356,0.0027739173,0.0017188166,0.0023664245,0.0005779287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021635704,0.000045318586,0.0002947192,0.000081687496,0.000021951239,0.000090739086,0.00007756627,0.70529264,0.0001688638,0.28766194,0.0026536747,0.003589311],"study_design_scores_gemma":[0.000023919874,0.00002122041,0.00016882776,0.000017306913,0.000009429099,0.000027970447,0.000056457957,0.8175556,0.00008672045,0.1775096,0.004510576,0.000012282931],"about_ca_topic_score_codex":0.014585237,"about_ca_topic_score_gemma":0.006542745,"teacher_disagreement_score":0.014585237,"about_ca_system_score_codex":0.0031891314,"about_ca_system_score_gemma":0.0018631855,"threshold_uncertainty_score":0.02900064},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04337009,0.000109906614,0.9495077,0.0002379139,0.0000983201,0.00009476657,0.00009039706,0.00017746715,0.0063133775],"genre_scores_gemma":[0.6981158,0.0004437986,0.29552498,0.00011056655,0.00011454398,0.00022208637,0.00037452922,0.00012039992,0.00497323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909854,0.0002523854,0.000051614512,0.000114801784,0.0003602219,0.0001225602],"domain_scores_gemma":[0.995774,0.0026405782,0.0002677234,0.00037090664,0.00061354163,0.00033329809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002070217,0.00035980868,0.00055509334,0.0016392487,0.0010044359,0.0018038212,0.0010698145,0.00077204546,0.003131888],"category_scores_gemma":[0.00662165,0.0007774367,0.0011744295,0.0010149054,0.001265466,0.0011461645,0.0018503828,0.0018449648,0.00042133944],"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.000054006807,0.00008265024,0.0008472461,0.00006311086,0.000015564228,0.0001277245,0.00020676012,0.07365683,0.0025772285,0.907198,0.00074178574,0.014429187],"study_design_scores_gemma":[0.00003514766,0.000053786556,0.00041158433,0.000031723088,0.00001559769,0.00010475705,0.000053559652,0.57681954,0.0022576891,0.41672006,0.0034736274,0.000022938646],"about_ca_topic_score_codex":0.0012736268,"about_ca_topic_score_gemma":0.0010119713,"teacher_disagreement_score":0.003131888,"about_ca_system_score_codex":0.0010594184,"about_ca_system_score_gemma":0.0026895045,"threshold_uncertainty_score":0.010948479},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7363369,0.024049418,0.21047215,0.0041748933,0.00075673475,0.00005969227,0.00021148584,0.00053653005,0.023402235],"genre_scores_gemma":[0.9925465,0.0039317356,0.0025604016,0.00008342668,0.00016688496,0.000010645172,0.000019275365,0.00002139979,0.0006598911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990735,0.0004970243,0.00003599584,0.000056287932,0.00019271385,0.00014447287],"domain_scores_gemma":[0.99407494,0.004797931,0.00045226642,0.00024603115,0.00029399357,0.00013484737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009076963,0.0005715071,0.00035985344,0.00040264832,0.0007013205,0.00095038395,0.00035940294,0.0008003738,0.00082637416],"category_scores_gemma":[0.0077821235,0.00025861966,0.00030197707,0.0006600705,0.0010173643,0.0015479701,0.00076511357,0.0006145068,0.00014509242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034839776,0.000058995887,0.0077645024,0.00024322313,0.00010790059,0.0011510911,0.0003210426,0.84746295,0.026019964,0.043166887,0.0023926112,0.070962474],"study_design_scores_gemma":[0.000035202902,0.00029657964,0.0045924317,0.00008445928,0.00012532968,0.00087137276,0.0002030036,0.93512446,0.009128922,0.042820677,0.006646076,0.00007142002],"about_ca_topic_score_codex":0.002723428,"about_ca_topic_score_gemma":0.0014988919,"teacher_disagreement_score":0.002723428,"about_ca_system_score_codex":0.00072957424,"about_ca_system_score_gemma":0.00033314154,"threshold_uncertainty_score":0.005415201},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13501838,0.00046773365,0.8311568,0.0032057867,0.00015089422,0.0005351683,0.0010098607,0.0003121923,0.028143153],"genre_scores_gemma":[0.90713495,0.00038071937,0.076086596,0.00019457673,0.00009608832,0.00047166718,0.00035300863,0.000077707016,0.015204629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979498,0.0011840834,0.00005065858,0.00022206349,0.00021179102,0.00038171644],"domain_scores_gemma":[0.9950759,0.0038441175,0.0003402112,0.00010546662,0.00030837313,0.00032588156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048366,0.0011773154,0.0016264096,0.00084116904,0.0007717156,0.0026213885,0.0018594691,0.0032498273,0.008220762],"category_scores_gemma":[0.0070900708,0.001247811,0.0011860422,0.00089650403,0.0015811748,0.0020895158,0.0016642214,0.0020475248,0.00050988625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011267679,0.00004827933,0.0004351717,0.000041929892,0.000019589981,0.00015134928,0.000038858405,0.96823746,0.00018984737,0.026829777,0.00083225634,0.0030628128],"study_design_scores_gemma":[0.00001484403,0.00002399131,0.000077509176,0.000005276065,0.000005114045,0.000009730321,0.000011788317,0.9942417,0.00007180325,0.005242019,0.00028950433,0.000006781182],"about_ca_topic_score_codex":0.017440686,"about_ca_topic_score_gemma":0.0131608425,"teacher_disagreement_score":0.017440686,"about_ca_system_score_codex":0.004073475,"about_ca_system_score_gemma":0.0033853545,"threshold_uncertainty_score":0.03467834},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.456033,0.00040990545,0.5387919,0.00039404174,0.00005114764,0.000053767893,0.000026460046,0.0004858824,0.0037538563],"genre_scores_gemma":[0.9893755,0.00007527509,0.010283814,0.000024082137,0.000005277496,0.00000996433,0.0000070571073,0.000011400065,0.00020753221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990927,0.00037363652,0.000057586953,0.000116858784,0.00017416557,0.00018506407],"domain_scores_gemma":[0.99743265,0.0015481197,0.00033901786,0.00021374515,0.000243031,0.00022340585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019646718,0.0005513839,0.00061434344,0.0004806045,0.0005383467,0.0013757397,0.0010601539,0.00042568182,0.001034052],"category_scores_gemma":[0.008360743,0.00027938455,0.00026375233,0.00062965025,0.0009150543,0.0018808579,0.0013184306,0.0006832523,0.00012499343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005063759,0.00036867236,0.0077571035,0.00013442959,0.000071990464,0.00016693107,0.00049605273,0.8227532,0.014124127,0.03984239,0.0007116617,0.11306707],"study_design_scores_gemma":[0.00002006895,0.0003024756,0.0009201296,0.0000092200635,0.000033035576,0.00005521449,0.00015446465,0.9713495,0.003525341,0.023178084,0.00043042345,0.00002206549],"about_ca_topic_score_codex":0.0024956318,"about_ca_topic_score_gemma":0.0023744104,"teacher_disagreement_score":0.0024956318,"about_ca_system_score_codex":0.0012660011,"about_ca_system_score_gemma":0.0016161174,"threshold_uncertainty_score":0.010390282},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12929103,0.00007094279,0.8648552,0.00026747677,0.000036837573,0.00014468381,0.00014902126,0.0016946769,0.0034902622],"genre_scores_gemma":[0.7949735,0.00008819514,0.20344746,0.000104273284,0.000016581193,0.0002843197,0.0002156054,0.00014194724,0.0007280979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867886,0.00073373073,0.000061312305,0.00013337619,0.00020487842,0.00018780684],"domain_scores_gemma":[0.99208623,0.0060381587,0.0003301206,0.0009276141,0.00044329348,0.00017467717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003143707,0.0006713322,0.0012375861,0.0005866404,0.0007275968,0.0009334232,0.0014669179,0.0010648713,0.0031512326],"category_scores_gemma":[0.011854031,0.0007139743,0.0007523725,0.0009101398,0.0008942113,0.0018287173,0.0012102622,0.0019015027,0.00033340527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035344838,0.000023417855,0.00038677437,0.0000060433467,0.000006716408,0.0000097162065,0.000015124751,0.99247384,0.00022780082,0.004196611,0.00008737458,0.0025312614],"study_design_scores_gemma":[0.000006082674,0.000004636378,0.000024142346,7.0197115e-7,0.0000011108009,0.000001211473,0.0000021588748,0.9988896,0.00015730225,0.0008691895,0.00004232812,0.0000014103575],"about_ca_topic_score_codex":0.019193199,"about_ca_topic_score_gemma":0.009396899,"teacher_disagreement_score":0.019193199,"about_ca_system_score_codex":0.0016694313,"about_ca_system_score_gemma":0.001982635,"threshold_uncertainty_score":0.038162947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98660386,0.00020257465,0.011846715,0.00010159249,0.000007734032,0.000007285156,0.000041094823,0.00010611537,0.0010830462],"genre_scores_gemma":[0.998679,0.000053484793,0.0009941774,0.0000062590525,0.0000026610207,0.0000036841489,0.000030437075,0.000005131634,0.00022521612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950683,0.00019122209,0.000021959388,0.00006884547,0.00011126667,0.000099827776],"domain_scores_gemma":[0.99737155,0.0014438139,0.00033115814,0.00024944736,0.00050651294,0.000097563214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012397063,0.00028452906,0.00024814752,0.0005705152,0.0003219748,0.00047849974,0.00037950772,0.00039691335,0.0006802885],"category_scores_gemma":[0.004750517,0.00014315022,0.0001774109,0.00052413926,0.0005733835,0.000607556,0.0004467917,0.00023940434,0.00011908306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006706586,0.000067926885,0.017420324,0.000068120986,0.00007082827,0.0001961487,0.00022352334,0.9272349,0.022485225,0.004345565,0.00050210615,0.026714599],"study_design_scores_gemma":[0.000016130649,0.0003444119,0.0041669277,0.000006658661,0.000026721425,0.00008633542,0.00008429695,0.9834058,0.010211972,0.0013670655,0.00027199066,0.00001167317],"about_ca_topic_score_codex":0.0048745573,"about_ca_topic_score_gemma":0.002166261,"teacher_disagreement_score":0.0048745573,"about_ca_system_score_codex":0.0010951484,"about_ca_system_score_gemma":0.00024179003,"threshold_uncertainty_score":0.009692371},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5345121,0.00035343427,0.45757464,0.00030742545,0.000044819382,0.00008173374,0.0000731677,0.00039322843,0.0066594407],"genre_scores_gemma":[0.9838817,0.00010428056,0.014398694,0.000027230775,0.000013735392,0.000023518403,0.000018102039,0.000024883253,0.0015078194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988036,0.00043080034,0.000034834924,0.00016941533,0.00017835779,0.0003828595],"domain_scores_gemma":[0.9976719,0.0014060888,0.0003479408,0.000120592056,0.00019920361,0.00025419504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018566321,0.0007579991,0.0008168159,0.00065587566,0.00072286744,0.0016945201,0.001231289,0.00089198176,0.0016019279],"category_scores_gemma":[0.004406654,0.0005833616,0.00039576358,0.0013482126,0.0019460161,0.002020617,0.00091998396,0.00073855557,0.0003294544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003245198,0.00011736354,0.00075514696,0.000038526836,0.000022635524,0.00014500883,0.00007940502,0.9641035,0.0065910993,0.017889021,0.00042107832,0.0095126685],"study_design_scores_gemma":[0.000026982183,0.00011568423,0.00021421045,0.0000055319433,0.000012971763,0.000029283996,0.00005636144,0.98175645,0.0026662494,0.014931798,0.00017187672,0.000012643738],"about_ca_topic_score_codex":0.0036986717,"about_ca_topic_score_gemma":0.0036894495,"teacher_disagreement_score":0.0036986717,"about_ca_system_score_codex":0.0028810864,"about_ca_system_score_gemma":0.0016747636,"threshold_uncertainty_score":0.020903766},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3762067,0.00010307398,0.62199444,0.00013347316,0.000020154068,0.00007841672,0.00005518121,0.0006106643,0.00079792907],"genre_scores_gemma":[0.9501721,0.000038260445,0.049440827,0.000019008223,0.000008121111,0.00003263249,0.00005528536,0.00001543331,0.0002183255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999398,0.00024834345,0.000022542179,0.00006655977,0.00019412521,0.00007055623],"domain_scores_gemma":[0.99627906,0.0026654191,0.0003212346,0.00025948288,0.00034308102,0.00013159637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024847551,0.00048377528,0.0006201075,0.00054248946,0.0003453416,0.000778705,0.0012033794,0.0005676851,0.0005199257],"category_scores_gemma":[0.009031428,0.00047706717,0.0001928333,0.000471259,0.00072445563,0.00087621843,0.00068326626,0.0007782751,0.00008988508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023624736,0.000041968597,0.003536189,0.000021933685,0.00001322906,0.000058709677,0.000047165016,0.97770804,0.0037490847,0.0046282834,0.00013935645,0.009819797],"study_design_scores_gemma":[0.0000037787381,0.00000789341,0.00013758757,5.591916e-7,0.0000010585504,0.0000037780353,0.0000018696284,0.998939,0.00054057874,0.00034687392,0.00001568713,0.0000013964088],"about_ca_topic_score_codex":0.0076337736,"about_ca_topic_score_gemma":0.0034478023,"teacher_disagreement_score":0.0076337736,"about_ca_system_score_codex":0.0014789919,"about_ca_system_score_gemma":0.0015997582,"threshold_uncertainty_score":0.01517868},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3833423,0.0005243276,0.6083776,0.00097006216,0.0001898595,0.00012739393,0.00014624004,0.0005271997,0.005795084],"genre_scores_gemma":[0.9830898,0.00013579166,0.013774177,0.00006114828,0.000038858794,0.000038155056,0.00003498745,0.000015692829,0.0028114114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988254,0.00028043296,0.00005406118,0.0002515859,0.00029931043,0.0002891917],"domain_scores_gemma":[0.99781066,0.0010034298,0.00040152902,0.00011033049,0.0002982778,0.00037570845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018391125,0.00071841443,0.0010769818,0.00046981368,0.00095197675,0.0025243005,0.0019786572,0.0010282574,0.0020021058],"category_scores_gemma":[0.0034768544,0.00047015972,0.00046721334,0.00062801444,0.0012685723,0.001263253,0.0012259621,0.0014350134,0.00020714707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028552898,0.00016883186,0.00075562514,0.000047412406,0.000025914276,0.00022717555,0.0001598349,0.9517894,0.008130343,0.029552562,0.0005299023,0.008327436],"study_design_scores_gemma":[0.000015352045,0.000023830971,0.000053922955,0.0000013385663,0.000003796214,0.0000066481234,0.000006239976,0.9981108,0.000249672,0.0014343346,0.00008929412,0.0000048423085],"about_ca_topic_score_codex":0.01608725,"about_ca_topic_score_gemma":0.0069609834,"teacher_disagreement_score":0.01608725,"about_ca_system_score_codex":0.0024214862,"about_ca_system_score_gemma":0.0021582937,"threshold_uncertainty_score":0.03198725},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68222606,0.00017315571,0.3157658,0.00015432133,0.00001347563,0.00003974951,0.000051263287,0.00029410093,0.0012820272],"genre_scores_gemma":[0.98756593,0.00004609852,0.012192908,0.000008376043,0.0000047659214,0.000015389087,0.000039997234,0.000009190244,0.00011736516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990609,0.00039299447,0.00003111569,0.00011435296,0.00022738635,0.00017331105],"domain_scores_gemma":[0.9888353,0.008573862,0.0010829285,0.0005962429,0.0006423011,0.00026935726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002669976,0.00049717556,0.0005655246,0.0010898925,0.00049709855,0.00088821707,0.0009706496,0.00067405816,0.0003260327],"category_scores_gemma":[0.014081464,0.00052412576,0.0002824463,0.00094522006,0.0011101098,0.0012473892,0.0008405485,0.00076420204,0.00004832868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005798348,0.000027156697,0.0034178887,0.0000076718,0.000010446462,0.000015627293,0.00002542152,0.9881693,0.00059540936,0.003467677,0.000060576556,0.0041448884],"study_design_scores_gemma":[0.0000024733731,0.000007032766,0.00026380896,7.2058384e-7,0.0000017081295,0.000003683481,0.0000046595196,0.9985227,0.00031173445,0.00085850235,0.000020856804,0.0000021038543],"about_ca_topic_score_codex":0.014542014,"about_ca_topic_score_gemma":0.0054917247,"teacher_disagreement_score":0.014542014,"about_ca_system_score_codex":0.0018226105,"about_ca_system_score_gemma":0.001067314,"threshold_uncertainty_score":0.02891475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4945527,0.0004940131,0.48174495,0.00070622267,0.00011201827,0.00018275714,0.000154118,0.0004914083,0.021561814],"genre_scores_gemma":[0.9764924,0.00015670738,0.015250905,0.000058291444,0.00004076818,0.00006479351,0.000059833805,0.000034805515,0.00784145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982243,0.00055551063,0.000045460856,0.00033126466,0.00038433712,0.00045913362],"domain_scores_gemma":[0.99676347,0.0015431431,0.00076830917,0.00018738533,0.00037763946,0.00036009218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016996323,0.0011059447,0.00078969024,0.0008029565,0.0014592606,0.0018265261,0.0025716336,0.0015949429,0.0052942005],"category_scores_gemma":[0.0042377766,0.0006740376,0.00040246142,0.0011278673,0.0015296508,0.00183109,0.0012120422,0.0010573459,0.00064747134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003121444,0.0002821741,0.0033281625,0.00009507337,0.00003266287,0.00057540654,0.00014053386,0.96052635,0.0032058514,0.016099883,0.0011748074,0.014227073],"study_design_scores_gemma":[0.00003531198,0.00019400727,0.0008891318,0.000006186866,0.00002372496,0.00011596818,0.00011217919,0.9928504,0.0010752724,0.0038436272,0.00082732714,0.000026845266],"about_ca_topic_score_codex":0.016430976,"about_ca_topic_score_gemma":0.016812528,"teacher_disagreement_score":0.016430976,"about_ca_system_score_codex":0.0027550377,"about_ca_system_score_gemma":0.0027637675,"threshold_uncertainty_score":0.032670677},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24195574,0.0014323923,0.7487206,0.0005461802,0.00011793502,0.00005295787,0.00013736605,0.00015118295,0.006885591],"genre_scores_gemma":[0.9705045,0.0007538682,0.02507063,0.000064530395,0.00012372201,0.000037243684,0.00006523018,0.00002322711,0.0033570998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957985,0.00012520367,0.000017580409,0.00006356843,0.0001270935,0.00008659671],"domain_scores_gemma":[0.9985985,0.00087489944,0.00018683032,0.00006534874,0.00020439202,0.00007011719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001409669,0.0007773956,0.0007231954,0.0009338867,0.0005832457,0.00080290023,0.0011591944,0.0010283936,0.0013714058],"category_scores_gemma":[0.0032305631,0.0003609309,0.0009077001,0.001602745,0.0007547378,0.0011815615,0.00081698986,0.00072416395,0.000124969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052097435,0.000058759684,0.0011234952,0.000043917826,0.000046858655,0.00018048857,0.00007725937,0.9081962,0.0031799152,0.0770959,0.0005294506,0.009415579],"study_design_scores_gemma":[0.00000279614,0.000014603757,0.0001298706,0.0000016073213,0.0000056640606,0.000017400424,0.0000099341205,0.99155575,0.00015373837,0.007986936,0.00011746346,0.0000041257135],"about_ca_topic_score_codex":0.005720654,"about_ca_topic_score_gemma":0.0026790816,"teacher_disagreement_score":0.005720654,"about_ca_system_score_codex":0.0016062963,"about_ca_system_score_gemma":0.0009078922,"threshold_uncertainty_score":0.011654556},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11420528,0.003879466,0.79234725,0.01029746,0.00033933282,0.0001633884,0.00033284602,0.00025806122,0.07817694],"genre_scores_gemma":[0.9685325,0.0017100585,0.021507993,0.00051525683,0.00026982068,0.00016181794,0.00010096319,0.000047931928,0.0071538175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924797,0.0030433787,0.00030269276,0.00088927324,0.0019559152,0.0013290605],"domain_scores_gemma":[0.9842808,0.01155795,0.0013133433,0.0008652832,0.0014070215,0.0005756351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059025153,0.001057065,0.0011901736,0.001024304,0.0014518547,0.0049291737,0.0015981308,0.002435881,0.0031692765],"category_scores_gemma":[0.023106264,0.0006169304,0.0010327587,0.0010673709,0.0054318225,0.0053311484,0.0023760262,0.0033158753,0.00048727755],"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.000021335478,0.0000247888,0.000530961,0.000045527795,0.000024195062,0.00016737524,0.00029830865,0.0671034,0.00026052783,0.9271203,0.0009733126,0.003430057],"study_design_scores_gemma":[0.00001808376,0.0000210786,0.00021120282,0.00002607252,0.000010733991,0.000036139365,0.000105869694,0.18575855,0.0001032492,0.8115873,0.0021039417,0.000017795926],"about_ca_topic_score_codex":0.013404851,"about_ca_topic_score_gemma":0.0046265135,"teacher_disagreement_score":0.013404851,"about_ca_system_score_codex":0.0051028677,"about_ca_system_score_gemma":0.0043301983,"threshold_uncertainty_score":0.03702408},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52822435,0.0011012756,0.42481893,0.018847883,0.00023922471,0.00014260571,0.00016482602,0.0003063218,0.02615458],"genre_scores_gemma":[0.9901932,0.00019847261,0.0077548823,0.00038476643,0.00006947716,0.000038461505,0.000021351738,0.000021615895,0.0013176586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99293184,0.0044559287,0.00018444807,0.00055592705,0.0009943345,0.0008775876],"domain_scores_gemma":[0.96441364,0.02762635,0.004185326,0.0012399604,0.0014704351,0.0010641728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0108583495,0.0007265682,0.0011591475,0.0006752274,0.001931336,0.006032607,0.0022530893,0.004316608,0.003471474],"category_scores_gemma":[0.045953862,0.0009256349,0.0009602897,0.00086350297,0.004300405,0.0095997825,0.0033432136,0.0049115494,0.00043412801],"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.0012668179,0.00032737455,0.0055255895,0.0002556347,0.00017827586,0.0012013045,0.0058131693,0.29935828,0.0030401018,0.6461906,0.003963543,0.032879397],"study_design_scores_gemma":[0.00009361335,0.00018058943,0.0013671633,0.000054162407,0.00008251231,0.00014129857,0.0015534679,0.65846205,0.0010881426,0.3348894,0.0019559239,0.00013162251],"about_ca_topic_score_codex":0.006456328,"about_ca_topic_score_gemma":0.0036425325,"teacher_disagreement_score":0.0108583495,"about_ca_system_score_codex":0.0039942507,"about_ca_system_score_gemma":0.0028707914,"threshold_uncertainty_score":0.05742508},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122554675,0.00027462328,0.8690001,0.00063067564,0.000033399127,0.00014390514,0.00011281185,0.00048979453,0.006760031],"genre_scores_gemma":[0.75581765,0.00023612169,0.24058771,0.00014342321,0.000035931727,0.00047893758,0.00018129287,0.00015255678,0.0023663829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820864,0.0011426621,0.00003835338,0.00015008409,0.00022152982,0.00023873082],"domain_scores_gemma":[0.98831207,0.010024252,0.00066532294,0.00022463787,0.0004724413,0.00030125587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040825717,0.0012739532,0.0017158802,0.0010516834,0.0007728968,0.001724587,0.0019571679,0.001989367,0.0029086499],"category_scores_gemma":[0.010368598,0.0012314135,0.0010278735,0.0013422027,0.0016531936,0.0014951747,0.0012650543,0.0019641342,0.0002637385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019021672,0.000016753798,0.00012214054,0.000007715384,0.0000053810095,0.000005690687,0.000009443544,0.9970477,0.0000487657,0.0016681544,0.000052619336,0.000996626],"study_design_scores_gemma":[0.000005505663,0.0000069806165,0.000015782181,0.0000015104994,0.0000012281363,8.689833e-7,0.0000037347731,0.9991843,0.000032344848,0.00071459595,0.00003194257,0.0000011817846],"about_ca_topic_score_codex":0.016130548,"about_ca_topic_score_gemma":0.010625002,"teacher_disagreement_score":0.016130548,"about_ca_system_score_codex":0.0031592625,"about_ca_system_score_gemma":0.002757519,"threshold_uncertainty_score":0.03207332},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06911109,0.0019316961,0.9138704,0.0038515227,0.0006969137,0.000104427985,0.00009466728,0.0001167954,0.010222482],"genre_scores_gemma":[0.84843135,0.0027421408,0.12117394,0.0007594239,0.0012908814,0.00024062472,0.00022016496,0.0001395421,0.025001967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989292,0.00042595103,0.00006164091,0.00017163854,0.000271918,0.0001396378],"domain_scores_gemma":[0.9905089,0.0070628924,0.0005210754,0.00017363639,0.0009676217,0.0007658604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00486131,0.0011216155,0.0015774643,0.0021935648,0.0015916124,0.0037188209,0.002557807,0.004188908,0.0032680302],"category_scores_gemma":[0.019290993,0.0008303741,0.0016889009,0.001955653,0.0032184706,0.004585161,0.0023979764,0.0036600465,0.00028438153],"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.000099494035,0.00016917728,0.00055599585,0.00013308226,0.00004850645,0.00046961545,0.00026386173,0.18349414,0.0029059371,0.8009896,0.002497378,0.008373234],"study_design_scores_gemma":[0.000023402981,0.000027018146,0.00009600595,0.000009198732,0.000013030927,0.0000681916,0.000037216585,0.88675326,0.0002116685,0.1121226,0.00062113383,0.000017220224],"about_ca_topic_score_codex":0.0060342858,"about_ca_topic_score_gemma":0.0031709867,"teacher_disagreement_score":0.0060342858,"about_ca_system_score_codex":0.002672983,"about_ca_system_score_gemma":0.0033794122,"threshold_uncertainty_score":0.02570939},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71382564,0.00026597013,0.28411952,0.00019875268,0.000027583643,0.000028823699,0.00013868546,0.00037628895,0.0010187065],"genre_scores_gemma":[0.99129117,0.00009888445,0.008091369,0.000014101243,0.000027290649,0.000007340305,0.00010357044,0.000018115976,0.00034813237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990482,0.00026021004,0.000040549385,0.00017719199,0.00023763179,0.00023632123],"domain_scores_gemma":[0.985844,0.011721358,0.0009511577,0.00052162545,0.0006392812,0.00032256887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002418676,0.0007102516,0.000871636,0.0014950437,0.00052846404,0.0015321677,0.0012722034,0.0015006312,0.0007902258],"category_scores_gemma":[0.015246646,0.0007341351,0.00033898896,0.00095241994,0.0011181303,0.0026288482,0.0012352638,0.0010913481,0.00023387678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073178316,0.00010801602,0.023657935,0.000039068425,0.000046870624,0.00022161778,0.000060451817,0.948767,0.003650556,0.0033927446,0.00044434424,0.0188796],"study_design_scores_gemma":[0.0000051402044,0.000027051028,0.0019065439,0.0000017796289,0.0000066352304,0.00004274255,0.000017900777,0.99516284,0.00085579156,0.001941007,0.000025891757,0.0000066079124],"about_ca_topic_score_codex":0.0050511886,"about_ca_topic_score_gemma":0.0026050704,"teacher_disagreement_score":0.0050511886,"about_ca_system_score_codex":0.00092634204,"about_ca_system_score_gemma":0.0007405984,"threshold_uncertainty_score":0.012791395},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20418611,0.0012016057,0.7850488,0.0006263865,0.00014777343,0.00013135523,0.00010787319,0.00034402485,0.008206031],"genre_scores_gemma":[0.9856902,0.0002765401,0.011126709,0.000044920907,0.00003192982,0.0000525089,0.000038173832,0.00003819299,0.0027006438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985203,0.0005461156,0.00004654097,0.00016104535,0.00037328363,0.00035267643],"domain_scores_gemma":[0.99613464,0.0024554909,0.0002991222,0.00017566585,0.00068416423,0.0002509848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033111495,0.00088042463,0.0009089382,0.00076961704,0.0007835399,0.0020433122,0.0017124187,0.0009709991,0.0034056585],"category_scores_gemma":[0.0076078884,0.00057732774,0.0006790539,0.0007119485,0.0014027915,0.0025285303,0.0010608556,0.0008532124,0.00019878906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001477738,0.00004698824,0.00063532783,0.000051588526,0.00004732639,0.00011413762,0.00011755976,0.92493904,0.0025426408,0.06498158,0.0005697541,0.0058062808],"study_design_scores_gemma":[0.000006417045,0.000021723783,0.00008037513,0.000002478022,0.000008149784,0.0000053421036,0.000013488887,0.9945311,0.00014668624,0.005075175,0.00010440252,0.000004727978],"about_ca_topic_score_codex":0.014666734,"about_ca_topic_score_gemma":0.004368463,"teacher_disagreement_score":0.014666734,"about_ca_system_score_codex":0.004376085,"about_ca_system_score_gemma":0.0020658763,"threshold_uncertainty_score":0.031750858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55985266,0.00076998933,0.37541533,0.0021320125,0.00019423908,0.0004634045,0.0018368915,0.0019551846,0.057380263],"genre_scores_gemma":[0.9612819,0.00035630318,0.026804352,0.00014039219,0.000044950506,0.00030904418,0.0005450952,0.00009351449,0.010424554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992742,0.00024610414,0.00003596309,0.00011614,0.00013923767,0.00018836035],"domain_scores_gemma":[0.99859756,0.0006886827,0.00015372026,0.000095036165,0.00025204243,0.00021307616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077687984,0.0007847815,0.0010444989,0.0007649318,0.0010560217,0.0021042859,0.0022867576,0.0030298147,0.007607118],"category_scores_gemma":[0.002638238,0.0005741967,0.0007105586,0.00101237,0.0013072995,0.0016791902,0.0011121909,0.0015097938,0.00075111055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036953486,0.00003089706,0.0004435002,0.000012799804,0.00000926114,0.000063419684,0.00005449613,0.9918888,0.0005092646,0.0060335067,0.00019764398,0.0007194296],"study_design_scores_gemma":[0.000014842127,0.000013876707,0.00010132766,0.0000030899284,0.000005069307,0.0000118107955,0.00001879733,0.9978091,0.00020792414,0.0013270292,0.0004805684,0.0000066651114],"about_ca_topic_score_codex":0.04036489,"about_ca_topic_score_gemma":0.012569024,"teacher_disagreement_score":0.04036489,"about_ca_system_score_codex":0.0024477537,"about_ca_system_score_gemma":0.0027250345,"threshold_uncertainty_score":0.08025986},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25878465,0.0036238327,0.6825225,0.0022308258,0.0004216634,0.00010649168,0.00018472692,0.00037514625,0.051750187],"genre_scores_gemma":[0.9805444,0.0008097139,0.012257925,0.00015476492,0.00019571302,0.000036739628,0.0000627218,0.00004366069,0.005894427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919707,0.00026722025,0.000018309316,0.000051209397,0.00026872626,0.0001974911],"domain_scores_gemma":[0.9977314,0.0015965312,0.00016124563,0.000069083144,0.0003438893,0.00009786778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016141958,0.00061200256,0.0004905917,0.0009398508,0.00095103483,0.0016350751,0.00079880306,0.00081689795,0.004811885],"category_scores_gemma":[0.004972922,0.00031589073,0.00058190833,0.0007472357,0.0011651369,0.0017977554,0.00062854105,0.00085129705,0.0003144029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012997846,0.000080222635,0.0014064292,0.000076883545,0.00004014666,0.0001754998,0.00022517369,0.6912961,0.003185191,0.2873876,0.0026323302,0.013364344],"study_design_scores_gemma":[0.0000055019896,0.000020264648,0.00024977542,0.000006489237,0.000005721818,0.000019325656,0.000027212613,0.97468024,0.00016686814,0.024168637,0.0006449779,0.000004896049],"about_ca_topic_score_codex":0.012029766,"about_ca_topic_score_gemma":0.004149941,"teacher_disagreement_score":0.012029766,"about_ca_system_score_codex":0.0023039181,"about_ca_system_score_gemma":0.0014279485,"threshold_uncertainty_score":0.023919463},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62332016,0.00016075367,0.37478283,0.00032543662,0.00004159122,0.00010914087,0.000044285916,0.00020687985,0.0010089545],"genre_scores_gemma":[0.9811633,0.00005138258,0.017761445,0.000025781823,0.000015143189,0.00003744881,0.000022568322,0.000012748001,0.00091018627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905986,0.000361768,0.00003513832,0.00018335624,0.000135004,0.00022479572],"domain_scores_gemma":[0.9965513,0.0021527053,0.0004554429,0.00022773742,0.0002540042,0.00035879327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002387926,0.0005779204,0.001085591,0.00051987567,0.0008552941,0.0009780597,0.0015360102,0.0008606969,0.00083598756],"category_scores_gemma":[0.0065441206,0.00046336267,0.00034859095,0.0006855231,0.0016973895,0.001242189,0.0013091572,0.00065474526,0.00010450173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004183963,0.000074009506,0.0010450785,0.000034397897,0.000019954756,0.000073408286,0.00006333817,0.9782366,0.002974481,0.010734147,0.00023639042,0.006089808],"study_design_scores_gemma":[0.000023270277,0.000053649626,0.00016969827,0.0000012029782,0.000004316618,0.0000072099097,0.00002418863,0.995758,0.00054741354,0.0033570263,0.000049387883,0.0000047254166],"about_ca_topic_score_codex":0.004402825,"about_ca_topic_score_gemma":0.0036153605,"teacher_disagreement_score":0.004402825,"about_ca_system_score_codex":0.0022374282,"about_ca_system_score_gemma":0.0014716625,"threshold_uncertainty_score":0.016233742},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02595657,0.00014400182,0.9722916,0.00012536319,0.000038633534,0.000022839567,0.000042641863,0.00007064166,0.0013076438],"genre_scores_gemma":[0.9107965,0.0006387998,0.08241849,0.0002145938,0.00018237716,0.00013307403,0.00015066096,0.000040715076,0.005424762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995203,0.00013853503,0.000018662091,0.00007076514,0.00019102363,0.000060642462],"domain_scores_gemma":[0.998771,0.0006323036,0.00019588017,0.000121420344,0.00021732328,0.00006212661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001225944,0.0005066103,0.0005856926,0.0008509334,0.00042702106,0.00071288744,0.001323311,0.0011534304,0.0013198233],"category_scores_gemma":[0.0040528304,0.00028539792,0.0007008788,0.00080100243,0.0009818878,0.001192814,0.000729519,0.0011238498,0.00030933798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000731631,0.00008451215,0.0014725125,0.00008395017,0.000043408432,0.00030869202,0.00015024583,0.6337842,0.008495458,0.33904776,0.0011871496,0.015268869],"study_design_scores_gemma":[0.0000022684053,0.000007716753,0.00009384492,0.0000024267881,0.000004394073,0.000022061362,0.000003815519,0.987721,0.00018469903,0.011768546,0.00018397246,0.0000051946654],"about_ca_topic_score_codex":0.0024581824,"about_ca_topic_score_gemma":0.0018781876,"teacher_disagreement_score":0.0024581824,"about_ca_system_score_codex":0.00067288073,"about_ca_system_score_gemma":0.00065337296,"threshold_uncertainty_score":0.0064834952},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9383409,0.0013721371,0.04019615,0.00036106462,0.00023569599,0.00029240001,0.001080769,0.0027459103,0.015374968],"genre_scores_gemma":[0.99303985,0.00012510423,0.0043304875,0.00005220241,0.000021697273,0.00003498706,0.0005452631,0.00012329359,0.0017271459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961331,0.0010439608,0.00019074211,0.0004124775,0.0014851271,0.00073454785],"domain_scores_gemma":[0.9899805,0.00418493,0.0007463402,0.000663558,0.003529803,0.0008948347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028736426,0.0012287479,0.0012065696,0.0014076105,0.0010504483,0.0015833593,0.001468812,0.0013347658,0.007230073],"category_scores_gemma":[0.009163231,0.00017100121,0.00042399953,0.0012095447,0.00047225828,0.0012191951,0.0009768946,0.0009830733,0.0012021173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008304369,0.0016381468,0.025951855,0.000748435,0.00047224405,0.0008437702,0.0003716084,0.7154191,0.071391195,0.0034417931,0.0106464075,0.16077106],"study_design_scores_gemma":[0.0002523514,0.0051178904,0.031798374,0.00006634648,0.0003571226,0.0006316346,0.0010140359,0.8528846,0.09756851,0.0012025483,0.008866951,0.00023956351],"about_ca_topic_score_codex":0.0070616254,"about_ca_topic_score_gemma":0.0038279973,"teacher_disagreement_score":0.007230073,"about_ca_system_score_codex":0.002569488,"about_ca_system_score_gemma":0.0012679404,"threshold_uncertainty_score":0.024187028},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14303394,0.00019300218,0.85351825,0.00011776427,0.000039367314,0.000046873196,0.00019112437,0.0002480214,0.0026116706],"genre_scores_gemma":[0.959895,0.00021928878,0.038245518,0.000021147574,0.000036992984,0.00006437782,0.00010761257,0.000020285219,0.0013898346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957937,0.00015755233,0.000015619475,0.000052608706,0.00013884374,0.00005607099],"domain_scores_gemma":[0.99890745,0.0006898112,0.00012791716,0.00009525387,0.00015197476,0.000027627611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069892773,0.0004344795,0.00035017592,0.00041650698,0.000296035,0.0006041716,0.0007882896,0.0006486758,0.0006445242],"category_scores_gemma":[0.0031613652,0.00019891514,0.00034001775,0.00059424713,0.0002836653,0.00070135284,0.00039387116,0.00058610976,0.00015096246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032167543,0.000014829426,0.0010877153,0.000013205246,0.000010156786,0.0000736151,0.000042104086,0.9770115,0.0013459381,0.012201646,0.00015496743,0.008012031],"study_design_scores_gemma":[7.389771e-7,0.000003955707,0.00008424692,5.515283e-7,0.000001277993,0.0000075353896,0.0000020004036,0.9982424,0.00015462906,0.0014194804,0.00008219331,0.0000010400865],"about_ca_topic_score_codex":0.0053607505,"about_ca_topic_score_gemma":0.0022449049,"teacher_disagreement_score":0.0053607505,"about_ca_system_score_codex":0.0006600303,"about_ca_system_score_gemma":0.00043971738,"threshold_uncertainty_score":0.010659099},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17478043,0.00030037854,0.8132524,0.0008782244,0.00008792389,0.00006867073,0.00028194682,0.0010474506,0.0093026],"genre_scores_gemma":[0.83401185,0.0001560252,0.16200964,0.00011076628,0.000060666553,0.00008769407,0.0003157057,0.00011493248,0.0031327382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996469,0.000081459795,0.000013921264,0.000046703273,0.00009633497,0.000114733855],"domain_scores_gemma":[0.99851197,0.0009840659,0.000116086165,0.00014563483,0.00014125509,0.00010102077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009979117,0.0005334503,0.00071909773,0.0005864277,0.00066279725,0.0010363824,0.0011153053,0.0007366942,0.0044907928],"category_scores_gemma":[0.0039611035,0.00034393175,0.00039093505,0.000707872,0.0007389988,0.0011667997,0.0011059942,0.0011944387,0.00054641056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116016185,0.000037398353,0.0011577525,0.00007026156,0.00001725835,0.00016483958,0.00011349546,0.9066408,0.0014198404,0.06677595,0.0016519076,0.021834534],"study_design_scores_gemma":[0.000006155136,0.0000025916424,0.000048504106,0.0000013533463,0.0000011400318,0.000006226764,0.0000064473597,0.9908635,0.00012907626,0.008802363,0.00013077912,0.0000018463383],"about_ca_topic_score_codex":0.00979336,"about_ca_topic_score_gemma":0.010653571,"teacher_disagreement_score":0.00979336,"about_ca_system_score_codex":0.0013033877,"about_ca_system_score_gemma":0.0015011679,"threshold_uncertainty_score":0.019472718},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019180365,0.109176464,0.018172884,0.13097817,0.104153775,0.000497265,0.0037705614,0.0029637278,0.6283692],"genre_scores_gemma":[0.009022274,0.03477429,0.005987672,0.0043169376,0.0049263984,0.00018306774,0.0021389453,0.0005966567,0.93805367],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971058,0.00032107127,0.000120911245,0.00032491452,0.0014785952,0.00064880017],"domain_scores_gemma":[0.99244624,0.00038196633,0.00011083135,0.00037814182,0.0050127455,0.0016700206],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0054569165,0.0019946832,0.0016202534,0.002685922,0.0061912173,0.011016781,0.004107906,0.0049135564,0.3101378],"category_scores_gemma":[0.009693067,0.0008158,0.0008343525,0.003347021,0.0023071342,0.006601144,0.0037343842,0.0035375317,0.099551335],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000021063011,0.000019994253,0.00011392899,0.00006973949,0.0000024412311,0.000030376732,0.000076499615,0.00014230155,0.00010509824,0.0068199555,0.9503814,0.04221716],"study_design_scores_gemma":[0.0000028720708,0.0000045664956,0.00017503186,0.000095911564,0.0000021305327,0.000017307015,0.00011785505,0.00022317511,0.000033963657,0.00089016324,0.9984285,0.000008513821],"about_ca_topic_score_codex":0.4774646,"about_ca_topic_score_gemma":0.53984153,"teacher_disagreement_score":0.9778532,"about_ca_system_score_codex":0.022146793,"about_ca_system_score_gemma":0.046274252,"threshold_uncertainty_score":0.9840047},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13695636,0.0067215897,0.8001552,0.00609629,0.0005497285,0.000080709935,0.0005403048,0.00088122545,0.048018556],"genre_scores_gemma":[0.9396702,0.0049083154,0.045280695,0.0011578859,0.0010627896,0.00019553892,0.0002662483,0.00035369993,0.0071046087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977755,0.0005621451,0.00006345368,0.0005431491,0.00061904057,0.0004367748],"domain_scores_gemma":[0.978219,0.01675243,0.0012431018,0.0021481917,0.0012088374,0.00042857043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004077588,0.0012902982,0.0010938976,0.0017085546,0.0011548244,0.0020872997,0.001418855,0.0012370781,0.005813758],"category_scores_gemma":[0.029697925,0.0006114434,0.00058722915,0.0013251833,0.003576637,0.006893048,0.0017510251,0.0036840339,0.0012329556],"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.00018897567,0.000112045775,0.0021757793,0.00019698168,0.0000500687,0.0002613273,0.00028520275,0.2169194,0.009206988,0.7358662,0.0048681353,0.029868918],"study_design_scores_gemma":[0.000020301422,0.000040527735,0.0012499456,0.000044271183,0.0000154298,0.00012389511,0.00006752538,0.62694377,0.0016231359,0.36674115,0.0030923663,0.000037618178],"about_ca_topic_score_codex":0.0036011382,"about_ca_topic_score_gemma":0.0013892144,"teacher_disagreement_score":0.005813758,"about_ca_system_score_codex":0.002562935,"about_ca_system_score_gemma":0.00097199465,"threshold_uncertainty_score":0.021564603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6475276,0.0011107711,0.33606136,0.001224856,0.00013437557,0.00010944218,0.00026234693,0.00065161823,0.012917585],"genre_scores_gemma":[0.9952531,0.000106692794,0.0038333184,0.000039883704,0.000017866103,0.000013643764,0.000040167277,0.000018032299,0.0006773808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997938,0.00061254814,0.000057777474,0.00021599265,0.0004820043,0.000693621],"domain_scores_gemma":[0.9922416,0.0045456532,0.0009713604,0.00027674675,0.0014837541,0.00048092913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004038043,0.00078441174,0.0010264218,0.0011358302,0.0009542915,0.0017720314,0.0013347607,0.0011992473,0.0021047746],"category_scores_gemma":[0.013267157,0.00038474367,0.0004885191,0.0008827557,0.0014657995,0.0018245548,0.0010265822,0.0010031058,0.00019375852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016778972,0.000052455045,0.0012521476,0.000037955877,0.000022885775,0.00006111831,0.00007994513,0.9647226,0.0023203648,0.027377892,0.00053797883,0.003367016],"study_design_scores_gemma":[0.000005135067,0.00003290729,0.0001509222,0.0000022718718,0.000004807375,0.000008092645,0.000013691515,0.9984497,0.0002005425,0.0010821434,0.00004390985,0.000005986088],"about_ca_topic_score_codex":0.01925038,"about_ca_topic_score_gemma":0.005493889,"teacher_disagreement_score":0.01925038,"about_ca_system_score_codex":0.0042586694,"about_ca_system_score_gemma":0.0031121697,"threshold_uncertainty_score":0.038276672},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2783399,0.0005293813,0.714866,0.0010649718,0.00007357526,0.00004413545,0.000093519084,0.00018778822,0.00480079],"genre_scores_gemma":[0.9905505,0.00015840562,0.007842758,0.000052143005,0.00005051633,0.000018080736,0.000023920938,0.000020915655,0.0012826787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981604,0.00080875505,0.00006232724,0.00027964078,0.00034532475,0.00034355457],"domain_scores_gemma":[0.98672545,0.008953188,0.0018804049,0.00055006176,0.0012095914,0.00068135164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050189085,0.0007004534,0.0012321015,0.00080465846,0.00059259357,0.0025801642,0.001811923,0.001226535,0.0010081587],"category_scores_gemma":[0.014654411,0.00060498435,0.00060327427,0.00072700175,0.0018469704,0.0030409591,0.0015923057,0.0012514305,0.00019940337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017847006,0.000062780455,0.0017330886,0.000046800375,0.000066808934,0.0005114989,0.00014181742,0.8257896,0.0020719587,0.16029246,0.0010698215,0.008034856],"study_design_scores_gemma":[0.000009700751,0.000021238217,0.00017656847,0.0000030152635,0.000005489174,0.00004698483,0.000019481162,0.9667566,0.00020929407,0.032613732,0.00012938197,0.000008554076],"about_ca_topic_score_codex":0.0014721181,"about_ca_topic_score_gemma":0.0007722538,"teacher_disagreement_score":0.0050189085,"about_ca_system_score_codex":0.0019050853,"about_ca_system_score_gemma":0.0008702728,"threshold_uncertainty_score":0.026542842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84513855,0.001682662,0.1286833,0.0009016731,0.00009492962,0.00013927202,0.00014644298,0.0002749865,0.022938233],"genre_scores_gemma":[0.99422306,0.00023538158,0.0035688763,0.000035387144,0.000018736437,0.000014218833,0.000030156494,0.00001877928,0.0018554283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975501,0.0011519424,0.00005866922,0.00022615216,0.00050206116,0.0005111906],"domain_scores_gemma":[0.9836594,0.011268318,0.0010087483,0.00054381415,0.0028231617,0.00069647026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037400154,0.001025275,0.0008831873,0.0011916237,0.00084302056,0.0022172935,0.0012644592,0.0012995234,0.004484921],"category_scores_gemma":[0.017477086,0.00034125033,0.0004547035,0.001501183,0.00087787845,0.0026028114,0.0008821237,0.00089419505,0.0004123596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010299119,0.0004068473,0.007775548,0.00023849298,0.0001255361,0.00047264638,0.0005622058,0.84431404,0.016248709,0.076601535,0.0028939506,0.04933061],"study_design_scores_gemma":[0.00001740048,0.00037844133,0.0009880554,0.000012617777,0.000035255885,0.00010489591,0.00015732406,0.9928468,0.0014986019,0.0035718677,0.000371532,0.000017224942],"about_ca_topic_score_codex":0.011070432,"about_ca_topic_score_gemma":0.004887425,"teacher_disagreement_score":0.011070432,"about_ca_system_score_codex":0.003944348,"about_ca_system_score_gemma":0.0011980052,"threshold_uncertainty_score":0.028618395},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016487369,0.00021235402,0.99686795,0.00011293708,0.000021570231,0.000025523766,0.000049284707,0.00038326439,0.0006783272],"genre_scores_gemma":[0.14062558,0.0025540767,0.8531642,0.000118184704,0.00023085834,0.000489688,0.00043680394,0.00029344345,0.0020871814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864024,0.0006059152,0.0000961554,0.00014619181,0.0004561126,0.000055414537],"domain_scores_gemma":[0.9981178,0.0010365581,0.00020743243,0.00033117464,0.00027089196,0.000036208803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019094605,0.0010508888,0.0008757113,0.0014395693,0.00042426414,0.002094528,0.0015553123,0.0012884788,0.0015157603],"category_scores_gemma":[0.008188769,0.00048938853,0.00077641546,0.0020918278,0.00088656694,0.0036469395,0.0010312913,0.0016444096,0.0010365014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032176613,0.00010301063,0.0015972411,0.00019220066,0.00009661665,0.000060374838,0.00013518377,0.6655043,0.0026642147,0.18758218,0.003672758,0.13835981],"study_design_scores_gemma":[0.0000061156306,0.000014668075,0.00010881075,0.000022127339,0.000010218447,0.000053154934,0.000010647231,0.9420021,0.0010243049,0.053161964,0.003574359,0.000011449445],"about_ca_topic_score_codex":0.0021936628,"about_ca_topic_score_gemma":0.0010799922,"teacher_disagreement_score":0.0021936628,"about_ca_system_score_codex":0.0008129633,"about_ca_system_score_gemma":0.0011184509,"threshold_uncertainty_score":0.010098338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95733917,0.00018348357,0.03916357,0.00019166025,0.000033157463,0.00006725598,0.00007532449,0.00023459514,0.0027117208],"genre_scores_gemma":[0.99823725,0.000023585673,0.0013411673,0.0000052147384,0.000005741823,0.0000069746516,0.000026990017,0.00000463145,0.0003484417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998509,0.0006043961,0.000067105015,0.0001665824,0.00024695753,0.00040593473],"domain_scores_gemma":[0.9959824,0.0021648773,0.00032718753,0.00018004954,0.0009881904,0.00035725263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026801839,0.00069318246,0.00090317824,0.0009098146,0.0010491922,0.0013636104,0.0008970855,0.00087711005,0.0023559749],"category_scores_gemma":[0.0038283751,0.00028395184,0.0006390918,0.0011149973,0.00082773244,0.0009949853,0.0006611257,0.0006549325,0.0001810747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010374753,0.00028788173,0.0042718183,0.000069145724,0.00006289543,0.00017916934,0.000060560407,0.97640663,0.0050124032,0.0025959762,0.0003919596,0.009624149],"study_design_scores_gemma":[0.000012221981,0.00021704429,0.0012571453,0.0000014279306,0.000023618639,0.000015257733,0.0000270811,0.99705136,0.001172516,0.00018321691,0.00003225263,0.000006918854],"about_ca_topic_score_codex":0.016485693,"about_ca_topic_score_gemma":0.004299839,"teacher_disagreement_score":0.016485693,"about_ca_system_score_codex":0.0024887447,"about_ca_system_score_gemma":0.0018236802,"threshold_uncertainty_score":0.032779455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050850827,0.0013951069,0.93977517,0.0011234293,0.00009039589,0.000061936924,0.000044405966,0.000079317106,0.006579415],"genre_scores_gemma":[0.9451331,0.0027708476,0.04927449,0.00018094303,0.00016995674,0.00007496594,0.000035057474,0.000048692582,0.0023121233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986833,0.0009015752,0.00004239613,0.00008343211,0.0001865887,0.00010278702],"domain_scores_gemma":[0.9926031,0.006211376,0.00060898834,0.00020202708,0.0002722715,0.00010220333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040557766,0.0008316499,0.0006936739,0.000813186,0.0006160858,0.0015054725,0.00093423954,0.0009871898,0.0014805879],"category_scores_gemma":[0.010898065,0.00047626407,0.000851982,0.0009196019,0.00175362,0.0023355624,0.0009903187,0.0013150946,0.00013927014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004165205,0.000039186063,0.0007261819,0.00005556274,0.000026420415,0.000075062264,0.00007137671,0.7883575,0.0006155111,0.20139179,0.00041973626,0.0081799785],"study_design_scores_gemma":[0.000007940638,0.000026860682,0.0001375505,0.000011321205,0.000006992595,0.000024999115,0.000020937661,0.960153,0.00012631218,0.039063107,0.0004129184,0.000008136965],"about_ca_topic_score_codex":0.004637816,"about_ca_topic_score_gemma":0.0033260917,"teacher_disagreement_score":0.004637816,"about_ca_system_score_codex":0.0017143812,"about_ca_system_score_gemma":0.0013689265,"threshold_uncertainty_score":0.021449268},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10516458,0.0010689195,0.89140505,0.000573962,0.00016494373,0.000048995505,0.00018859562,0.0007195657,0.0006653752],"genre_scores_gemma":[0.9031256,0.0007781089,0.09320115,0.0001116009,0.00018331254,0.000109645836,0.0003451471,0.00006476957,0.0020807036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999181,0.00020195424,0.000050170238,0.00012588414,0.00029205644,0.00014897963],"domain_scores_gemma":[0.98993534,0.0069039445,0.0009982785,0.00036781566,0.0014234805,0.0003712781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029122962,0.0010160587,0.0010088034,0.0010015215,0.00046538113,0.0010981843,0.0011883044,0.00068254065,0.0010748872],"category_scores_gemma":[0.013025217,0.0005632975,0.0005356429,0.0010137584,0.00068402203,0.001537177,0.00082787365,0.0027966364,0.00029022008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010985928,0.000070536,0.0036500324,0.000043527223,0.000023506384,0.00003429467,0.000041325944,0.9673632,0.0007548336,0.004149687,0.0005609263,0.023198236],"study_design_scores_gemma":[0.000003616796,0.000019724837,0.0001836061,0.0000022867805,0.000003826548,0.0000029473804,0.0000024219785,0.9986254,0.00032692237,0.0007280554,0.00009616947,0.0000050418994],"about_ca_topic_score_codex":0.009763695,"about_ca_topic_score_gemma":0.008201618,"teacher_disagreement_score":0.009763695,"about_ca_system_score_codex":0.0010227467,"about_ca_system_score_gemma":0.0026316226,"threshold_uncertainty_score":0.01941371},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56290877,0.0016629698,0.37252063,0.0003817713,0.0001389203,0.00009977561,0.00019732787,0.0005609168,0.06152892],"genre_scores_gemma":[0.9850032,0.00053670513,0.009473486,0.00003364273,0.000047362028,0.000025528561,0.0000614297,0.00003566284,0.0047831764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979626,0.0005363599,0.00005751216,0.00017137894,0.000624567,0.000647597],"domain_scores_gemma":[0.9954104,0.0025259359,0.00057806814,0.00038452353,0.0008169952,0.0002840759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019707303,0.00035887907,0.000719714,0.0008841622,0.0009917448,0.0014963946,0.00091345405,0.00034106558,0.0057351766],"category_scores_gemma":[0.005642735,0.00036969077,0.00039770265,0.00066787313,0.0012242228,0.0016252254,0.00092614745,0.0005445612,0.00057199673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004860291,0.00015717132,0.004049971,0.00020915437,0.000051389103,0.00037754662,0.0003401418,0.6700282,0.013468068,0.28612077,0.0021031278,0.022608323],"study_design_scores_gemma":[0.000020133091,0.00009014253,0.0008895552,0.000016911375,0.000027043428,0.00015409007,0.0001028519,0.97225493,0.0029663043,0.02189116,0.0015609738,0.000025835208],"about_ca_topic_score_codex":0.0067786253,"about_ca_topic_score_gemma":0.0040689376,"teacher_disagreement_score":0.0067786253,"about_ca_system_score_codex":0.0020680025,"about_ca_system_score_gemma":0.0013320753,"threshold_uncertainty_score":0.01918614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096133195,0.0018698765,0.8842361,0.0027706854,0.0005630865,0.00019522113,0.0010159538,0.00058862014,0.012627403],"genre_scores_gemma":[0.95676214,0.0015177529,0.021401547,0.00031283658,0.00033551233,0.00017608187,0.00038811678,0.00012820143,0.01897786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976699,0.0004805545,0.00010577706,0.00053210114,0.0004927421,0.0007189452],"domain_scores_gemma":[0.9950943,0.0029756296,0.0005203032,0.00020154413,0.00084946444,0.00035883547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033254973,0.0014944986,0.0024142324,0.001700967,0.0018409806,0.004401843,0.0051268023,0.0035712048,0.0062207854],"category_scores_gemma":[0.009452407,0.0016466108,0.0014537042,0.0021885224,0.00238514,0.0040146,0.001776197,0.003379669,0.0010640809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011856117,0.00009851617,0.0008081368,0.00007237504,0.000049531136,0.00030727038,0.00021704387,0.84804213,0.0015805593,0.14233574,0.0019902322,0.0043799477],"study_design_scores_gemma":[0.000014130562,0.000015279815,0.00013350998,0.0000075375783,0.00001711477,0.000030419376,0.000022872186,0.9879661,0.00008851171,0.011338055,0.000347905,0.000018490198],"about_ca_topic_score_codex":0.053002123,"about_ca_topic_score_gemma":0.02581704,"teacher_disagreement_score":0.053002123,"about_ca_system_score_codex":0.0068929438,"about_ca_system_score_gemma":0.005653715,"threshold_uncertainty_score":0.10538721},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9671842,0.00021113215,0.029654965,0.00022195719,0.000019190877,0.000033642995,0.00008558534,0.00006393226,0.0025253468],"genre_scores_gemma":[0.9974043,0.00005119958,0.002283954,0.000012563088,0.0000024872982,0.000018307936,0.000024990117,0.000003859813,0.00019834217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995332,0.0001965347,0.000017738734,0.00004703882,0.000088837754,0.00011660665],"domain_scores_gemma":[0.99465936,0.003962434,0.00048104403,0.00020935631,0.00046590247,0.00022191825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012412138,0.00046413782,0.00064627046,0.0006649123,0.0005530474,0.0006371241,0.0008445603,0.0009544684,0.0008747335],"category_scores_gemma":[0.00473456,0.00031446043,0.00040705825,0.00070192857,0.0009648716,0.0010104631,0.00058725243,0.00093238195,0.000054463653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007971191,0.000052593983,0.0016060158,0.000013837487,0.000013036609,0.00005756126,0.00004751407,0.99334115,0.00065179967,0.003277866,0.00006767004,0.0007913055],"study_design_scores_gemma":[0.000009142722,0.00002967954,0.00016675147,0.0000021060373,0.0000043556074,0.000005687548,0.00001260755,0.9991146,0.00023482312,0.00039112655,0.000026267147,0.0000029494963],"about_ca_topic_score_codex":0.0103458995,"about_ca_topic_score_gemma":0.003723454,"teacher_disagreement_score":0.0103458995,"about_ca_system_score_codex":0.0010503487,"about_ca_system_score_gemma":0.000767976,"threshold_uncertainty_score":0.020571351},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084537186,0.0000986218,0.9976532,0.000040232895,0.000031524036,0.000023492206,0.000025305864,0.00006725744,0.0012150124],"genre_scores_gemma":[0.13819873,0.0012011084,0.8538969,0.00030981365,0.0006198357,0.0004733104,0.00030530192,0.00030030316,0.0046947375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998279,0.00055297377,0.00015253264,0.000247169,0.00063678005,0.00013151254],"domain_scores_gemma":[0.9976254,0.0013229887,0.00022235002,0.00041614243,0.00034984873,0.000063229214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037823427,0.0010577257,0.00086433435,0.0028817854,0.000672028,0.0014246412,0.0022189948,0.00094491336,0.0026723654],"category_scores_gemma":[0.009574997,0.00062956475,0.0019351222,0.00205702,0.0015456547,0.0030766889,0.0017290786,0.0025518446,0.001189897],"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.000012013104,0.00007629257,0.0006715203,0.000075298965,0.00003999647,0.00015912174,0.00016716546,0.07202837,0.0042073657,0.8730221,0.0017033308,0.047837418],"study_design_scores_gemma":[0.000015145288,0.000045642264,0.0003991877,0.000026788668,0.000028478045,0.00015236449,0.000022970757,0.6482987,0.0018678477,0.34178156,0.0073141996,0.000047148398],"about_ca_topic_score_codex":0.0020890068,"about_ca_topic_score_gemma":0.0014199561,"teacher_disagreement_score":0.0037823427,"about_ca_system_score_codex":0.0014902608,"about_ca_system_score_gemma":0.0017557291,"threshold_uncertainty_score":0.0200032},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2448925,0.0083756745,0.67659926,0.009572913,0.0010115114,0.000056736022,0.00019384678,0.00049940776,0.058798283],"genre_scores_gemma":[0.96631104,0.0017422267,0.026048677,0.00059813785,0.00079446356,0.000042452786,0.00004986353,0.00009593388,0.0043172305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989774,0.00030424184,0.000058949492,0.00020817098,0.00034478045,0.000106530184],"domain_scores_gemma":[0.9923052,0.0057112062,0.00057216815,0.00050206756,0.0006869319,0.0002224317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021139856,0.0003263387,0.0004884036,0.0006926318,0.0009450498,0.0011118869,0.00087334606,0.0009922264,0.0022379286],"category_scores_gemma":[0.010429061,0.0002216836,0.0006147786,0.00066930614,0.0021382123,0.002381323,0.0010607783,0.0023797804,0.00032748064],"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.000118934186,0.000035922974,0.0013148873,0.00012519304,0.00004532981,0.0005803084,0.0005887262,0.04633458,0.012997717,0.90779424,0.0031050716,0.026959147],"study_design_scores_gemma":[0.000021768616,0.00009756798,0.00087427563,0.000046317324,0.000028582312,0.0003020776,0.00007672724,0.39128506,0.0050259917,0.592891,0.009304406,0.000046268673],"about_ca_topic_score_codex":0.0019385988,"about_ca_topic_score_gemma":0.0009004728,"teacher_disagreement_score":0.0022379286,"about_ca_system_score_codex":0.0008215107,"about_ca_system_score_gemma":0.00053273863,"threshold_uncertainty_score":0.011179924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9659295,0.00021333546,0.030341981,0.0004565983,0.00003390944,0.000045817385,0.000041129897,0.000066561304,0.0028712421],"genre_scores_gemma":[0.9990305,0.000038672253,0.0006802543,0.000018606574,0.00000654469,0.0000061209457,0.00000855875,0.0000030306805,0.00020771242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658704,0.0014163464,0.00014035028,0.0003093874,0.0007112864,0.00083564717],"domain_scores_gemma":[0.97945994,0.015084908,0.002751345,0.00095232594,0.00086127257,0.0008902469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030940953,0.00053724926,0.00062250515,0.00067766424,0.0005407404,0.0016876856,0.0010594426,0.0016951995,0.0034773813],"category_scores_gemma":[0.021720514,0.0003750537,0.00086491846,0.0007220983,0.0023879919,0.0024439099,0.0021709558,0.0018280013,0.00018618545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005607179,0.0005303758,0.016743418,0.000101377154,0.00013694933,0.0005811059,0.00037278002,0.9126283,0.009614632,0.043636076,0.00043357685,0.014660746],"study_design_scores_gemma":[0.000060368904,0.00093820563,0.011934342,0.000014589908,0.00006295346,0.00012944416,0.00061546336,0.9583882,0.002768219,0.024476424,0.00054989243,0.000061806815],"about_ca_topic_score_codex":0.0055330675,"about_ca_topic_score_gemma":0.0023795099,"teacher_disagreement_score":0.0055330675,"about_ca_system_score_codex":0.0027368849,"about_ca_system_score_gemma":0.0011595124,"threshold_uncertainty_score":0.019857585},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042380787,0.00021598053,0.9547854,0.00019094748,0.00002794352,0.000038505794,0.00001549878,0.0001773107,0.0021676414],"genre_scores_gemma":[0.631339,0.00045130798,0.36592826,0.00007547193,0.00006410144,0.00016570088,0.00005417795,0.0001019686,0.0018199466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937373,0.0003585183,0.000028149616,0.00005073154,0.00013340154,0.000055476183],"domain_scores_gemma":[0.9945234,0.0046659824,0.00031044532,0.00013251806,0.0002479738,0.000119629025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019586848,0.00080167473,0.00052142923,0.002126034,0.0007716336,0.0010487684,0.00086349226,0.001045594,0.0014926994],"category_scores_gemma":[0.014943625,0.00057174306,0.00055177265,0.00094043615,0.0016429487,0.0020342313,0.00097368285,0.0009132622,0.0002373785],"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.000082033206,0.000093186034,0.0018051041,0.0001264429,0.000038536033,0.00015118925,0.0003381718,0.6550158,0.003584743,0.2964062,0.00079622027,0.04156236],"study_design_scores_gemma":[0.000006760843,0.000012899229,0.00009949967,0.000008689071,0.000002596551,0.000018176348,0.000017323264,0.9543958,0.00045779257,0.04479839,0.00017311232,0.000009029777],"about_ca_topic_score_codex":0.0016215383,"about_ca_topic_score_gemma":0.0013314227,"teacher_disagreement_score":0.002126034,"about_ca_system_score_codex":0.00080062816,"about_ca_system_score_gemma":0.0008297457,"threshold_uncertainty_score":0.010358632},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25534388,0.0036739125,0.7120124,0.003084881,0.00029976908,0.00008456032,0.00025623885,0.00077510567,0.024469199],"genre_scores_gemma":[0.9726964,0.0010654602,0.019519128,0.000294188,0.00025545585,0.00011803651,0.00018373106,0.00016844744,0.0056991805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991609,0.0002474187,0.000036269637,0.0001472007,0.00022712714,0.00018106186],"domain_scores_gemma":[0.9927174,0.004392864,0.0008881233,0.0004683548,0.0010616739,0.0004716164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029564546,0.00077868457,0.0011182261,0.0018525242,0.001042983,0.0018432804,0.0016311263,0.0013160105,0.0034307907],"category_scores_gemma":[0.023635311,0.00043236188,0.0012090966,0.0009692112,0.00273404,0.0035230317,0.0021026353,0.0023090919,0.00053153676],"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.00019162925,0.00009777724,0.004634418,0.0002363216,0.000119576616,0.0004867112,0.0006713333,0.24332911,0.006224529,0.72507256,0.0036361567,0.015299946],"study_design_scores_gemma":[0.000017262693,0.00002582132,0.00049344596,0.000023670558,0.000016852819,0.000054051463,0.000079807265,0.8432505,0.00044613003,0.15492363,0.00064684625,0.000021974874],"about_ca_topic_score_codex":0.007028116,"about_ca_topic_score_gemma":0.0027829292,"teacher_disagreement_score":0.007028116,"about_ca_system_score_codex":0.0020178594,"about_ca_system_score_gemma":0.001188455,"threshold_uncertainty_score":0.015635371},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14356294,0.0011213972,0.8472016,0.0016175245,0.00017297122,0.00023638169,0.00019036127,0.00035589273,0.0055408883],"genre_scores_gemma":[0.93708295,0.00054723636,0.055955503,0.00024983392,0.000096772645,0.00019601388,0.00017720423,0.000039414543,0.005655023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981384,0.00067187264,0.000086097425,0.00037017366,0.00018888625,0.0005444727],"domain_scores_gemma":[0.9957157,0.0028586185,0.00045898583,0.0001316379,0.00024668084,0.00058839034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031572988,0.0010674222,0.002277323,0.0008680765,0.0010066173,0.0018240806,0.0018360978,0.0019440257,0.0054573826],"category_scores_gemma":[0.0056278207,0.0011648268,0.0011441343,0.0006782719,0.0012956014,0.0018173221,0.0018785845,0.0014683078,0.0004832706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037171686,0.00010776226,0.0013791976,0.000070279835,0.000062190775,0.00013028643,0.000105317056,0.97270095,0.0009678516,0.009083808,0.00070622395,0.0143143935],"study_design_scores_gemma":[0.000039904735,0.00005650885,0.0003234357,0.000011338128,0.000016483875,0.000016799888,0.000036340534,0.9904268,0.0002599893,0.008552954,0.00024369288,0.000015723848],"about_ca_topic_score_codex":0.016171329,"about_ca_topic_score_gemma":0.013967244,"teacher_disagreement_score":0.016171329,"about_ca_system_score_codex":0.002278396,"about_ca_system_score_gemma":0.0033445612,"threshold_uncertainty_score":0.03215444},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3122256,0.0020690153,0.65837264,0.002392095,0.0001972961,0.00013175873,0.00031689007,0.0008587108,0.023435924],"genre_scores_gemma":[0.96109486,0.0013554337,0.025203843,0.00033349582,0.00021252473,0.00020331594,0.0002583604,0.00019261501,0.011145497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946815,0.00016649009,0.000019447509,0.00009046705,0.00011458202,0.00014084169],"domain_scores_gemma":[0.98948294,0.0063515147,0.0017781049,0.0007660918,0.0009788849,0.00064245827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033626966,0.00087380596,0.0006204909,0.0015165342,0.00081068696,0.0018576098,0.0022614067,0.0011933788,0.006398926],"category_scores_gemma":[0.023724727,0.0005196978,0.0010350376,0.0011345381,0.0030392637,0.0031050753,0.0018377091,0.0037772737,0.0008647108],"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.00018749037,0.00018430744,0.005981322,0.00022176368,0.00004273769,0.0006558546,0.0007357348,0.107732855,0.009702947,0.85491014,0.0038667535,0.015778264],"study_design_scores_gemma":[0.000028894308,0.00008276246,0.0022093323,0.00007141609,0.00002771339,0.00033861003,0.00017999898,0.7864692,0.0024983508,0.20664273,0.0013948596,0.000056143035],"about_ca_topic_score_codex":0.0027425976,"about_ca_topic_score_gemma":0.001996404,"teacher_disagreement_score":0.006398926,"about_ca_system_score_codex":0.0024089038,"about_ca_system_score_gemma":0.0012635292,"threshold_uncertainty_score":0.021406531},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1339063,0.0013210715,0.85547054,0.000804609,0.000227308,0.000103590624,0.00015233517,0.00056005665,0.007454156],"genre_scores_gemma":[0.9539844,0.00061833597,0.040441394,0.0000747592,0.00014424897,0.00006809449,0.00008031728,0.000026029735,0.004562473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994704,0.00013432818,0.000025037827,0.00007610751,0.00019337762,0.0001007287],"domain_scores_gemma":[0.9990558,0.00046356083,0.000094853895,0.00006232856,0.00021930909,0.00010421578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006726233,0.0004676295,0.00079149,0.0003916731,0.0006463656,0.0015133151,0.0013157417,0.0010596102,0.0024452563],"category_scores_gemma":[0.0023166155,0.0003570251,0.00054729276,0.0008810863,0.000480761,0.0010212103,0.0006239363,0.0009262732,0.00026647002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034104084,0.00024571607,0.00237434,0.00028510182,0.000079490885,0.0011744637,0.0003030883,0.8102564,0.015529005,0.12787893,0.0020581835,0.0394743],"study_design_scores_gemma":[0.000009949303,0.000026128111,0.00011559452,0.0000026122418,0.000008229277,0.00003264286,0.000008974261,0.9960322,0.00040038585,0.003033832,0.00032403244,0.0000054868915],"about_ca_topic_score_codex":0.0054764017,"about_ca_topic_score_gemma":0.0023915365,"teacher_disagreement_score":0.0054764017,"about_ca_system_score_codex":0.0015231465,"about_ca_system_score_gemma":0.0010671442,"threshold_uncertainty_score":0.011051297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.948956,0.0010971968,0.04225394,0.00027477546,0.00008474709,0.000038904604,0.0001579696,0.00040362423,0.0067328117],"genre_scores_gemma":[0.9968521,0.00018809852,0.0022057435,0.000015755064,0.000012726526,0.00000924097,0.00007260119,0.000015560274,0.0006283173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988789,0.00032897628,0.000047542148,0.00015976853,0.00028325903,0.00030155442],"domain_scores_gemma":[0.9955735,0.0024544918,0.00056733825,0.00034627994,0.0008054348,0.00025288266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001968239,0.000557555,0.00056895375,0.0007268965,0.00054949353,0.0011559322,0.00086555205,0.0006178445,0.0015874367],"category_scores_gemma":[0.008374836,0.0002624174,0.00027707778,0.0009520906,0.0007406672,0.0014788137,0.0006770829,0.00043225556,0.00025288475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003838195,0.000060446175,0.002205557,0.000052035157,0.00004657867,0.000073055104,0.00009407319,0.979607,0.0044940095,0.004458429,0.0006702242,0.007854842],"study_design_scores_gemma":[0.000019107083,0.00016281403,0.00065295486,0.000006509376,0.000016694032,0.000029633084,0.000037013142,0.9959812,0.0014415579,0.0014336007,0.00020784294,0.00001109066],"about_ca_topic_score_codex":0.008082801,"about_ca_topic_score_gemma":0.0028403332,"teacher_disagreement_score":0.008082801,"about_ca_system_score_codex":0.0018944048,"about_ca_system_score_gemma":0.00082615967,"threshold_uncertainty_score":0.016071498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9242538,0.0015471834,0.063111946,0.0004267527,0.00005269956,0.000041077154,0.000106684514,0.0002353713,0.010224455],"genre_scores_gemma":[0.99784863,0.00021841872,0.00144153,0.00001884122,0.00000938599,0.000007707095,0.000023436158,0.0000075827606,0.00042440742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992341,0.00028129973,0.000016093583,0.000053850465,0.00023606131,0.0001785545],"domain_scores_gemma":[0.9981699,0.0011207819,0.00022822915,0.00007030439,0.0003244292,0.000086345426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012624465,0.00058130745,0.00044636556,0.00064083835,0.0005343734,0.00092898385,0.0005602073,0.00056023506,0.0015227592],"category_scores_gemma":[0.0033685267,0.0002273839,0.00021481952,0.00067086145,0.0005974486,0.0007659321,0.0006001087,0.00042568104,0.00012685238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002206425,0.000040745843,0.0034634415,0.000056157343,0.00003431458,0.00015779486,0.000058012123,0.9706925,0.006451533,0.0067356275,0.00035178583,0.0117375],"study_design_scores_gemma":[0.0000026751827,0.000060182345,0.0006056789,0.0000030193532,0.000007732589,0.000025244019,0.000021892138,0.99784184,0.0007420161,0.0005995234,0.00008719796,0.0000030467486],"about_ca_topic_score_codex":0.007955711,"about_ca_topic_score_gemma":0.00449323,"teacher_disagreement_score":0.007955711,"about_ca_system_score_codex":0.0022305844,"about_ca_system_score_gemma":0.00055391074,"threshold_uncertainty_score":0.016184092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33146513,0.0007987376,0.6488269,0.0025197568,0.0002335352,0.00016034224,0.0005256482,0.00045476313,0.015015172],"genre_scores_gemma":[0.9875508,0.00018284451,0.0078549115,0.00009290575,0.000059731177,0.000055761022,0.00006356568,0.000015400803,0.004124135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893945,0.00029823984,0.00003807656,0.00019660499,0.0001897209,0.00033787717],"domain_scores_gemma":[0.9986406,0.000557915,0.00029608465,0.00008100243,0.00024746094,0.00017693655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013980191,0.00069970015,0.00111013,0.0005622633,0.0007471431,0.00180406,0.0015393595,0.0015295147,0.0020748314],"category_scores_gemma":[0.0030230684,0.0005041511,0.0007068952,0.0005887507,0.0014382825,0.0014488988,0.0008420355,0.0010534954,0.0002883633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016107017,0.00008372707,0.001061253,0.00004717838,0.000025914886,0.00024573412,0.00010142944,0.91316336,0.0026004817,0.07719268,0.0010554454,0.004261738],"study_design_scores_gemma":[0.000010996124,0.000012754243,0.00008124354,0.0000023639464,0.0000046222153,0.00000830544,0.000007744284,0.99566936,0.000114059796,0.0039593917,0.00012237692,0.000006834436],"about_ca_topic_score_codex":0.020533565,"about_ca_topic_score_gemma":0.005429685,"teacher_disagreement_score":0.020533565,"about_ca_system_score_codex":0.0026578028,"about_ca_system_score_gemma":0.0018215508,"threshold_uncertainty_score":0.04082811},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035071142,0.00044945074,0.9567791,0.0003836006,0.000115416165,0.00006772948,0.00008449392,0.00051012903,0.0065389248],"genre_scores_gemma":[0.97816604,0.00025538832,0.016478656,0.000068407695,0.00003988329,0.00009098815,0.000056054894,0.000035067485,0.0048095062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924767,0.0002004323,0.000028207172,0.00016276068,0.00019349372,0.00016750707],"domain_scores_gemma":[0.9990808,0.00041535305,0.0002064339,0.00005202773,0.00016830576,0.00007717999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012326257,0.0008616134,0.00067246624,0.00048444277,0.0005288258,0.001986247,0.0013697004,0.0006760126,0.0018706218],"category_scores_gemma":[0.0020841875,0.00033438727,0.00040604826,0.00048002877,0.0010620271,0.0009342494,0.0009950352,0.0010053373,0.00024426566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009014126,0.000037340513,0.00017208543,0.00004874959,0.00001557787,0.000061754035,0.00004124685,0.95829874,0.0027326578,0.02519162,0.0006639308,0.012646213],"study_design_scores_gemma":[0.000008925693,0.000016615382,0.00003762551,0.0000020594841,0.000002460887,0.000006314589,0.0000031527975,0.99575835,0.0002637703,0.0036482923,0.00024985892,0.0000025986892],"about_ca_topic_score_codex":0.0044681677,"about_ca_topic_score_gemma":0.0026241841,"teacher_disagreement_score":0.0044681677,"about_ca_system_score_codex":0.001821601,"about_ca_system_score_gemma":0.0007961137,"threshold_uncertainty_score":0.013216734},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036630765,0.010997296,0.73445237,0.0042238273,0.0020438803,0.00079556793,0.0021479013,0.004272138,0.20443635],"genre_scores_gemma":[0.8091358,0.00647818,0.10383248,0.0012604498,0.0008229691,0.0005731454,0.002824437,0.00044621155,0.07462637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989774,0.00018709256,0.000030240424,0.00008156945,0.0005787932,0.00014490909],"domain_scores_gemma":[0.99882203,0.0002520726,0.00010855072,0.00013770036,0.00060621137,0.00007335592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007435707,0.00057094963,0.00035894752,0.0010581012,0.0006261619,0.0017993709,0.0008997374,0.0012781413,0.017366694],"category_scores_gemma":[0.0033672974,0.00016080642,0.00026291827,0.0015504912,0.00032703322,0.0010639309,0.0007928824,0.0009460652,0.004941114],"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.00036203305,0.00026262892,0.0030260838,0.00042430827,0.00004383924,0.00036903057,0.00018602658,0.08542652,0.020441625,0.30885744,0.10556373,0.47503674],"study_design_scores_gemma":[0.00005100868,0.00016584503,0.002531547,0.0001160396,0.000021899948,0.0002602575,0.00014386664,0.7796849,0.0037207783,0.04470944,0.16854852,0.00004588761],"about_ca_topic_score_codex":0.0070571695,"about_ca_topic_score_gemma":0.0040066284,"teacher_disagreement_score":0.017366694,"about_ca_system_score_codex":0.002790205,"about_ca_system_score_gemma":0.0012647501,"threshold_uncertainty_score":0.058097422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7522397,0.00078259857,0.24069704,0.0011373735,0.00017933312,0.00021591946,0.0022072103,0.0006408226,0.0018999445],"genre_scores_gemma":[0.96274203,0.00045897486,0.032574903,0.000101263286,0.000105760606,0.00019228348,0.0012164123,0.00006624044,0.0025420638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958936,0.002471109,0.00015373006,0.0006544855,0.0003480534,0.00047891634],"domain_scores_gemma":[0.97610056,0.018309992,0.0019331147,0.0015770462,0.0014109425,0.0006683623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011910728,0.0019145199,0.0018545444,0.0020667787,0.0007181547,0.0029605322,0.0033575452,0.002415866,0.0024355853],"category_scores_gemma":[0.025260422,0.000976474,0.0033526914,0.0025847184,0.0010643278,0.0028096803,0.0012179594,0.0027326609,0.0005462044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051569927,0.00027490087,0.02703223,0.000049549988,0.00033274363,0.00012263388,0.000114042115,0.9551832,0.00035736602,0.006684093,0.0005685007,0.008765061],"study_design_scores_gemma":[0.000043458498,0.00011291741,0.0027611447,0.000007529582,0.00009128185,0.000012272303,0.00003545089,0.9942867,0.00015223505,0.0022926917,0.0001686331,0.000035766367],"about_ca_topic_score_codex":0.047936775,"about_ca_topic_score_gemma":0.033707123,"teacher_disagreement_score":0.047936775,"about_ca_system_score_codex":0.001956286,"about_ca_system_score_gemma":0.0019722343,"threshold_uncertainty_score":0.095315516},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3307731,0.00066472986,0.64728504,0.0006301106,0.00011912558,0.00021898179,0.00018980994,0.00032491673,0.01979422],"genre_scores_gemma":[0.98859847,0.00020726978,0.009581978,0.000029391527,0.000027208267,0.00002248278,0.000036983274,0.000033754837,0.0014625536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997113,0.0010510285,0.00008789307,0.00031920755,0.00077360106,0.0006553318],"domain_scores_gemma":[0.9945433,0.0033135759,0.0007523385,0.00054013275,0.0004989675,0.00035151473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036339525,0.0012565132,0.0007839862,0.0008680646,0.0005329588,0.0027910715,0.0019040058,0.001107224,0.003536046],"category_scores_gemma":[0.015016539,0.000579083,0.0008052268,0.001030485,0.0011288186,0.004310734,0.0010473457,0.0021650263,0.0004584855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041095828,0.00021263197,0.003880601,0.000081038874,0.00007381425,0.0001808026,0.00018152235,0.7101188,0.0063978825,0.2365962,0.0013034439,0.040562354],"study_design_scores_gemma":[0.000016483375,0.00014434007,0.0012601012,0.00001694936,0.00002919858,0.000094623705,0.00006798294,0.9409361,0.001909747,0.054729324,0.00076121057,0.000033922344],"about_ca_topic_score_codex":0.0024330332,"about_ca_topic_score_gemma":0.0019062355,"teacher_disagreement_score":0.0036339525,"about_ca_system_score_codex":0.0033170634,"about_ca_system_score_gemma":0.0016840092,"threshold_uncertainty_score":0.024067044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93955845,0.00055126555,0.04405353,0.0015074708,0.000023696515,0.000045546083,0.000053204603,0.000046525704,0.014160251],"genre_scores_gemma":[0.9975926,0.00011969351,0.0019277848,0.000056123514,0.000018393426,0.0000081551325,0.000008585276,0.0000057033944,0.00026286193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875474,0.00042622627,0.000039503822,0.00015783517,0.00019851452,0.0004232348],"domain_scores_gemma":[0.988887,0.0063646627,0.0022940596,0.00073285535,0.0006628927,0.0010586068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032180194,0.00061398867,0.000978681,0.00074558903,0.0007943075,0.002899618,0.0011497106,0.0012303096,0.003621193],"category_scores_gemma":[0.014152759,0.00037957338,0.0006152513,0.0012943298,0.002864699,0.005965261,0.0022999155,0.001153903,0.00018546291],"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.0013178573,0.00063620537,0.08056226,0.00037954992,0.00046901408,0.0011675223,0.0014027421,0.30527028,0.01980172,0.42045864,0.0016359828,0.16689833],"study_design_scores_gemma":[0.0000952354,0.0013101308,0.05293521,0.00016931859,0.00052889815,0.000660143,0.0031195055,0.48420078,0.008986952,0.44328672,0.004563953,0.00014319559],"about_ca_topic_score_codex":0.0022865594,"about_ca_topic_score_gemma":0.0017454652,"teacher_disagreement_score":0.003621193,"about_ca_system_score_codex":0.002506746,"about_ca_system_score_gemma":0.0015241774,"threshold_uncertainty_score":0.01818782},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38860118,0.00047089453,0.5955207,0.0010165373,0.00014709421,0.00014255772,0.00015938263,0.0004480805,0.013493625],"genre_scores_gemma":[0.98829925,0.000105794476,0.009388101,0.000037894424,0.000028287983,0.000049016024,0.000029434883,0.000015989966,0.0020463127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985393,0.00041975206,0.000056392662,0.00030161842,0.00024392654,0.0004390414],"domain_scores_gemma":[0.9972019,0.0012293236,0.00051101635,0.00012922667,0.0004935699,0.00043493428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018230729,0.0013538562,0.00128029,0.00072292733,0.0011952479,0.0025709,0.0024647205,0.0018322068,0.0038016778],"category_scores_gemma":[0.005216893,0.0009955391,0.0006083797,0.0006922243,0.0020264748,0.0014848772,0.0018979992,0.0015800776,0.00041456227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014982937,0.000055783286,0.00043396078,0.000023580653,0.000024622024,0.00009825103,0.00006524614,0.98052615,0.0015400681,0.012570347,0.00019868049,0.0043134815],"study_design_scores_gemma":[0.000023845849,0.000034006363,0.00008670522,0.0000021709357,0.0000072757634,0.0000045909596,0.000019613228,0.99563366,0.00016208188,0.003897977,0.00012242436,0.000005703633],"about_ca_topic_score_codex":0.018892083,"about_ca_topic_score_gemma":0.006884204,"teacher_disagreement_score":0.018892083,"about_ca_system_score_codex":0.003518821,"about_ca_system_score_gemma":0.0021418189,"threshold_uncertainty_score":0.037564218},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080778245,0.0006804004,0.97527266,0.0013584571,0.00029220822,0.00004800205,0.00013667066,0.000103913786,0.014029821],"genre_scores_gemma":[0.87749773,0.003921445,0.09194903,0.0012283546,0.0015081796,0.00032432613,0.00025515395,0.0000873979,0.023228345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808383,0.00066297356,0.00006923823,0.0003258961,0.0005748646,0.00028314022],"domain_scores_gemma":[0.9954118,0.0029295932,0.0005896238,0.0004010744,0.00041854312,0.00024939544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020675834,0.0011332387,0.0009769757,0.0009800751,0.0010263562,0.0021642272,0.0022234332,0.0020680644,0.004368764],"category_scores_gemma":[0.008233792,0.00044295428,0.00091284025,0.0010466235,0.0031316902,0.0037927006,0.00222125,0.0028387317,0.0007820104],"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.00001700411,0.000018530098,0.00031157705,0.000041046336,0.00003259057,0.000086195025,0.00007914696,0.20393172,0.0005058268,0.7880323,0.0018320103,0.005112081],"study_design_scores_gemma":[0.0000070593564,0.00003321754,0.00010829808,0.000012031984,0.000012121739,0.000048257956,0.000023172954,0.5855978,0.00019193647,0.4098574,0.004092102,0.00001662182],"about_ca_topic_score_codex":0.0027978679,"about_ca_topic_score_gemma":0.0011474561,"teacher_disagreement_score":0.004368764,"about_ca_system_score_codex":0.0019078662,"about_ca_system_score_gemma":0.0011819842,"threshold_uncertainty_score":0.01461494},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20316511,0.0011635879,0.78519845,0.0012090874,0.000090880516,0.00008269432,0.00019148248,0.00044307217,0.008455604],"genre_scores_gemma":[0.97555894,0.0010077467,0.018968713,0.00014580126,0.00017157385,0.00007683817,0.00014121762,0.00010933473,0.0038198822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987305,0.00036757128,0.000040121806,0.00023818869,0.00039952752,0.00022404433],"domain_scores_gemma":[0.9926408,0.005058266,0.00075558724,0.00048006937,0.00078738993,0.00027789953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045025973,0.0007845479,0.0011247183,0.0012395191,0.00095379294,0.0018983082,0.0023439496,0.0014017359,0.0031105117],"category_scores_gemma":[0.017579198,0.00058017933,0.00075148616,0.0011612627,0.0021934614,0.006049351,0.0014463079,0.0023151042,0.0005005391],"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.00015210116,0.000103826904,0.0040423432,0.00013443043,0.000045023615,0.000491698,0.00068071607,0.43277693,0.0051359343,0.54550755,0.0017796628,0.009149778],"study_design_scores_gemma":[0.000012710687,0.000022387467,0.00048667548,0.000011623151,0.000011823293,0.000081684266,0.00007411572,0.94279945,0.00032982882,0.05575248,0.0003946847,0.000022495073],"about_ca_topic_score_codex":0.00446641,"about_ca_topic_score_gemma":0.002077049,"teacher_disagreement_score":0.0045025973,"about_ca_system_score_codex":0.0019795783,"about_ca_system_score_gemma":0.0010882346,"threshold_uncertainty_score":0.023812294},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8337976,0.0008917535,0.15822276,0.0002060915,0.00015381463,0.00010460297,0.000079092766,0.001436248,0.0051082107],"genre_scores_gemma":[0.99473095,0.000038267863,0.0048631006,0.00001597384,0.000010518135,0.000013972202,0.00001871241,0.000010552979,0.00029788737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992151,0.0002157586,0.000037667258,0.00008735845,0.00024745904,0.0001966739],"domain_scores_gemma":[0.9977791,0.00096830184,0.0002237496,0.00029107404,0.00055330835,0.00018445362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001627714,0.00044445915,0.0005493962,0.0006986064,0.0008172134,0.0010446457,0.0008368981,0.0005197161,0.0013951163],"category_scores_gemma":[0.0048738746,0.00019499434,0.00017947251,0.00069924054,0.00058769505,0.00078263105,0.0007356714,0.000496315,0.00022612607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002682507,0.00052652333,0.0050644907,0.00022936975,0.00009637116,0.00044726318,0.00042938616,0.64783347,0.087368816,0.018925631,0.0029763367,0.23341982],"study_design_scores_gemma":[0.000039259347,0.0003735871,0.0008316905,0.0000063696652,0.000014127072,0.0000933669,0.000035514135,0.98803395,0.008363961,0.0015520075,0.00063525705,0.000020927517],"about_ca_topic_score_codex":0.0024439842,"about_ca_topic_score_gemma":0.001253267,"teacher_disagreement_score":0.0024439842,"about_ca_system_score_codex":0.001186067,"about_ca_system_score_gemma":0.0006624458,"threshold_uncertainty_score":0.008608282},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12684517,0.0021439092,0.8210811,0.0045932443,0.0007419094,0.00065474014,0.0010794181,0.0008110552,0.04204946],"genre_scores_gemma":[0.9078023,0.0016850459,0.050939854,0.00060770195,0.00080381223,0.00068045885,0.00060674263,0.000117962976,0.036756035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965911,0.0011413447,0.00017765832,0.00061610516,0.0006764446,0.0007973803],"domain_scores_gemma":[0.9948285,0.0024469672,0.00085389294,0.00037335837,0.00079385535,0.00070341653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003781739,0.001665162,0.0015809361,0.0012929031,0.0018620349,0.004406731,0.005097499,0.0030246854,0.009132323],"category_scores_gemma":[0.012071008,0.0011461059,0.0011609193,0.0016707457,0.0027663184,0.004249705,0.0017874807,0.0026411305,0.0018951973],"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.000121588004,0.00021899097,0.002112509,0.00011744928,0.000050770275,0.00039941721,0.0010295748,0.41283822,0.0016187571,0.5672386,0.0069388025,0.007315234],"study_design_scores_gemma":[0.000071112794,0.00006403518,0.00043895948,0.000020310623,0.000023296237,0.00008494657,0.00017543841,0.9062072,0.00013194769,0.088227496,0.004525499,0.00002971351],"about_ca_topic_score_codex":0.018437797,"about_ca_topic_score_gemma":0.0077056857,"teacher_disagreement_score":0.018437797,"about_ca_system_score_codex":0.0048429915,"about_ca_system_score_gemma":0.0031160333,"threshold_uncertainty_score":0.03666097},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007516861,0.00004583028,0.9896624,0.00004181348,0.000040650684,0.000045540764,0.00008699381,0.0017807729,0.000779231],"genre_scores_gemma":[0.1430857,0.00008294818,0.8522241,0.00008642093,0.000039680122,0.00019241277,0.00026146285,0.00059747364,0.003429823],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988172,0.00025404186,0.00007051119,0.00020079817,0.0005314995,0.00012602928],"domain_scores_gemma":[0.99694115,0.0011669145,0.00023909965,0.0005075923,0.0010118561,0.00013331245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016901746,0.0011527801,0.0011996946,0.0024003591,0.0010734085,0.0015918352,0.0028986216,0.0013982174,0.0061631477],"category_scores_gemma":[0.010374025,0.00069649215,0.000780825,0.0024728994,0.0007315337,0.0026740143,0.0011171327,0.002435539,0.001954155],"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.00055588747,0.00048604165,0.0059979255,0.00037253526,0.00025714483,0.0001968725,0.0006260809,0.39613184,0.037912864,0.11867109,0.0062916283,0.43250003],"study_design_scores_gemma":[0.000033140266,0.000041531704,0.0005234868,0.000010904639,0.000016781125,0.000046355388,0.000027577675,0.98468494,0.005263821,0.007527481,0.0017895567,0.000034463217],"about_ca_topic_score_codex":0.014635303,"about_ca_topic_score_gemma":0.014110961,"teacher_disagreement_score":0.014635303,"about_ca_system_score_codex":0.002015578,"about_ca_system_score_gemma":0.0025968712,"threshold_uncertainty_score":0.02910024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16521466,0.0021016658,0.82013196,0.000741999,0.00032219238,0.00015342052,0.00017714915,0.0004703604,0.010686666],"genre_scores_gemma":[0.9698132,0.00074367895,0.023879588,0.00014573481,0.00020880187,0.0000719896,0.00010961056,0.00012085736,0.004906482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986492,0.000339827,0.000036273195,0.00015260682,0.000498069,0.0003239788],"domain_scores_gemma":[0.99454665,0.003933444,0.00025647134,0.00020691431,0.0008725387,0.0001839341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038766393,0.00088321755,0.0017932865,0.0019135262,0.0013014363,0.0022320133,0.0030422357,0.0013566144,0.0036467041],"category_scores_gemma":[0.010438041,0.0006682255,0.00090668234,0.001360538,0.0018694771,0.0022843166,0.0010782465,0.0010683129,0.00027315467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016533188,0.000092011396,0.00057020487,0.000075187374,0.00005012893,0.00008648436,0.0001330906,0.8614294,0.0031487213,0.12347403,0.0016658577,0.009109594],"study_design_scores_gemma":[0.0000023007246,0.0000066431544,0.00006482731,0.000002300729,0.0000059675685,0.000005780492,0.0000046443483,0.9957235,0.000099035075,0.004025256,0.00005574358,0.000003979916],"about_ca_topic_score_codex":0.021337587,"about_ca_topic_score_gemma":0.009528595,"teacher_disagreement_score":0.021337587,"about_ca_system_score_codex":0.006234638,"about_ca_system_score_gemma":0.0031440582,"threshold_uncertainty_score":0.045235634},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20795646,0.00054178084,0.7881653,0.0005456863,0.00011128974,0.00007471027,0.00032196427,0.0011143328,0.0011685003],"genre_scores_gemma":[0.9109647,0.00026641777,0.086719334,0.00008971014,0.000079597565,0.00008180252,0.00037041926,0.00004996703,0.0013779898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950325,0.000095055075,0.000023607165,0.00010257086,0.00017020696,0.00010526013],"domain_scores_gemma":[0.9966204,0.001671501,0.00042051735,0.00021131332,0.00079793856,0.00027822296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019191745,0.0007465559,0.0007347444,0.00072127127,0.0003987679,0.0007675147,0.001606397,0.0008592202,0.001317626],"category_scores_gemma":[0.0064531085,0.00042535912,0.00045202923,0.0007351615,0.00037456022,0.001083819,0.0009083733,0.0023937137,0.00031061348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009370035,0.00008496778,0.006198137,0.000027969367,0.000017154807,0.000028699129,0.000030341818,0.95367646,0.00079549156,0.0018306848,0.00061701733,0.036599286],"study_design_scores_gemma":[0.0000029998928,0.000017262599,0.0002723186,0.000001804479,0.0000020022812,0.0000020283155,0.0000021363403,0.9988927,0.0003453768,0.00039175487,0.00006619273,0.0000034911786],"about_ca_topic_score_codex":0.012574394,"about_ca_topic_score_gemma":0.010920205,"teacher_disagreement_score":0.012574394,"about_ca_system_score_codex":0.0009742336,"about_ca_system_score_gemma":0.0024488356,"threshold_uncertainty_score":0.02500242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98716635,0.00033955643,0.009453025,0.0003773851,0.00006281935,0.000016700551,0.00017911445,0.0001431999,0.0022618244],"genre_scores_gemma":[0.9994294,0.000047805515,0.00023774062,0.000014173001,0.000013968193,0.0000018355739,0.000048759135,0.000014070862,0.00019211775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744165,0.0006145993,0.00014254617,0.00024936692,0.00066377077,0.0008880626],"domain_scores_gemma":[0.95549166,0.033457305,0.0031166277,0.0021789733,0.0033394247,0.002416052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032807742,0.00064735935,0.00068479107,0.0011965693,0.0009035889,0.002473516,0.0009133083,0.0011966884,0.0022130779],"category_scores_gemma":[0.030851102,0.00045842497,0.00045762202,0.0018240319,0.001205724,0.0021950493,0.0009047799,0.0016867339,0.0005905421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0051885014,0.00068255345,0.12829414,0.00014224325,0.00020411327,0.0012896444,0.0005264118,0.78125364,0.032995995,0.0075113256,0.0018630786,0.040048346],"study_design_scores_gemma":[0.000058165155,0.001711472,0.114027195,0.000029104207,0.00031388152,0.0012493867,0.001148672,0.8590502,0.015188399,0.0061539765,0.0009595646,0.00011000901],"about_ca_topic_score_codex":0.005049617,"about_ca_topic_score_gemma":0.00324954,"teacher_disagreement_score":0.005049617,"about_ca_system_score_codex":0.0019906424,"about_ca_system_score_gemma":0.0012496272,"threshold_uncertainty_score":0.017350614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5020033,0.0007340349,0.49015066,0.0025431106,0.00011166122,0.00009504931,0.000107982865,0.00029537955,0.0039588297],"genre_scores_gemma":[0.99056,0.0002580258,0.007758291,0.00008345582,0.00005660923,0.000047839443,0.00003497139,0.000040821487,0.0011599768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962883,0.0017918424,0.00015847321,0.00040669742,0.0007195803,0.00063511636],"domain_scores_gemma":[0.9459256,0.04146424,0.006350413,0.002658332,0.002035704,0.0015658237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010466552,0.00068184757,0.0011743904,0.0010096346,0.0010626388,0.002417135,0.0022427004,0.0016924273,0.0018214467],"category_scores_gemma":[0.07331793,0.0008029324,0.00076960976,0.0010735124,0.0032026018,0.004155356,0.0016602144,0.0031001389,0.00021076627],"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.00033754212,0.00012620896,0.00419737,0.00008203055,0.00006712438,0.0002545587,0.00045358553,0.3670597,0.0046740402,0.6105082,0.001217006,0.0110226385],"study_design_scores_gemma":[0.000014853527,0.00004425082,0.0009281193,0.000013513138,0.000014286935,0.00006532318,0.00005249636,0.90782183,0.00053444353,0.09028508,0.00019404113,0.000031672113],"about_ca_topic_score_codex":0.0016024358,"about_ca_topic_score_gemma":0.0012290727,"teacher_disagreement_score":0.010466552,"about_ca_system_score_codex":0.0035147485,"about_ca_system_score_gemma":0.0018813915,"threshold_uncertainty_score":0.055353045},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033322204,0.0009513829,0.95542145,0.00073838345,0.00032893874,0.00011921362,0.0001591873,0.00038601313,0.008573142],"genre_scores_gemma":[0.83086914,0.0017016252,0.12907963,0.00047408216,0.0006636491,0.00029041967,0.00026921846,0.00044448598,0.03620769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990809,0.0001992792,0.000030341143,0.00015386933,0.00038875276,0.00014685436],"domain_scores_gemma":[0.9983506,0.000897703,0.00012749944,0.00008721281,0.00043750944,0.000099508055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019000418,0.0011758007,0.001455643,0.001325651,0.0007390907,0.0015107638,0.002599454,0.001139243,0.0081327865],"category_scores_gemma":[0.0065215356,0.000588902,0.001301509,0.0010193969,0.0013590882,0.0031148056,0.001102064,0.0018100406,0.0009783603],"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.00014266725,0.00014981945,0.0008873863,0.00026078735,0.0000737372,0.00039340742,0.00032121612,0.42089233,0.011322578,0.54026693,0.004940177,0.02034898],"study_design_scores_gemma":[0.000015233516,0.000022228098,0.0002570921,0.000011158032,0.000017785344,0.000060471004,0.000022299097,0.960129,0.000504081,0.037884198,0.001050372,0.000025997517],"about_ca_topic_score_codex":0.00971447,"about_ca_topic_score_gemma":0.0058272122,"teacher_disagreement_score":0.00971447,"about_ca_system_score_codex":0.0024017228,"about_ca_system_score_gemma":0.0037510793,"threshold_uncertainty_score":0.027206898},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42481336,0.0010937251,0.5474372,0.0016904225,0.00016350529,0.000057730405,0.00044906323,0.0005062277,0.023788832],"genre_scores_gemma":[0.9504863,0.0007953292,0.025819054,0.00030458719,0.00025007132,0.00008186048,0.00027318305,0.00016516003,0.021824358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885,0.00027708412,0.00004573181,0.00021480244,0.0003686998,0.00024374985],"domain_scores_gemma":[0.98898345,0.0076579126,0.00083640666,0.00053670007,0.001315508,0.0006701199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027988488,0.00076486176,0.0008555089,0.0015724113,0.0013918318,0.0023586226,0.0022615078,0.0011561568,0.0049183597],"category_scores_gemma":[0.01301959,0.0009526214,0.00092818984,0.0017915409,0.0025057492,0.004324314,0.0015407351,0.0026184244,0.00061918946],"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.0001595494,0.00009339171,0.0021417122,0.00009197871,0.000055529195,0.00028056002,0.00042137413,0.11306817,0.004476104,0.87060624,0.0017774317,0.006827984],"study_design_scores_gemma":[0.00002289057,0.000023630668,0.0013430724,0.000014084032,0.000028672845,0.00011454786,0.00005733511,0.7248281,0.001343492,0.27167344,0.0005084449,0.00004215773],"about_ca_topic_score_codex":0.0044629276,"about_ca_topic_score_gemma":0.0053710393,"teacher_disagreement_score":0.0049183597,"about_ca_system_score_codex":0.002913879,"about_ca_system_score_gemma":0.0016826614,"threshold_uncertainty_score":0.021141768},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4002238,0.00073750154,0.5858732,0.0006653006,0.00016681981,0.000085080945,0.0001715885,0.00025095695,0.011825696],"genre_scores_gemma":[0.97993547,0.00024432852,0.011793354,0.00011642236,0.000075094125,0.000045628276,0.000054022083,0.000026194819,0.0077094752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915075,0.00016051556,0.000035689573,0.00016545886,0.00020897435,0.00027864377],"domain_scores_gemma":[0.9976726,0.0010607408,0.000469353,0.0001093278,0.0003357965,0.0003522969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013509626,0.000731981,0.0011548767,0.000935462,0.0009531584,0.0018394891,0.0019054118,0.0013418166,0.0027294464],"category_scores_gemma":[0.00385197,0.00056016806,0.00075697474,0.0009932327,0.002041683,0.0024479541,0.0013939509,0.0013292036,0.00031262595],"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.00017058155,0.00015257197,0.0014352931,0.00009267426,0.000063696694,0.0007072297,0.0001392805,0.87580645,0.0043437374,0.11077056,0.00073094125,0.0055868765],"study_design_scores_gemma":[0.000015903317,0.000048123118,0.00018431457,0.0000050178783,0.000016364434,0.000054807897,0.00006474192,0.97976637,0.00040664125,0.019180257,0.00024107865,0.000016319877],"about_ca_topic_score_codex":0.005534763,"about_ca_topic_score_gemma":0.0038805394,"teacher_disagreement_score":0.005534763,"about_ca_system_score_codex":0.0022956992,"about_ca_system_score_gemma":0.001476151,"threshold_uncertainty_score":0.016656578},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018108161,0.0005130638,0.9374595,0.00083692407,0.0011412014,0.00016933576,0.0012568273,0.008215619,0.032299366],"genre_scores_gemma":[0.36329898,0.00036948966,0.5834458,0.00061938685,0.00057515496,0.00041548643,0.0031134705,0.0022237245,0.04593846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887747,0.00018342298,0.000058731046,0.00024760084,0.00045284722,0.00018000172],"domain_scores_gemma":[0.99753606,0.0007435087,0.000079869635,0.0010212167,0.00050629425,0.00011300953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085943274,0.0011096933,0.0011814209,0.0011935317,0.0013881836,0.002598758,0.0018867996,0.0013370438,0.05366155],"category_scores_gemma":[0.00689405,0.000613843,0.0010069362,0.0015435001,0.00068350596,0.00345462,0.003230388,0.0021358929,0.009826951],"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.0011766497,0.00017643403,0.0017748397,0.00033218492,0.00014497299,0.00025177814,0.00014505444,0.14962187,0.0079126675,0.20276988,0.06162962,0.5740641],"study_design_scores_gemma":[0.00008306551,0.000048923008,0.00047497626,0.000032726854,0.000023117178,0.00008186728,0.000042700394,0.8254284,0.006042909,0.15061983,0.017099036,0.000022517841],"about_ca_topic_score_codex":0.003583284,"about_ca_topic_score_gemma":0.0071050655,"teacher_disagreement_score":0.05366155,"about_ca_system_score_codex":0.0011232429,"about_ca_system_score_gemma":0.0022009632,"threshold_uncertainty_score":0.17951578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010757753,0.0009845421,0.96497524,0.0017006041,0.0002781309,0.000036313126,0.0000615195,0.0002561507,0.02094965],"genre_scores_gemma":[0.8849053,0.0015232279,0.0981744,0.0012736019,0.00068584294,0.00017296428,0.0000847498,0.00013924207,0.013040663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889946,0.00048426975,0.00004668896,0.00017069548,0.00025645847,0.00014239215],"domain_scores_gemma":[0.99644583,0.002289635,0.0004482252,0.00035344184,0.00030550352,0.00015742479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021808427,0.0005495528,0.000672656,0.0006247355,0.0007359329,0.001568577,0.0013458745,0.0016495766,0.0047643436],"category_scores_gemma":[0.009972792,0.00026434823,0.0006898423,0.0007092124,0.0024222936,0.002086962,0.0018551704,0.003148232,0.0009177445],"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.00007671187,0.00003347885,0.0002266912,0.0000732772,0.000015859794,0.00010297293,0.00010123553,0.08809385,0.0025144364,0.8878644,0.0037249844,0.017172137],"study_design_scores_gemma":[0.000013018992,0.00005018974,0.00018138393,0.00003513372,0.000008578611,0.000104323764,0.000022478718,0.5996567,0.00061450026,0.39483827,0.004448652,0.00002689355],"about_ca_topic_score_codex":0.0015039723,"about_ca_topic_score_gemma":0.0010719376,"teacher_disagreement_score":0.0047643436,"about_ca_system_score_codex":0.0014044732,"about_ca_system_score_gemma":0.000739296,"threshold_uncertainty_score":0.015938342},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009828059,0.0004177059,0.99732155,0.00007635709,0.000038808023,0.00003762859,0.000029874933,0.000088792636,0.0010065421],"genre_scores_gemma":[0.05385869,0.0015169684,0.93733674,0.00017443646,0.00021038264,0.0004616278,0.0001693895,0.00021874812,0.0060530547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990972,0.0003148907,0.00006782391,0.000121793826,0.00032436533,0.00007406243],"domain_scores_gemma":[0.9962819,0.0026459168,0.00028159053,0.00022302895,0.0004889534,0.00007863879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002820776,0.0014289457,0.0012276284,0.0024592585,0.00085963664,0.001128152,0.002370023,0.001528235,0.004539539],"category_scores_gemma":[0.008154173,0.0008774102,0.0013073059,0.0017514069,0.0013168412,0.002051697,0.0014342484,0.002381563,0.0012534986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096675314,0.00022967787,0.001941124,0.00079839944,0.0001876764,0.00016421784,0.00039017192,0.50472003,0.0068166154,0.2716932,0.005950839,0.20701142],"study_design_scores_gemma":[0.000027354003,0.000019797353,0.00029033018,0.00004522144,0.000018584808,0.00007349641,0.000037267422,0.94758445,0.0010241721,0.047582164,0.0032739984,0.00002309412],"about_ca_topic_score_codex":0.0041240626,"about_ca_topic_score_gemma":0.005358986,"teacher_disagreement_score":0.004539539,"about_ca_system_score_codex":0.001317185,"about_ca_system_score_gemma":0.0019215489,"threshold_uncertainty_score":0.01518631},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17000459,0.00045112788,0.8260629,0.0004357535,0.00024177137,0.00013890926,0.00016580074,0.00046495622,0.0020341687],"genre_scores_gemma":[0.91272044,0.00032969782,0.08009989,0.00012043588,0.0002805746,0.000110435576,0.00016941653,0.00006664841,0.0061023957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961837,0.00095029257,0.00043980492,0.000797916,0.00079999387,0.0008282562],"domain_scores_gemma":[0.9828189,0.008916494,0.0017582242,0.0019194077,0.0030730576,0.0015139432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0078771245,0.0012876336,0.002864383,0.0018192199,0.002591852,0.0052621323,0.0059613404,0.0020493162,0.003559949],"category_scores_gemma":[0.017929036,0.0013473526,0.0012996335,0.0035236815,0.0014727308,0.0064472836,0.0029488814,0.0023010296,0.00067185576],"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.0018516144,0.0006471166,0.0076251957,0.00023024515,0.00022899454,0.0012099275,0.0004431407,0.7811765,0.012785933,0.14951444,0.0021163179,0.042170573],"study_design_scores_gemma":[0.000031538104,0.000065224136,0.000295311,0.000005745806,0.000046075842,0.000060048278,0.000025240905,0.9876836,0.0009904259,0.01062544,0.00015110725,0.000020268546],"about_ca_topic_score_codex":0.004743862,"about_ca_topic_score_gemma":0.0048075253,"teacher_disagreement_score":0.0078771245,"about_ca_system_score_codex":0.0031634849,"about_ca_system_score_gemma":0.0030405007,"threshold_uncertainty_score":0.0416587},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14620312,0.00006254905,0.85246277,0.00010080008,0.000017639337,0.00006775663,0.00007341977,0.00032547105,0.00068651926],"genre_scores_gemma":[0.87640876,0.00014295336,0.121954195,0.00005142249,0.000029096354,0.00015973598,0.0003049945,0.0000450148,0.00090390415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942005,0.00019369752,0.000038792477,0.0001286042,0.00016315648,0.0000557694],"domain_scores_gemma":[0.9947849,0.0032082277,0.00077324174,0.0005549855,0.00056148577,0.000117183656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041738716,0.00059520564,0.000597357,0.0017303227,0.00052160147,0.0009153263,0.0011354684,0.0010255304,0.00097070367],"category_scores_gemma":[0.019301036,0.0005494417,0.00069191994,0.0009942155,0.00081743684,0.0017269261,0.0010105132,0.0012680824,0.00021358127],"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.00021830984,0.00014113329,0.024567602,0.000109246306,0.000121383455,0.00020895299,0.0004091296,0.8702836,0.007722246,0.046231538,0.0006591324,0.049327772],"study_design_scores_gemma":[0.000008586964,0.000021119933,0.0014402756,0.0000067571373,0.000007359306,0.000027988706,0.00001597301,0.9920258,0.0008418919,0.005438683,0.00015166524,0.000013945092],"about_ca_topic_score_codex":0.006184649,"about_ca_topic_score_gemma":0.0027095631,"teacher_disagreement_score":0.006184649,"about_ca_system_score_codex":0.0011078338,"about_ca_system_score_gemma":0.0011549526,"threshold_uncertainty_score":0.022073805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54711086,0.00073329423,0.44003642,0.0024657121,0.00012122796,0.0004096709,0.00039484477,0.00037779452,0.008350167],"genre_scores_gemma":[0.97139955,0.00020490447,0.026216494,0.00012806547,0.00004060722,0.00010606911,0.00007000785,0.00004066764,0.0017936605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971215,0.0012967344,0.00014916636,0.00032663994,0.00027184273,0.00083405577],"domain_scores_gemma":[0.9885642,0.0071897996,0.0013575039,0.000407447,0.0005949479,0.001886042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058517274,0.0008810275,0.0020860666,0.0011203773,0.0012787629,0.0036609161,0.0020116742,0.0023628788,0.004617517],"category_scores_gemma":[0.017722862,0.0014344212,0.0011899859,0.0010558576,0.0021601266,0.004797168,0.0022267045,0.0024783222,0.0004272505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014811627,0.00061736745,0.0041715587,0.0001595373,0.00012210365,0.00033723324,0.0005281548,0.74087036,0.005743151,0.22461364,0.0027378474,0.018617883],"study_design_scores_gemma":[0.00017010602,0.00015888609,0.00082080334,0.000020117874,0.000032899632,0.00004214823,0.00015449047,0.9143487,0.00055303634,0.083240494,0.0003940489,0.00006420956],"about_ca_topic_score_codex":0.005565838,"about_ca_topic_score_gemma":0.003949717,"teacher_disagreement_score":0.0058517274,"about_ca_system_score_codex":0.005094518,"about_ca_system_score_gemma":0.0029928205,"threshold_uncertainty_score":0.036963463},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26564124,0.00081052736,0.7258859,0.0012717278,0.0002881283,0.0002866961,0.00038734515,0.0018566484,0.0035717033],"genre_scores_gemma":[0.9785144,0.00025400193,0.018286154,0.00014864473,0.00014046488,0.00009161047,0.00012540046,0.000091124435,0.0023481902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969568,0.0008808056,0.00016259549,0.0005342659,0.00068721286,0.0007783348],"domain_scores_gemma":[0.9877345,0.006375204,0.0014034057,0.0012978949,0.0020739094,0.0011150504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00574687,0.0014616561,0.0021084906,0.001325915,0.001406927,0.0045671193,0.0035525246,0.0024076172,0.0045372234],"category_scores_gemma":[0.022859039,0.001036934,0.0008029347,0.002269256,0.0020998518,0.003900334,0.0028438845,0.0026862617,0.0007014467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024948693,0.00035551598,0.0060224454,0.00033993975,0.00011716162,0.0007937375,0.00082520844,0.8002281,0.014303281,0.10421286,0.0071224743,0.063184366],"study_design_scores_gemma":[0.000046720612,0.00013056156,0.0003504168,0.00001040395,0.000027556644,0.00010274404,0.000064772605,0.98150486,0.0007878117,0.016322048,0.0006267182,0.000025438987],"about_ca_topic_score_codex":0.008598499,"about_ca_topic_score_gemma":0.0052350536,"teacher_disagreement_score":0.008598499,"about_ca_system_score_codex":0.0039309296,"about_ca_system_score_gemma":0.0027051049,"threshold_uncertainty_score":0.030392706},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45931423,0.00048066914,0.5331192,0.0013979842,0.00006779016,0.00012667393,0.000095857984,0.00022944686,0.00516821],"genre_scores_gemma":[0.9732992,0.00015582492,0.024788715,0.00011215826,0.000041715524,0.00008182464,0.00004616502,0.00003997437,0.0014344644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978254,0.000787343,0.00010841603,0.0004345474,0.0004884548,0.00035595236],"domain_scores_gemma":[0.97819465,0.014139614,0.0028492154,0.0023044948,0.0013776124,0.0011343765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055547273,0.00064542564,0.0009658162,0.00086930656,0.0011837842,0.002385787,0.0021565803,0.0019643977,0.0014099946],"category_scores_gemma":[0.03289516,0.0005727761,0.0006562346,0.0006489002,0.0043453765,0.004035961,0.0024248057,0.0018670168,0.00022773737],"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.00045974719,0.000113224065,0.002954,0.0001224201,0.00006038991,0.00017850808,0.0006421301,0.39321306,0.010275129,0.581868,0.00083671074,0.00927674],"study_design_scores_gemma":[0.000052259107,0.000070215836,0.00036096462,0.000015746704,0.0000105791405,0.000050221544,0.00007248294,0.85829234,0.0010829284,0.13937312,0.0005956774,0.000023297858],"about_ca_topic_score_codex":0.0015411708,"about_ca_topic_score_gemma":0.00077181816,"teacher_disagreement_score":0.0055547273,"about_ca_system_score_codex":0.002964934,"about_ca_system_score_gemma":0.0012924204,"threshold_uncertainty_score":0.029376507},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33497635,0.0014943625,0.6522547,0.001515628,0.00017733566,0.00007202895,0.00023845879,0.00036554877,0.008905559],"genre_scores_gemma":[0.96099156,0.0006706745,0.027762175,0.00017518194,0.00020408118,0.00007243422,0.00013558666,0.00012560781,0.00986279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989303,0.00029320345,0.000052893436,0.0001358305,0.00035091786,0.00023683885],"domain_scores_gemma":[0.9887911,0.0074491617,0.0009925271,0.0004306818,0.0016897371,0.00064687413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050353776,0.000622353,0.00082784286,0.0016430755,0.0007535021,0.00229299,0.0030566324,0.0010414217,0.0034806994],"category_scores_gemma":[0.01813801,0.000709599,0.0005272811,0.0015032098,0.001617104,0.0038425713,0.0008864602,0.0022140762,0.00040692382],"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.00024087285,0.00011042538,0.0022453694,0.00009049934,0.000025435336,0.00020067378,0.0005613921,0.18133478,0.004972096,0.79972565,0.0016603299,0.008832532],"study_design_scores_gemma":[0.00001862798,0.000034925964,0.00055918354,0.000012133578,0.000013709879,0.00005051595,0.000076880846,0.93522745,0.0004460337,0.06308489,0.00045339097,0.000022162048],"about_ca_topic_score_codex":0.0076669115,"about_ca_topic_score_gemma":0.00335655,"teacher_disagreement_score":0.0076669115,"about_ca_system_score_codex":0.0030483347,"about_ca_system_score_gemma":0.0025253836,"threshold_uncertainty_score":0.026629925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07865973,0.0006464748,0.9143824,0.0007883189,0.00013143793,0.00019127791,0.0004885818,0.00081454404,0.0038973216],"genre_scores_gemma":[0.7399296,0.0012044732,0.25011715,0.0003316178,0.0002795673,0.00060362177,0.0013049425,0.0004738969,0.0057550888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951814,0.0023693554,0.00020244466,0.00063819153,0.0011322631,0.00047645127],"domain_scores_gemma":[0.98002934,0.012457303,0.002430392,0.0016905519,0.0026953064,0.00069706317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010326886,0.0014602572,0.001976625,0.0017073643,0.0007981353,0.002698027,0.0065561943,0.0022253997,0.003293873],"category_scores_gemma":[0.025896965,0.0009940085,0.0023925502,0.0024436438,0.00096744805,0.0033376112,0.0019112407,0.0033966012,0.0008927249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051595754,0.0000677147,0.0018159644,0.000027475067,0.000062898376,0.000046290243,0.00012282393,0.9638604,0.0003503262,0.026324915,0.0006548591,0.0066147326],"study_design_scores_gemma":[0.000007381019,0.000018399927,0.0002557184,0.0000040426403,0.000008450122,0.00001891084,0.000011932992,0.9926553,0.000083877094,0.00644381,0.00047491677,0.000017245662],"about_ca_topic_score_codex":0.014589309,"about_ca_topic_score_gemma":0.006753745,"teacher_disagreement_score":0.014589309,"about_ca_system_score_codex":0.003317524,"about_ca_system_score_gemma":0.002082834,"threshold_uncertainty_score":0.054614484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3807102,0.0005261714,0.61451095,0.0005583626,0.000051322222,0.00013669921,0.00010090811,0.00025324858,0.0031521039],"genre_scores_gemma":[0.98937184,0.00011849904,0.009637277,0.000041884723,0.00001976925,0.000047857444,0.00003172843,0.000027188396,0.0007038873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867636,0.0004387601,0.000054549117,0.00021696722,0.0003165887,0.00029683008],"domain_scores_gemma":[0.9912191,0.0055568335,0.0012864317,0.00057939027,0.0009775173,0.00038063657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037439405,0.00070979487,0.0009704378,0.00085801305,0.00090497,0.001150042,0.0015105717,0.00082018407,0.0014793919],"category_scores_gemma":[0.013054004,0.0003780078,0.00063642865,0.0005274281,0.0019853134,0.0018596682,0.0014704473,0.00079228426,0.00013115755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011245693,0.000047042846,0.0009632772,0.000046227822,0.000041677336,0.000069277885,0.00007521642,0.9486348,0.0056310464,0.040202692,0.0003180816,0.0038581255],"study_design_scores_gemma":[0.00000482941,0.000016367003,0.00009117148,0.000001573152,0.000003877329,0.0000050504455,0.00000992088,0.9961863,0.000264595,0.0033780455,0.00003454801,0.0000036529539],"about_ca_topic_score_codex":0.0045064627,"about_ca_topic_score_gemma":0.0020432984,"teacher_disagreement_score":0.0045064627,"about_ca_system_score_codex":0.002729471,"about_ca_system_score_gemma":0.0016789929,"threshold_uncertainty_score":0.019803822},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6067097,0.00057451916,0.3828,0.00068973243,0.0001117842,0.00006920441,0.00014720249,0.0004333827,0.00846449],"genre_scores_gemma":[0.9947955,0.00009020112,0.003532169,0.000029440775,0.000018928671,0.000039362458,0.00002717353,0.000011090183,0.001456112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991014,0.00019131541,0.000040343053,0.00018663798,0.0002368767,0.00024340604],"domain_scores_gemma":[0.99688524,0.0013263841,0.00068541634,0.00015934752,0.0006590611,0.00028446998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012994516,0.0005502688,0.00076582923,0.00084689533,0.0008109095,0.0011632135,0.00127635,0.0010350903,0.0016527105],"category_scores_gemma":[0.004833803,0.00032807217,0.00051076326,0.0005920956,0.001601668,0.0008294533,0.0011273854,0.0006746999,0.0001878728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034000474,0.00007721745,0.00373912,0.00009763268,0.00009896543,0.00056131853,0.0003312024,0.8762311,0.013998721,0.09363316,0.0011517118,0.009739855],"study_design_scores_gemma":[0.000011667882,0.000023995362,0.00025902316,0.0000028613943,0.000009534751,0.00002227552,0.000017574897,0.9940598,0.00022975028,0.005248017,0.00010647182,0.000009118746],"about_ca_topic_score_codex":0.012238368,"about_ca_topic_score_gemma":0.0028615869,"teacher_disagreement_score":0.012238368,"about_ca_system_score_codex":0.0014741366,"about_ca_system_score_gemma":0.0014261194,"threshold_uncertainty_score":0.024334311},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019388566,0.00020530292,0.97151357,0.00044222007,0.000029889421,0.000033962075,0.00011568153,0.0001408656,0.008129833],"genre_scores_gemma":[0.75191015,0.0010539225,0.21820699,0.00039106296,0.0004311139,0.00039961011,0.00037466435,0.00034204367,0.026890486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911565,0.00039446953,0.00002587383,0.00012030687,0.00016103567,0.0001827131],"domain_scores_gemma":[0.99535877,0.0036441688,0.00025421297,0.00015151083,0.00037589954,0.000215464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021062675,0.0006619141,0.00096063205,0.001436655,0.00082819595,0.0019761042,0.001656011,0.00093947165,0.005275908],"category_scores_gemma":[0.007661004,0.00075121725,0.0010952532,0.0014824839,0.0018235364,0.0025746296,0.0013301522,0.0021701015,0.00043192354],"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.000019892786,0.000051890194,0.0002704814,0.000033989294,0.00001931034,0.000044326298,0.00009196542,0.13254596,0.00037557245,0.85915184,0.0010607735,0.0063339365],"study_design_scores_gemma":[0.0000043706436,0.000009915144,0.00007890328,0.0000067662495,0.000008501554,0.00000956541,0.000011953903,0.745763,0.00015829454,0.25345892,0.0004829703,0.000006750072],"about_ca_topic_score_codex":0.007915922,"about_ca_topic_score_gemma":0.0071591716,"teacher_disagreement_score":0.007915922,"about_ca_system_score_codex":0.0024334441,"about_ca_system_score_gemma":0.0021497693,"threshold_uncertainty_score":0.017655969},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25860837,0.0012039491,0.7172995,0.001997345,0.00023870313,0.00005930067,0.00018334918,0.0006339482,0.019775495],"genre_scores_gemma":[0.98333377,0.00037469444,0.008089217,0.000190646,0.00011168694,0.00004614412,0.00011026496,0.00010659876,0.007636939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990387,0.00027309707,0.0000405926,0.00012773559,0.00020866616,0.0003111896],"domain_scores_gemma":[0.99120295,0.0058532665,0.0006745381,0.00040556668,0.0011162363,0.00074738223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028161525,0.00067365903,0.001310275,0.0020625747,0.0015331709,0.0027699328,0.0023487457,0.0012865455,0.004815021],"category_scores_gemma":[0.01492207,0.00076872937,0.0010854743,0.0012987135,0.0026454863,0.0037274344,0.0017059839,0.0023071724,0.000382488],"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.0002688477,0.00010332936,0.0013414865,0.000083010054,0.000049022055,0.0003484567,0.0004945368,0.11540492,0.0040641506,0.87022024,0.0025525154,0.0050695054],"study_design_scores_gemma":[0.000016342425,0.000023842484,0.00036311356,0.000014318818,0.000027696196,0.00007202169,0.000094233044,0.88130563,0.00062010565,0.116982765,0.00046152598,0.000018375858],"about_ca_topic_score_codex":0.004854913,"about_ca_topic_score_gemma":0.0021180091,"teacher_disagreement_score":0.004854913,"about_ca_system_score_codex":0.0035923494,"about_ca_system_score_gemma":0.0016423857,"threshold_uncertainty_score":0.026064396},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0851301,0.0018336863,0.89135057,0.0010961152,0.00027904805,0.00003175693,0.0001443673,0.00019682845,0.019937543],"genre_scores_gemma":[0.9348246,0.0010485114,0.05553907,0.00029365678,0.00038697175,0.000079660946,0.00013451358,0.00013164706,0.0075614196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979303,0.00075425516,0.000074400006,0.00024060243,0.00075984834,0.00024072912],"domain_scores_gemma":[0.9915577,0.005370533,0.0007693402,0.00060137076,0.0011185693,0.0005824745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051848236,0.0006413825,0.0008361537,0.0025284572,0.00065998913,0.00329989,0.0025144084,0.0015321473,0.0049416088],"category_scores_gemma":[0.018371487,0.00046042504,0.0013991912,0.001218455,0.0027376749,0.0050434396,0.0016980667,0.0023958054,0.00050301786],"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.00001101777,0.000010545022,0.00019942303,0.000020685802,0.000011601504,0.00005858644,0.000063497595,0.02043713,0.00029983345,0.97713256,0.00027262213,0.0014824448],"study_design_scores_gemma":[0.0000072296625,0.000012289992,0.00023262053,0.000020116842,0.000006977222,0.000059907517,0.000031754804,0.43076137,0.00018154383,0.56758326,0.001084929,0.000018060327],"about_ca_topic_score_codex":0.0017585302,"about_ca_topic_score_gemma":0.0008107442,"teacher_disagreement_score":0.0051848236,"about_ca_system_score_codex":0.0032865503,"about_ca_system_score_gemma":0.0012112026,"threshold_uncertainty_score":0.027420342},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2131778,0.00027069318,0.78208065,0.00027103868,0.000083711326,0.00010485933,0.0004062745,0.0015251234,0.0020798405],"genre_scores_gemma":[0.9490963,0.00020341347,0.049378477,0.00007445336,0.00003910335,0.00011871138,0.0005041104,0.000112352514,0.00047300392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997821,0.0006955075,0.0001571386,0.0004701513,0.00069917255,0.00015701068],"domain_scores_gemma":[0.99462503,0.0026303285,0.0006862794,0.0012654031,0.0006944521,0.00009843101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003639298,0.0019825434,0.0011577251,0.0014499271,0.00033906638,0.0021754256,0.001348989,0.0015589263,0.0011298411],"category_scores_gemma":[0.014625191,0.0008396084,0.0009440873,0.0013672321,0.00074881216,0.0035369413,0.00096649874,0.001751767,0.0005728449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003658832,0.00005828875,0.0040490795,0.00003400877,0.00006271363,0.000029927234,0.0000438907,0.9806244,0.0022910868,0.0019925004,0.00017460472,0.0106028635],"study_design_scores_gemma":[0.0000038875105,0.000045318786,0.0011676111,0.0000068482827,0.000016465914,0.000015158815,0.000014610212,0.99292725,0.001962344,0.0036404482,0.00018366227,0.00001640643],"about_ca_topic_score_codex":0.0035495833,"about_ca_topic_score_gemma":0.0016465888,"teacher_disagreement_score":0.003639298,"about_ca_system_score_codex":0.0012133509,"about_ca_system_score_gemma":0.0011402755,"threshold_uncertainty_score":0.019246638},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005997549,0.03520253,0.53809214,0.0027183,0.002674029,0.00007737618,0.0004963051,0.0010022068,0.41373953],"genre_scores_gemma":[0.29541546,0.028916858,0.056318887,0.00085158093,0.0027268396,0.0003554501,0.00088052044,0.00034726513,0.6141871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997476,0.000048263362,0.000011922802,0.000045488698,0.00012954557,0.000017190428],"domain_scores_gemma":[0.99977845,0.00010058118,0.000017010849,0.000037282567,0.00005192458,0.000014643849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003296209,0.00086961803,0.0008809957,0.00047750666,0.00028710498,0.0018241326,0.00052214944,0.00082337676,0.019524086],"category_scores_gemma":[0.00077235344,0.00033978102,0.00039666498,0.00087016384,0.0008403062,0.00076912326,0.00080370787,0.0013677679,0.003780762],"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.000036183126,0.000063619984,0.0002453643,0.00027215487,0.000051877654,0.00012622168,0.00015255691,0.08623212,0.0035894872,0.5969335,0.06366136,0.24863563],"study_design_scores_gemma":[0.00003259838,0.00007675688,0.00084076216,0.00017474659,0.000029090479,0.00018324728,0.00005348283,0.31660497,0.0010925741,0.39014786,0.2907324,0.00003152016],"about_ca_topic_score_codex":0.0033331255,"about_ca_topic_score_gemma":0.0024330704,"teacher_disagreement_score":0.019524086,"about_ca_system_score_codex":0.0007927211,"about_ca_system_score_gemma":0.0005631222,"threshold_uncertainty_score":0.06531459},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13136709,0.00007374112,0.8626393,0.000277867,0.000038019032,0.00014895333,0.00015345636,0.0017235384,0.0035780964],"genre_scores_gemma":[0.79353505,0.000090371905,0.20486856,0.00010789593,0.00001702403,0.00028807818,0.00022459903,0.00014194899,0.0007265404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986777,0.0007305372,0.00006105945,0.00013640152,0.00020633348,0.00018796],"domain_scores_gemma":[0.9919807,0.0061186347,0.000342861,0.00093884574,0.0004407093,0.0001783235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031860962,0.0006912292,0.0012849933,0.000598741,0.0007375048,0.0009571603,0.0014887176,0.0011080271,0.003238351],"category_scores_gemma":[0.012114633,0.0007345291,0.00077807007,0.00093759596,0.0009225194,0.0018515871,0.0012193094,0.0019751142,0.0003372356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035772042,0.000023461625,0.0003924063,0.0000061737,0.0000067965902,0.000009892301,0.000015259637,0.99231863,0.00021515774,0.004418307,0.000090087735,0.0024681287],"study_design_scores_gemma":[0.000006328106,0.0000047409117,0.000024187446,7.2501496e-7,0.0000011240157,0.0000012803409,0.0000022032782,0.99882776,0.0001554938,0.00093203975,0.000042701784,0.0000014487853],"about_ca_topic_score_codex":0.018954618,"about_ca_topic_score_gemma":0.009211085,"teacher_disagreement_score":0.018954618,"about_ca_system_score_codex":0.0017058809,"about_ca_system_score_gemma":0.0019976909,"threshold_uncertainty_score":0.037688553},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25430652,0.0010454278,0.7286792,0.001994765,0.00035844202,0.0005855891,0.0005091353,0.0009897595,0.01153123],"genre_scores_gemma":[0.8991682,0.00047604242,0.09281138,0.00024097892,0.00014526949,0.00025810717,0.00015404391,0.00016780544,0.0065781563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99410313,0.0026514558,0.0003567495,0.0007176687,0.00068524835,0.0014858432],"domain_scores_gemma":[0.9610614,0.027837688,0.0023399938,0.001312272,0.002452517,0.004996082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013194811,0.0014800436,0.0044890856,0.0026808544,0.0021263529,0.008183663,0.0042167874,0.003310004,0.012729946],"category_scores_gemma":[0.037934154,0.0028410936,0.0017295544,0.0026488272,0.002659157,0.0076155434,0.0035157893,0.0041253516,0.0012858056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037232577,0.0015815848,0.0024355813,0.0004775137,0.00020405633,0.00027476094,0.00093352277,0.61824554,0.0053814487,0.28795516,0.0068892236,0.071898334],"study_design_scores_gemma":[0.00037210013,0.00039201754,0.0005431943,0.000068875604,0.00009388948,0.00004968769,0.00021197947,0.88936716,0.0008271301,0.1071378,0.00081837835,0.000117755255],"about_ca_topic_score_codex":0.006587637,"about_ca_topic_score_gemma":0.0059567504,"teacher_disagreement_score":0.013194811,"about_ca_system_score_codex":0.0067607695,"about_ca_system_score_gemma":0.006887733,"threshold_uncertainty_score":0.06978166},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39963734,0.0024325529,0.5474378,0.007927916,0.00029661987,0.000095998985,0.00026815574,0.0003141382,0.041589532],"genre_scores_gemma":[0.9851719,0.00065869465,0.006896273,0.00020574807,0.0001375682,0.000023602464,0.000055179917,0.000062579,0.006788508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717796,0.0012095282,0.000084579915,0.00023002477,0.000771733,0.00052617834],"domain_scores_gemma":[0.9874529,0.008803929,0.0007002289,0.0013385939,0.0011670949,0.00053710403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056455396,0.0009240589,0.0016251574,0.0014421503,0.0010848034,0.006196824,0.002301853,0.0029893334,0.005093947],"category_scores_gemma":[0.033769928,0.0006603801,0.0009976731,0.002082072,0.005343015,0.010575826,0.0024029252,0.0037178088,0.00054176396],"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.0004510134,0.000160051,0.0025579552,0.00012781253,0.000055849407,0.00033622258,0.0003671013,0.10327061,0.0022363593,0.84547126,0.004065267,0.0409005],"study_design_scores_gemma":[0.000030403495,0.000074947144,0.0008646493,0.00004493238,0.00004043353,0.00023372528,0.00017934854,0.40402856,0.00065135735,0.5926428,0.0011835182,0.000025340956],"about_ca_topic_score_codex":0.0021364812,"about_ca_topic_score_gemma":0.0009189091,"teacher_disagreement_score":0.006196824,"about_ca_system_score_codex":0.0045237592,"about_ca_system_score_gemma":0.0016442422,"threshold_uncertainty_score":0.03282231},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17901672,0.000892801,0.8012735,0.00922563,0.0002534572,0.00012365967,0.00052021566,0.00035732493,0.00833671],"genre_scores_gemma":[0.9684359,0.00057615316,0.021726802,0.0007170246,0.000467497,0.00008974778,0.00017704513,0.0001135748,0.007696415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923787,0.002521463,0.00045324737,0.0015069314,0.0014883088,0.0016513653],"domain_scores_gemma":[0.8700899,0.108306415,0.007098412,0.006314042,0.004953201,0.003238092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01628098,0.0009035776,0.0040782406,0.002386151,0.0022845806,0.007748557,0.0057983687,0.0050450214,0.009105093],"category_scores_gemma":[0.082921654,0.0022625076,0.001927273,0.003209484,0.004089126,0.018469814,0.004509594,0.0064878757,0.000556095],"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.00044142603,0.0001991814,0.0029538893,0.0002046756,0.00014387301,0.00054188864,0.00063790043,0.16520257,0.0013524187,0.81458145,0.004034168,0.0097066695],"study_design_scores_gemma":[0.00007955591,0.00008075905,0.00062241236,0.00002829283,0.00007584346,0.00012647733,0.00010042798,0.60675764,0.00043736608,0.39110073,0.0005272197,0.000063241954],"about_ca_topic_score_codex":0.006550929,"about_ca_topic_score_gemma":0.0036090638,"teacher_disagreement_score":0.01628098,"about_ca_system_score_codex":0.005228571,"about_ca_system_score_gemma":0.0040399977,"threshold_uncertainty_score":0.08610308},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26056758,0.0009305904,0.7285269,0.0026654361,0.00018808682,0.000087471824,0.00011741662,0.00016774956,0.0067488286],"genre_scores_gemma":[0.9877666,0.00022821047,0.00987726,0.00007289128,0.00013605773,0.000027808406,0.00002839552,0.000030430616,0.0018323066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99251103,0.002997096,0.00044508747,0.0011560004,0.0010762964,0.0018144792],"domain_scores_gemma":[0.94744307,0.03965486,0.005611503,0.003092123,0.0023492938,0.001849103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017846908,0.0012280529,0.003373411,0.0013339225,0.00142403,0.0070058457,0.0033096075,0.0030437314,0.0041209185],"category_scores_gemma":[0.055046596,0.0011755292,0.0014415208,0.0017378548,0.0040110494,0.012592139,0.004434323,0.002552874,0.00034729714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008042724,0.00018065823,0.008298677,0.00017201791,0.0003079152,0.0007202363,0.00053133257,0.7036434,0.0027294622,0.24973755,0.0014985767,0.03137589],"study_design_scores_gemma":[0.000023108862,0.0001104647,0.0010923914,0.000022019192,0.00009836709,0.00011570772,0.00022208736,0.8536842,0.0006472054,0.1435686,0.00037563872,0.000040235594],"about_ca_topic_score_codex":0.0046964483,"about_ca_topic_score_gemma":0.0018496959,"teacher_disagreement_score":0.017846908,"about_ca_system_score_codex":0.0026752949,"about_ca_system_score_gemma":0.003101085,"threshold_uncertainty_score":0.09438461},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28434682,0.0004167532,0.70006526,0.00056225393,0.00007105621,0.00014973526,0.0004652944,0.0005223945,0.013400537],"genre_scores_gemma":[0.9689622,0.0004298011,0.023756241,0.00006573065,0.00006503473,0.0002314434,0.0003641126,0.00008350473,0.006041992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924266,0.00017805389,0.000035896886,0.00016111638,0.00020523666,0.00017706263],"domain_scores_gemma":[0.99484164,0.002717697,0.0006000039,0.00038634756,0.0012470767,0.00020730933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022759442,0.00040022592,0.00059663295,0.0012962876,0.0007660942,0.0021880348,0.0013539142,0.00078777823,0.0062564784],"category_scores_gemma":[0.010639844,0.0005089556,0.0005093577,0.0009159925,0.0013172356,0.0035030523,0.0010863753,0.0012242093,0.0008801646],"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.00015213255,0.00010301896,0.0027855958,0.00006792987,0.000034096814,0.00020601267,0.00034340474,0.3630593,0.0031892776,0.6174584,0.0019785063,0.010622266],"study_design_scores_gemma":[0.000013509835,0.000037030488,0.00065242406,0.000013649676,0.000011001176,0.00005879221,0.00008681546,0.86278,0.00084198336,0.13463469,0.0008424769,0.000027646141],"about_ca_topic_score_codex":0.0017623603,"about_ca_topic_score_gemma":0.0010808052,"teacher_disagreement_score":0.0062564784,"about_ca_system_score_codex":0.0016639576,"about_ca_system_score_gemma":0.0010163903,"threshold_uncertainty_score":0.020930052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6216279,0.00029821577,0.3737305,0.0005235996,0.00007400029,0.000118955555,0.00011105815,0.00029070012,0.0032249026],"genre_scores_gemma":[0.98358613,0.00013135663,0.014797642,0.000042182728,0.000025394438,0.000047359965,0.000027476899,0.000022045275,0.0013203649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985668,0.0005892861,0.00007519526,0.00023113226,0.00023615555,0.00030138373],"domain_scores_gemma":[0.9933252,0.0046021007,0.0009890755,0.00041275178,0.0004206131,0.0002502344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038716448,0.0008746827,0.0007030851,0.0008625141,0.0007913701,0.0017649417,0.0018200012,0.0015966365,0.00091644377],"category_scores_gemma":[0.01263855,0.00083065504,0.0007260169,0.00079538237,0.0020594404,0.0025440883,0.0014947634,0.0017035577,0.00015820071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003956933,0.000044650642,0.001587564,0.00000960479,0.000010658018,0.00004711777,0.00010945121,0.9846052,0.00073070504,0.0112575255,0.00006876246,0.0014892316],"study_design_scores_gemma":[0.0000058366127,0.000013359185,0.00019004685,0.000001619899,0.000004500891,0.0000041838366,0.00001087487,0.9969304,0.00013103313,0.0026563935,0.000046562327,0.000005207301],"about_ca_topic_score_codex":0.018153897,"about_ca_topic_score_gemma":0.009368008,"teacher_disagreement_score":0.018153897,"about_ca_system_score_codex":0.0029761333,"about_ca_system_score_gemma":0.0016793981,"threshold_uncertainty_score":0.036096454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7792294,0.0005856684,0.20876881,0.0009434993,0.00008492579,0.00006104935,0.0004013828,0.00068065897,0.0092445705],"genre_scores_gemma":[0.99603003,0.00008233096,0.0023279667,0.000022994269,0.000013968359,0.000019581126,0.00005567716,0.000024194616,0.0014231281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898237,0.00022784514,0.000032015432,0.00020891066,0.00025135544,0.00029746155],"domain_scores_gemma":[0.9966074,0.0014355798,0.00033178163,0.00032303997,0.0010104357,0.00029169535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017454837,0.00047861354,0.00065587607,0.0008222022,0.0007930921,0.001258299,0.0014503511,0.0008400284,0.0025224618],"category_scores_gemma":[0.007987519,0.00040994928,0.00032358884,0.00073429185,0.0010568061,0.0013435566,0.0010675178,0.0006595574,0.00060199393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036757367,0.000041082272,0.0065159993,0.00006517891,0.00003408254,0.00043742862,0.00035593758,0.920077,0.0048615118,0.05520996,0.0028204536,0.00921379],"study_design_scores_gemma":[0.00001034753,0.000042370975,0.0010824007,0.0000065264667,0.000011708437,0.000113713315,0.000105172636,0.99072874,0.000583618,0.0068216966,0.00047797448,0.000015713274],"about_ca_topic_score_codex":0.010352259,"about_ca_topic_score_gemma":0.0031395138,"teacher_disagreement_score":0.010352259,"about_ca_system_score_codex":0.0020420882,"about_ca_system_score_gemma":0.0015763936,"threshold_uncertainty_score":0.020583987},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045220174,0.00077785103,0.93476427,0.0019283511,0.00017600226,0.00008255229,0.00026703032,0.000543598,0.016240219],"genre_scores_gemma":[0.7996011,0.0010963056,0.18600324,0.0007308111,0.000427979,0.00030790883,0.0004031166,0.0002487966,0.011180696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814713,0.00070894434,0.000055298297,0.00036841296,0.00040824385,0.0003118967],"domain_scores_gemma":[0.99561983,0.002107358,0.00072061806,0.00052088936,0.0005979743,0.00043326942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022085032,0.0008617472,0.0011696962,0.000958896,0.0011323149,0.0025413008,0.0023697985,0.001425342,0.0068653803],"category_scores_gemma":[0.01307988,0.00065039797,0.0010819013,0.00083248946,0.0018774406,0.0028603259,0.00304473,0.0025518578,0.0007701203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005925342,0.000059456743,0.0014498736,0.00007364635,0.000040600382,0.00010093352,0.000116496165,0.6640412,0.0008043952,0.31785294,0.0039519668,0.01144927],"study_design_scores_gemma":[0.000015301155,0.000027609822,0.00028671353,0.000012503847,0.000010562977,0.000038160644,0.000039923154,0.8899202,0.000171334,0.1066613,0.0028012046,0.000015204045],"about_ca_topic_score_codex":0.006519635,"about_ca_topic_score_gemma":0.0044308803,"teacher_disagreement_score":0.0068653803,"about_ca_system_score_codex":0.0030706208,"about_ca_system_score_gemma":0.002323714,"threshold_uncertainty_score":0.022966981},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024122845,0.00032316186,0.97220224,0.00023870857,0.000051585226,0.000041133524,0.000071713854,0.00009266436,0.0028559337],"genre_scores_gemma":[0.6183477,0.0006463467,0.37656707,0.00014730857,0.000091213624,0.00022707162,0.00018731318,0.00011687402,0.0036690498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999025,0.00048923236,0.00002961598,0.000106121326,0.00019664865,0.00015334174],"domain_scores_gemma":[0.9986125,0.0009112004,0.00020581929,0.00005840423,0.00013601853,0.00007595985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020910695,0.0011165551,0.001304644,0.0006529702,0.0005251717,0.0012796005,0.00072027225,0.0009193907,0.0019772216],"category_scores_gemma":[0.0033700368,0.00070176634,0.0011095146,0.001048702,0.00075590826,0.0009899357,0.00083445595,0.0017772594,0.00017643986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000296724,0.000016902148,0.00016005861,0.000028389415,0.000014212798,0.00002711819,0.000015918125,0.9847704,0.0004526462,0.008739446,0.0002547794,0.005490434],"study_design_scores_gemma":[0.000003413068,0.000009228432,0.00003642047,0.0000029628175,0.0000029924952,0.000004042179,0.000004820092,0.9957873,0.00011822456,0.0039035717,0.00012475598,0.000002221129],"about_ca_topic_score_codex":0.0053026974,"about_ca_topic_score_gemma":0.0037544756,"teacher_disagreement_score":0.0053026974,"about_ca_system_score_codex":0.0016098607,"about_ca_system_score_gemma":0.0018083053,"threshold_uncertainty_score":0.011680424},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3431161,0.0026606568,0.6299118,0.00523819,0.00058649585,0.00011768736,0.0003257097,0.00021895538,0.017824287],"genre_scores_gemma":[0.98424894,0.00078746316,0.009762076,0.00016149445,0.0003182926,0.00007717555,0.000046615598,0.000046850113,0.0045511075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956305,0.0016255048,0.00022476196,0.00075690815,0.000603269,0.0011590046],"domain_scores_gemma":[0.9442863,0.04005202,0.005079377,0.0030435554,0.0031453052,0.004393483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008354443,0.0009961706,0.0017620712,0.0016067359,0.0014719106,0.0056351633,0.0039713434,0.0025916484,0.008834114],"category_scores_gemma":[0.034788374,0.0007458104,0.0010201368,0.0021039296,0.0036404775,0.012185567,0.0032292968,0.0026612417,0.0005413077],"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.0005463226,0.0003717774,0.0071252445,0.000220664,0.00012762396,0.00016717239,0.0006947763,0.21411552,0.002383403,0.74804646,0.0022390746,0.02396198],"study_design_scores_gemma":[0.00004768332,0.00011368824,0.0019166917,0.000051811458,0.0000776212,0.00006488896,0.00036094215,0.7426883,0.00050734944,0.25310782,0.001000035,0.000063065694],"about_ca_topic_score_codex":0.0070818285,"about_ca_topic_score_gemma":0.005057234,"teacher_disagreement_score":0.008834114,"about_ca_system_score_codex":0.0035371953,"about_ca_system_score_gemma":0.0034012222,"threshold_uncertainty_score":0.044183016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8231988,0.0005585179,0.16083728,0.002039456,0.00015502732,0.00021932754,0.00013072586,0.0003616572,0.012499225],"genre_scores_gemma":[0.9738056,0.00007275,0.025005952,0.000115617324,0.00003424892,0.000021231348,0.000042411884,0.0000385784,0.0008635451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963862,0.0016092468,0.00014998278,0.0004692038,0.0004010307,0.0009843642],"domain_scores_gemma":[0.990577,0.0051761586,0.00039489244,0.0013903469,0.0008660609,0.0015955783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005265129,0.00070706196,0.0013817976,0.0011578106,0.0020062164,0.004017915,0.002065144,0.0014259795,0.008007216],"category_scores_gemma":[0.013858942,0.0007089856,0.00087212655,0.0016202534,0.00086477667,0.0053374986,0.0021609468,0.0016445443,0.0007279508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009169085,0.0020218415,0.05495564,0.00022864004,0.0007977346,0.0018691381,0.00071895396,0.45966503,0.020516686,0.13979827,0.011924579,0.2983344],"study_design_scores_gemma":[0.00025919787,0.00051240146,0.0053586205,0.000032883025,0.00020686508,0.00028737605,0.0009252303,0.91430557,0.0047227805,0.07092792,0.0023973794,0.00006378426],"about_ca_topic_score_codex":0.0018086745,"about_ca_topic_score_gemma":0.0043428047,"teacher_disagreement_score":0.008007216,"about_ca_system_score_codex":0.0014953684,"about_ca_system_score_gemma":0.0019068515,"threshold_uncertainty_score":0.027845025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17220439,0.0019997745,0.81032795,0.001763554,0.0003936248,0.00013792989,0.0005131378,0.0003732303,0.012286409],"genre_scores_gemma":[0.943544,0.0014321116,0.038530614,0.00034594545,0.00052195095,0.00015307954,0.00026409142,0.00009953632,0.015108691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975043,0.00079991,0.00009741479,0.0003984362,0.00059206755,0.00060788635],"domain_scores_gemma":[0.9960443,0.0021801107,0.00054393575,0.00019424935,0.000581022,0.00045647233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003129473,0.0018044336,0.002300491,0.0017799406,0.0015253919,0.0041651265,0.0037600568,0.0024987059,0.003762889],"category_scores_gemma":[0.0065949373,0.0011084097,0.0016175753,0.0022863236,0.0023215374,0.004210327,0.0020081927,0.002044486,0.0005677679],"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.00024440893,0.000091093825,0.00090836437,0.00010946771,0.00005598192,0.00045877186,0.00015439057,0.82364583,0.002056506,0.16825442,0.0009868584,0.0030338485],"study_design_scores_gemma":[0.000019788957,0.000021378932,0.00007186307,0.000004811703,0.000009747942,0.000019684456,0.000012835528,0.9875052,0.000041571722,0.012106275,0.00017523511,0.000011591765],"about_ca_topic_score_codex":0.024736697,"about_ca_topic_score_gemma":0.012896091,"teacher_disagreement_score":0.024736697,"about_ca_system_score_codex":0.0042399988,"about_ca_system_score_gemma":0.002871385,"threshold_uncertainty_score":0.049185455},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009802698,0.012425778,0.6352446,0.0024694374,0.0037275355,0.00008349597,0.00040763593,0.0010351585,0.3348036],"genre_scores_gemma":[0.3801719,0.029672235,0.11682254,0.001797471,0.005153103,0.00034043836,0.0012377711,0.00107302,0.46373156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956053,0.00008348549,0.00001741839,0.000107726715,0.00015818124,0.000072641866],"domain_scores_gemma":[0.99947363,0.00016320415,0.000029013694,0.00015148599,0.00013425626,0.00004839973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069068593,0.0011599306,0.0009184189,0.0008358255,0.0007346579,0.0021011892,0.0018587213,0.0013411032,0.010998679],"category_scores_gemma":[0.0018716911,0.000568171,0.0010460344,0.0011937511,0.0011614453,0.0038644867,0.0015107824,0.0027007512,0.0048353286],"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.000010501003,0.000027176244,0.00005483912,0.00007540409,0.00001134072,0.000052142346,0.00009042753,0.015094352,0.000624072,0.93846846,0.022397313,0.023094049],"study_design_scores_gemma":[0.000004917522,0.00001281974,0.00007337306,0.000050838822,0.000013501571,0.000120580466,0.000023125254,0.07752437,0.00042955554,0.8499154,0.07181596,0.000015434445],"about_ca_topic_score_codex":0.0015518848,"about_ca_topic_score_gemma":0.0011534737,"teacher_disagreement_score":0.010998679,"about_ca_system_score_codex":0.0017439415,"about_ca_system_score_gemma":0.0013001163,"threshold_uncertainty_score":0.036794186},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010019976,0.013501089,0.7902671,0.002567577,0.0020406577,0.0000838837,0.0005382832,0.0010709624,0.17991045],"genre_scores_gemma":[0.34849694,0.03497061,0.13195285,0.0012236023,0.0019521844,0.0003322656,0.0013166115,0.0008253788,0.47892955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996226,0.00006458049,0.000014220856,0.000063774016,0.00018781552,0.000047039928],"domain_scores_gemma":[0.9995028,0.00018036313,0.000030401352,0.000087562614,0.00015957252,0.00003939322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000646882,0.0010965096,0.00078219967,0.0007912713,0.000556399,0.0020995762,0.0021175474,0.0012333672,0.010466883],"category_scores_gemma":[0.0016507934,0.00055967254,0.00065856153,0.0015888694,0.0006803446,0.00291186,0.0009821965,0.0022293334,0.0051251925],"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.000024009416,0.000065677385,0.000120754514,0.00010973966,0.000021269887,0.00007557734,0.00010728172,0.12046564,0.0011617778,0.7920711,0.03388487,0.051892318],"study_design_scores_gemma":[0.000007747969,0.00001630964,0.000117274285,0.000065408254,0.000015108974,0.000077286306,0.000027066651,0.36049965,0.00059153687,0.5787225,0.059836432,0.00002375697],"about_ca_topic_score_codex":0.0023145953,"about_ca_topic_score_gemma":0.0018625986,"teacher_disagreement_score":0.010466883,"about_ca_system_score_codex":0.0019574808,"about_ca_system_score_gemma":0.0014180156,"threshold_uncertainty_score":0.035015166},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017140087,0.0042182417,0.7284418,0.0018190924,0.0013730432,0.00006818868,0.00029188048,0.0016565394,0.24499115],"genre_scores_gemma":[0.6259147,0.0069727865,0.21410663,0.0008958731,0.0024390938,0.00017875868,0.00047279056,0.0005976741,0.14842167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995927,0.00006445944,0.000019192725,0.00008177224,0.00018839039,0.000053427946],"domain_scores_gemma":[0.9992861,0.00033972852,0.000046030207,0.00020205314,0.00009630121,0.000029885492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061500334,0.00053897745,0.0004669633,0.0004827225,0.00071641227,0.002665272,0.0011765043,0.0012590399,0.014161551],"category_scores_gemma":[0.002097576,0.00045228438,0.00048460302,0.001049392,0.0010413418,0.0047210436,0.00076315517,0.0025040146,0.002827458],"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.000039560677,0.00002079689,0.0000869368,0.000052175837,0.000008458308,0.00007853981,0.00005671087,0.0047162934,0.0018909484,0.93137866,0.009516922,0.05215414],"study_design_scores_gemma":[0.000024690318,0.000039089628,0.00023940504,0.000040444396,0.000022100536,0.00039031872,0.000028957002,0.052691612,0.003413958,0.85224235,0.0908487,0.000018346904],"about_ca_topic_score_codex":0.00047800556,"about_ca_topic_score_gemma":0.00037586456,"teacher_disagreement_score":0.014161551,"about_ca_system_score_codex":0.00066012086,"about_ca_system_score_gemma":0.00066426717,"threshold_uncertainty_score":0.047375143},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048047185,0.00022209705,0.9467913,0.0003955387,0.00010745556,0.00006941989,0.00005619768,0.00028135578,0.0040294593],"genre_scores_gemma":[0.95190406,0.00017425303,0.043700326,0.000071411414,0.00010226608,0.00006112588,0.00006282466,0.0001032356,0.0038205155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969632,0.0009921632,0.0001239501,0.00048632856,0.0007300472,0.0007043137],"domain_scores_gemma":[0.99328643,0.004771201,0.000535413,0.00062056124,0.00049721106,0.0002890963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004703454,0.0011830955,0.0019112699,0.00079890847,0.0008165124,0.003798748,0.0032919843,0.0018638088,0.004844922],"category_scores_gemma":[0.017486013,0.0010093426,0.0011719525,0.0015450241,0.0017145893,0.005943024,0.0020985312,0.0026845655,0.0005895661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023286023,0.00013911762,0.0004987275,0.00009368015,0.00004677653,0.0002778663,0.0001194345,0.83954746,0.002739911,0.13081923,0.0011127329,0.024372146],"study_design_scores_gemma":[0.000007684359,0.0000152472485,0.00005675325,0.0000026714888,0.000007720145,0.000024511768,0.000009482991,0.9847366,0.00019731415,0.014809865,0.0001245429,0.000007612839],"about_ca_topic_score_codex":0.0039278986,"about_ca_topic_score_gemma":0.0025756801,"teacher_disagreement_score":0.004844922,"about_ca_system_score_codex":0.0026666145,"about_ca_system_score_gemma":0.0025092892,"threshold_uncertainty_score":0.024874508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03463061,0.0001071869,0.96415484,0.000072404444,0.000010383953,0.00003357087,0.000045738136,0.00013178444,0.0008135315],"genre_scores_gemma":[0.81718546,0.00025364288,0.18050413,0.000040802664,0.000023792427,0.0001302032,0.00023652942,0.00009443359,0.0015310079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985331,0.0005637817,0.00005794661,0.00031591635,0.00032500998,0.00020421305],"domain_scores_gemma":[0.9911176,0.0070314743,0.0006315304,0.00033205602,0.00073014863,0.00015716601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050589205,0.0007985732,0.0014115424,0.0018291371,0.0006553168,0.002115917,0.0015765025,0.001366162,0.0020421457],"category_scores_gemma":[0.015444444,0.00094638026,0.0011056877,0.0016513703,0.0011802668,0.0041776807,0.00079423527,0.0014547914,0.0003719467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032504373,0.00002197641,0.0015495453,0.00002644649,0.000017969185,0.000044220746,0.000028637667,0.9692713,0.0007298181,0.015473318,0.0002949595,0.012509314],"study_design_scores_gemma":[0.0000013591176,0.0000071298764,0.00024584026,0.0000030294286,0.0000029057398,0.000009934508,0.000004436428,0.9935661,0.00023149242,0.005831722,0.00009125581,0.000004819593],"about_ca_topic_score_codex":0.010443583,"about_ca_topic_score_gemma":0.0063478933,"teacher_disagreement_score":0.010443583,"about_ca_system_score_codex":0.0034022455,"about_ca_system_score_gemma":0.002676256,"threshold_uncertainty_score":0.026754439},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14974697,0.0005193937,0.8418426,0.0007793718,0.00010096176,0.00024262213,0.00026199603,0.00028720516,0.0062188758],"genre_scores_gemma":[0.8854102,0.0001999613,0.107888795,0.00014364497,0.00004399157,0.0003323956,0.00017234273,0.00008518608,0.0057234038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985858,0.0006289967,0.00004328536,0.00019513506,0.00017457963,0.00037213584],"domain_scores_gemma":[0.99583,0.0028190566,0.00042905082,0.00011530299,0.00030618772,0.0005005015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028647152,0.0013231738,0.0024176408,0.000825477,0.0009337767,0.0018109134,0.002699267,0.0030019071,0.0057551204],"category_scores_gemma":[0.005141362,0.0014973497,0.0014566857,0.0009460105,0.0014198249,0.0013647466,0.0017280887,0.0021874937,0.00026632115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057138765,0.000028154998,0.00017768137,0.000018826056,0.000013272085,0.0000521025,0.000018711911,0.99448156,0.00015693088,0.0036443789,0.00010805622,0.0012432096],"study_design_scores_gemma":[0.000014497217,0.000018980165,0.000037230067,0.00000245268,0.0000036753238,0.000005132996,0.0000051805227,0.9982602,0.000074092466,0.0014952089,0.00007921416,0.0000041551025],"about_ca_topic_score_codex":0.015413504,"about_ca_topic_score_gemma":0.008523702,"teacher_disagreement_score":0.015413504,"about_ca_system_score_codex":0.002224136,"about_ca_system_score_gemma":0.0025399462,"threshold_uncertainty_score":0.030647576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6031337,0.0008600954,0.37277013,0.0028258222,0.00019911429,0.0001390494,0.00017985252,0.0003677062,0.019524585],"genre_scores_gemma":[0.9874699,0.00015093517,0.0085133575,0.00008336887,0.000033068394,0.000025099835,0.000021159512,0.000023261997,0.0036798997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989064,0.00050314335,0.000047247442,0.00016770892,0.00010082203,0.000274582],"domain_scores_gemma":[0.99316955,0.0049354816,0.00067349314,0.00021719931,0.0004009481,0.00060324284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031611791,0.0009203057,0.0016361277,0.0006045316,0.0005697824,0.002765645,0.0016374143,0.0026535806,0.0033489338],"category_scores_gemma":[0.010567218,0.0008503992,0.0005890651,0.0005039748,0.001242199,0.0026997726,0.0011166071,0.0019119259,0.0003742217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017087026,0.00031876648,0.0019444659,0.00020247833,0.00015014401,0.0007137745,0.00031310116,0.7252381,0.012881572,0.23195413,0.0032611596,0.021313617],"study_design_scores_gemma":[0.00008166255,0.00012934755,0.00034650907,0.000011506709,0.000032140673,0.0000568715,0.000049486363,0.9646109,0.00095544796,0.033467755,0.00023130805,0.000027124048],"about_ca_topic_score_codex":0.0031658374,"about_ca_topic_score_gemma":0.0019737647,"teacher_disagreement_score":0.0033489338,"about_ca_system_score_codex":0.0021696412,"about_ca_system_score_gemma":0.0026185615,"threshold_uncertainty_score":0.01671809},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011626251,0.0004284581,0.98246694,0.00045649902,0.00012738713,0.00004977508,0.0000377578,0.000068020585,0.0047389953],"genre_scores_gemma":[0.65567666,0.0016372595,0.31801036,0.000564972,0.0006265863,0.00070424005,0.00018010044,0.00019348806,0.0224064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929535,0.00041463974,0.000032568652,0.000068094036,0.00013074833,0.0000585395],"domain_scores_gemma":[0.99658585,0.0022625234,0.00034927225,0.0001286491,0.00039568788,0.00027795893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028242317,0.0010271868,0.00072887994,0.000971877,0.00052916945,0.000981711,0.0013467566,0.0011689205,0.004455326],"category_scores_gemma":[0.0049768453,0.00034970755,0.001655208,0.00044711784,0.0014670667,0.0015702238,0.0019314988,0.0019935549,0.0006273166],"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.00007234815,0.000080572834,0.00065510784,0.00018462999,0.00006315941,0.00030436626,0.00044063624,0.13008232,0.004314025,0.849877,0.0018234948,0.012102397],"study_design_scores_gemma":[0.000016170055,0.000040227293,0.000080427926,0.000014971866,0.000009285787,0.000042364558,0.0000371167,0.88831234,0.00021196828,0.110449865,0.00077288196,0.000012360941],"about_ca_topic_score_codex":0.0025010484,"about_ca_topic_score_gemma":0.0014026058,"teacher_disagreement_score":0.004455326,"about_ca_system_score_codex":0.001219238,"about_ca_system_score_gemma":0.00150473,"threshold_uncertainty_score":0.014936149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54475516,0.00052810425,0.44893092,0.00097044994,0.00010083266,0.00006653734,0.00017478706,0.00023483961,0.004238347],"genre_scores_gemma":[0.9921963,0.00010798305,0.00628147,0.000058332764,0.000035244353,0.000026668637,0.000050757917,0.000014521031,0.0012287986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985311,0.00035545632,0.00008531591,0.00026624496,0.00038930995,0.00037251023],"domain_scores_gemma":[0.9930495,0.003323093,0.0013208868,0.0003050787,0.0013520411,0.00064937014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002591582,0.000650557,0.00090356776,0.000873756,0.00075804786,0.0015932606,0.0016855516,0.0009838027,0.0011429954],"category_scores_gemma":[0.009232236,0.00042958258,0.0004915187,0.00062747777,0.0014006317,0.001486791,0.0015721396,0.0010817657,0.00023882047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009622701,0.00020886751,0.009768683,0.0001512377,0.00014477684,0.0008642428,0.00069122214,0.7214753,0.020801255,0.23218119,0.002390653,0.010360323],"study_design_scores_gemma":[0.000030428953,0.000040111943,0.00037591215,0.000003823927,0.000007849167,0.000030745803,0.000030798095,0.98983544,0.0003154038,0.009198676,0.000116656,0.000014152951],"about_ca_topic_score_codex":0.0065063373,"about_ca_topic_score_gemma":0.0024357233,"teacher_disagreement_score":0.0065063373,"about_ca_system_score_codex":0.002365721,"about_ca_system_score_gemma":0.0014154696,"threshold_uncertainty_score":0.017164588},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97587323,0.00015227369,0.019346774,0.0002852617,0.000019047657,0.00017844427,0.00018568935,0.00008292797,0.0038762984],"genre_scores_gemma":[0.9925701,0.000103950915,0.0065592043,0.000015795127,0.000007916397,0.00005390249,0.000078285004,0.000008307016,0.0006024643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874556,0.00055331003,0.000049891307,0.00012295536,0.0002311818,0.0002970557],"domain_scores_gemma":[0.9935207,0.004847293,0.00050504185,0.00026944638,0.00036291286,0.0004947056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018672016,0.0007006303,0.0005419858,0.001084604,0.0012735164,0.0011273903,0.0017374678,0.0018330241,0.0018103954],"category_scores_gemma":[0.0042539765,0.00041858276,0.0005901744,0.0016361263,0.0016944791,0.0012461197,0.000920896,0.0009778775,0.0001403283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003278702,0.0009521914,0.014695336,0.00013618462,0.000057311783,0.0033569762,0.000538426,0.9526753,0.0019847248,0.015648311,0.000991682,0.008635693],"study_design_scores_gemma":[0.00006867483,0.00026903625,0.0029276654,0.000011781978,0.00002195239,0.0002453168,0.00089742575,0.99038637,0.0010326903,0.0033796185,0.0007345939,0.000024878165],"about_ca_topic_score_codex":0.01803512,"about_ca_topic_score_gemma":0.016297905,"teacher_disagreement_score":0.01803512,"about_ca_system_score_codex":0.003010803,"about_ca_system_score_gemma":0.0014472516,"threshold_uncertainty_score":0.0358603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1439238,0.001823532,0.84186745,0.001988108,0.00018027943,0.000108605884,0.00026602924,0.00048602623,0.009356147],"genre_scores_gemma":[0.97294295,0.00062678236,0.022255385,0.00015158496,0.00011365181,0.0000714737,0.00010595575,0.000094734954,0.0036375015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979796,0.00064422435,0.000075487784,0.0002234853,0.0005357357,0.00054148346],"domain_scores_gemma":[0.98814386,0.009182377,0.0010035874,0.0004765249,0.0007679428,0.00042568243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048024543,0.0011714922,0.00149955,0.0011533513,0.0007668027,0.0020470512,0.0025298283,0.0017252694,0.0028936327],"category_scores_gemma":[0.020281447,0.0009972716,0.00090707676,0.0010375209,0.0022306736,0.0029541897,0.0018709521,0.0021499249,0.00025781954],"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.00003920394,0.000029165305,0.00053199875,0.000046891848,0.000020297268,0.0000632616,0.00006244223,0.94369173,0.00087413855,0.051378425,0.0004670327,0.002795362],"study_design_scores_gemma":[0.0000027793944,0.000004928702,0.000081088736,0.000002722124,0.0000028223503,0.0000053486824,0.000007177479,0.9914615,0.00006345346,0.008306705,0.000057700585,0.000003734481],"about_ca_topic_score_codex":0.010625919,"about_ca_topic_score_gemma":0.007489685,"teacher_disagreement_score":0.010625919,"about_ca_system_score_codex":0.0042328797,"about_ca_system_score_gemma":0.0033460814,"threshold_uncertainty_score":0.03071189},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53645444,0.0004868911,0.4532051,0.0005672894,0.00006907972,0.000080742895,0.0003325276,0.0010337781,0.007770139],"genre_scores_gemma":[0.95299023,0.00009656628,0.045262147,0.000036236364,0.00001815171,0.000042533862,0.00011064223,0.000091884445,0.0013515378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999777,0.00008944079,0.000007867056,0.000023414388,0.00006415148,0.000038178256],"domain_scores_gemma":[0.99753064,0.0020223556,0.00012013011,0.00008412338,0.00019526451,0.00004757751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009846184,0.00041524315,0.0005866949,0.0006138708,0.000520208,0.0006637536,0.00094836415,0.0005990398,0.0032085732],"category_scores_gemma":[0.0043662754,0.0002293971,0.000289496,0.0005944434,0.00042973642,0.0012065041,0.0005332299,0.00095134473,0.0002550295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094569834,0.0000641993,0.0010242463,0.000069172405,0.000014449038,0.00013089289,0.000110917455,0.9634132,0.0029859333,0.022077175,0.00072415225,0.009291049],"study_design_scores_gemma":[0.0000027219712,0.000004001294,0.000053467127,0.0000010772235,6.208787e-7,0.000004411947,0.000006960296,0.998993,0.00018453629,0.00070901914,0.000038351973,0.0000018759538],"about_ca_topic_score_codex":0.005732926,"about_ca_topic_score_gemma":0.0037934913,"teacher_disagreement_score":0.005732926,"about_ca_system_score_codex":0.0009100457,"about_ca_system_score_gemma":0.0008344524,"threshold_uncertainty_score":0.01139909},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78442234,0.00072445563,0.20255557,0.00057944923,0.00008571716,0.000067320216,0.00005797104,0.00033601353,0.011171143],"genre_scores_gemma":[0.9970245,0.00012727386,0.0023315214,0.000029715062,0.000019202931,0.000010461582,0.0000060566276,0.000012387873,0.0004388658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959046,0.00010939263,0.000018682882,0.000069947484,0.00013644743,0.00007509711],"domain_scores_gemma":[0.9983565,0.00079099694,0.0004050638,0.0001527786,0.00017909966,0.00011543865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073515135,0.00036451066,0.0003404493,0.00048665743,0.0004562946,0.00087563373,0.0004326954,0.00036288227,0.0012487889],"category_scores_gemma":[0.00396616,0.00025940101,0.000377463,0.00027699725,0.0011002723,0.0011686044,0.00087191677,0.00048822002,0.00007506781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012923592,0.000083435334,0.0076679364,0.000101605554,0.00007235147,0.0004550894,0.00063419045,0.7682006,0.031916253,0.17314571,0.0006290421,0.016964493],"study_design_scores_gemma":[0.000015058776,0.00006111247,0.001392987,0.0000088159995,0.000014051672,0.00008338193,0.00006591965,0.9737902,0.0017251823,0.02205216,0.00077312026,0.000017878],"about_ca_topic_score_codex":0.004956527,"about_ca_topic_score_gemma":0.0013527651,"teacher_disagreement_score":0.004956527,"about_ca_system_score_codex":0.0007695591,"about_ca_system_score_gemma":0.0005224399,"threshold_uncertainty_score":0.00985533},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15038705,0.00025858043,0.84306616,0.0010625558,0.00014709782,0.00028281473,0.00032901458,0.0002769822,0.004189668],"genre_scores_gemma":[0.949558,0.00018276832,0.042709347,0.00010174345,0.00011109939,0.00033599223,0.00020870668,0.000062999774,0.0067293867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951918,0.002126057,0.000257266,0.0008369835,0.00076473295,0.00082311145],"domain_scores_gemma":[0.98851204,0.007822908,0.0013161217,0.00053719396,0.0009151325,0.00089662214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052474565,0.0012389779,0.0026325039,0.00093848654,0.0008467933,0.0019369537,0.0026179971,0.0017930885,0.0065381215],"category_scores_gemma":[0.010707599,0.0011066572,0.0010218414,0.0013296499,0.0018723923,0.0019908624,0.0019217884,0.0016086156,0.00059350923],"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.00038802013,0.00012336564,0.0007751641,0.00009065028,0.00006232561,0.00020208949,0.00009476378,0.9420002,0.0012866844,0.043890674,0.0011117753,0.009974257],"study_design_scores_gemma":[0.000038627608,0.00004601285,0.00015761319,0.00000604332,0.0000087626995,0.000027722996,0.0000217593,0.9783134,0.00021372747,0.020856332,0.00030059653,0.000009439617],"about_ca_topic_score_codex":0.0042641186,"about_ca_topic_score_gemma":0.0022443112,"teacher_disagreement_score":0.0065381215,"about_ca_system_score_codex":0.0019887432,"about_ca_system_score_gemma":0.0018398514,"threshold_uncertainty_score":0.027751565},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11089796,0.0009054787,0.8780141,0.0003382291,0.00004901282,0.000045358724,0.00006924352,0.00025188708,0.009428766],"genre_scores_gemma":[0.9366984,0.00039129867,0.060704518,0.000078815254,0.00005803265,0.00007662677,0.000041376054,0.00004730722,0.0019036331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983736,0.0008394261,0.000043953383,0.00010744868,0.00039552466,0.00024008115],"domain_scores_gemma":[0.9958882,0.0030350413,0.0002886062,0.0002623535,0.0004177602,0.00010811396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023320797,0.00048814833,0.00055603666,0.00080778525,0.00063285214,0.0011673326,0.001071618,0.0004724843,0.0012833861],"category_scores_gemma":[0.007624734,0.00045910105,0.00044082472,0.0011869966,0.0012937203,0.001425951,0.0012422861,0.0007871523,0.0002212826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009976029,0.000017770979,0.00043174732,0.000037194604,0.000017813534,0.00005297002,0.00007280815,0.9234358,0.0018543949,0.05618026,0.00040750884,0.017392019],"study_design_scores_gemma":[0.0000032073408,0.000011446902,0.000088149915,0.000004095184,0.000003080642,0.0000141154915,0.000008800958,0.98633844,0.0009667558,0.012271784,0.00028564848,0.0000045895044],"about_ca_topic_score_codex":0.0026505361,"about_ca_topic_score_gemma":0.0020428523,"teacher_disagreement_score":0.0026505361,"about_ca_system_score_codex":0.0021358542,"about_ca_system_score_gemma":0.0008903052,"threshold_uncertainty_score":0.01549679},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16242819,0.00043347926,0.8264018,0.00074956985,0.000064528314,0.00010970933,0.00029919113,0.000577019,0.008936513],"genre_scores_gemma":[0.8709466,0.00027985292,0.12511376,0.00008656121,0.000073260366,0.00023160076,0.0004356086,0.0001242963,0.0027084323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995291,0.00015746796,0.0000200103,0.00006819953,0.00011273902,0.00011247312],"domain_scores_gemma":[0.9954703,0.0038121913,0.00017587094,0.00013602182,0.0003082636,0.000097390424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015284022,0.0006233333,0.0010686106,0.0008520546,0.0008551866,0.0012891109,0.0011813055,0.0007507152,0.0052834814],"category_scores_gemma":[0.0067893337,0.00041933477,0.0007864183,0.00069730176,0.00080884626,0.0014778599,0.0008155727,0.0011864908,0.00043641133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054108452,0.000048785067,0.0008650478,0.00005237404,0.00001591549,0.000055978835,0.000043051477,0.9652834,0.00050280255,0.023379585,0.0004442374,0.0092548095],"study_design_scores_gemma":[0.0000021521078,0.000002730891,0.00003919519,0.0000012434757,0.0000010352035,0.0000022119248,0.0000039991637,0.99780995,0.000059036745,0.0020517374,0.000025703119,9.618867e-7],"about_ca_topic_score_codex":0.01099885,"about_ca_topic_score_gemma":0.009171858,"teacher_disagreement_score":0.01099885,"about_ca_system_score_codex":0.0018747984,"about_ca_system_score_gemma":0.00308351,"threshold_uncertainty_score":0.02186966},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108335175,0.0031721178,0.883308,0.00066489016,0.00037719586,0.00012025939,0.00077780883,0.001937501,0.0013069628],"genre_scores_gemma":[0.81402063,0.0016091252,0.17986856,0.00018770625,0.00042419878,0.00016593003,0.0010610234,0.00012416297,0.0025387004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992555,0.00013808793,0.00005267262,0.00016711808,0.00028967345,0.000096972864],"domain_scores_gemma":[0.9934267,0.0038810614,0.00067266345,0.00036701036,0.001230124,0.0004225452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001913528,0.0012696324,0.0013032766,0.0015494941,0.0006306259,0.0015526252,0.0013268599,0.0008575304,0.00148697],"category_scores_gemma":[0.010355189,0.0006856083,0.00044762294,0.0015061907,0.000547646,0.0025666654,0.0010212361,0.0024361312,0.00039724662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002708884,0.00018430612,0.011283951,0.00013087233,0.00007150322,0.00007651492,0.000066979475,0.88713694,0.0018933228,0.0033973248,0.0020424686,0.093444884],"study_design_scores_gemma":[0.00000778979,0.000039899987,0.00055313663,0.000007386741,0.000009122974,0.00001098481,0.0000050455506,0.9974177,0.0005376896,0.0010378466,0.0003618087,0.0000115343455],"about_ca_topic_score_codex":0.009297733,"about_ca_topic_score_gemma":0.009741033,"teacher_disagreement_score":0.009297733,"about_ca_system_score_codex":0.0011490679,"about_ca_system_score_gemma":0.002122954,"threshold_uncertainty_score":0.018487215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.861268,0.00030740228,0.13481863,0.00040350395,0.000043214022,0.000029385157,0.00016315462,0.00024795326,0.0027188365],"genre_scores_gemma":[0.9974733,0.000052185533,0.0014935693,0.000017632676,0.000007967523,0.00000778862,0.000029801786,0.000011751508,0.0009060879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922717,0.00019483645,0.000027485163,0.00014291673,0.00015561726,0.00025194243],"domain_scores_gemma":[0.996385,0.0016234014,0.0005626156,0.00030214965,0.00084230513,0.00028454664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016066472,0.0005963933,0.0008215166,0.0005712601,0.0004755847,0.0008362449,0.0011052755,0.00075634953,0.0011922534],"category_scores_gemma":[0.005716885,0.00030320516,0.00042738125,0.0006845663,0.0012206744,0.0009935338,0.0008287773,0.00063620973,0.0002744654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028939627,0.00005971773,0.0036461854,0.000048107984,0.000034416425,0.0004377413,0.0001567875,0.9615403,0.0073473547,0.022004677,0.00083566544,0.003599677],"study_design_scores_gemma":[0.0000063829875,0.000029021883,0.0005278085,0.0000027513593,0.000008140992,0.000046101977,0.00003132049,0.99621236,0.0004731809,0.0026003143,0.000054201042,0.000008381409],"about_ca_topic_score_codex":0.006382334,"about_ca_topic_score_gemma":0.0024885105,"teacher_disagreement_score":0.006382334,"about_ca_system_score_codex":0.0015755878,"about_ca_system_score_gemma":0.001416767,"threshold_uncertainty_score":0.012690365},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17889413,0.005437367,0.7914513,0.0027401112,0.00029086982,0.0001663467,0.00029627737,0.0009254983,0.019798066],"genre_scores_gemma":[0.95799243,0.0016297451,0.036360376,0.00041836998,0.00032983776,0.00012542758,0.00020131163,0.0002594042,0.002683199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99146616,0.0039824545,0.00037102244,0.0007956114,0.0017825253,0.0016021882],"domain_scores_gemma":[0.9191903,0.067247115,0.0042345533,0.0028884003,0.0050339038,0.0014056468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016674146,0.0020725322,0.0021665618,0.0023885553,0.0010617605,0.0055589955,0.0028011217,0.0028178722,0.004239362],"category_scores_gemma":[0.07858023,0.0013232412,0.0010753106,0.002042411,0.003699496,0.0058628754,0.00416666,0.0036717048,0.00062430097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081701565,0.00022861069,0.001195732,0.00029505754,0.00010224122,0.000094790434,0.00024259131,0.887598,0.0051625655,0.08320056,0.0017928601,0.019269994],"study_design_scores_gemma":[0.000025814546,0.000118848766,0.00040269605,0.000048438156,0.000028046048,0.00003716437,0.00003725898,0.97565174,0.0007878066,0.02262823,0.00020934496,0.00002461628],"about_ca_topic_score_codex":0.0052527534,"about_ca_topic_score_gemma":0.0027029777,"teacher_disagreement_score":0.016674146,"about_ca_system_score_codex":0.0064732437,"about_ca_system_score_gemma":0.005182259,"threshold_uncertainty_score":0.08818239},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019433787,0.00023322109,0.97822773,0.00012932174,0.000034686782,0.000030208737,0.000033786655,0.00007922676,0.0017980908],"genre_scores_gemma":[0.8761308,0.0010064117,0.11327112,0.00021271314,0.00029251937,0.0001879537,0.00014060136,0.00013553687,0.008622296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870753,0.00047681708,0.00008666598,0.00024518237,0.00033745114,0.00014639644],"domain_scores_gemma":[0.99477994,0.0030488633,0.0007340458,0.00032895315,0.0006373786,0.00047076572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042211544,0.0009854847,0.0010194246,0.0024962826,0.0006619504,0.0022223915,0.0019082987,0.0015236114,0.002966461],"category_scores_gemma":[0.010574319,0.00063390733,0.0015700272,0.0010685434,0.0025525715,0.0032457476,0.002543913,0.00227814,0.000259425],"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.00003928772,0.000059309164,0.0013746655,0.00007898524,0.00005134455,0.00044183558,0.0002850002,0.123555206,0.004806937,0.8606915,0.0004185877,0.00819739],"study_design_scores_gemma":[0.000007130683,0.00003715407,0.00028001546,0.000013042256,0.00002604654,0.00007113123,0.000032470485,0.8757983,0.00087895175,0.122128345,0.00071003777,0.00001732154],"about_ca_topic_score_codex":0.002135708,"about_ca_topic_score_gemma":0.0011574043,"teacher_disagreement_score":0.0042211544,"about_ca_system_score_codex":0.0017237869,"about_ca_system_score_gemma":0.0010807712,"threshold_uncertainty_score":0.022323847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93393576,0.00021354159,0.056783117,0.0011290349,0.000029247736,0.00006299059,0.00025812179,0.00011300879,0.0074751624],"genre_scores_gemma":[0.9963406,0.000079512865,0.0027088118,0.000034242606,0.00000772503,0.000018011746,0.000034399647,0.000011505331,0.00076529954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998197,0.00065679994,0.000044994915,0.00016265779,0.0001607548,0.00077775755],"domain_scores_gemma":[0.98838276,0.008887999,0.0010526452,0.00042860807,0.0005722259,0.0006756885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029531424,0.00062614883,0.0011077384,0.0007580428,0.0007958891,0.0026856062,0.0015736275,0.001620589,0.004109092],"category_scores_gemma":[0.013843662,0.00042644705,0.0008910656,0.00069781987,0.0017266037,0.0033909127,0.0013821134,0.001551502,0.00020244054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083258864,0.00052483677,0.0067112474,0.00008085707,0.000052820622,0.00028954938,0.00015283775,0.84852004,0.0033711917,0.13209753,0.0011824558,0.0061840354],"study_design_scores_gemma":[0.00007290435,0.0001427176,0.0016277668,0.0000132288915,0.000029801766,0.000040646093,0.00014117669,0.96442145,0.0007057078,0.032639552,0.000134776,0.000030304838],"about_ca_topic_score_codex":0.0100493515,"about_ca_topic_score_gemma":0.0057496116,"teacher_disagreement_score":0.0100493515,"about_ca_system_score_codex":0.0042965924,"about_ca_system_score_gemma":0.0028269137,"threshold_uncertainty_score":0.031174064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10981705,0.00085028325,0.8709235,0.0021039236,0.00030860148,0.0001477055,0.00058792176,0.0004328887,0.014828092],"genre_scores_gemma":[0.9473296,0.000699105,0.024505565,0.00033583664,0.00018403995,0.00017863214,0.00026430903,0.00011275496,0.026390197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853444,0.00048115625,0.000049388385,0.00028115665,0.0002646931,0.0003890696],"domain_scores_gemma":[0.99723166,0.0013271867,0.00030526982,0.00011912305,0.0005647121,0.00045211552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021321715,0.0011665823,0.0028109003,0.0017161287,0.0016370892,0.004308796,0.004035409,0.0040753577,0.005880701],"category_scores_gemma":[0.006812879,0.0013456239,0.0011801173,0.0022859646,0.002954965,0.003444426,0.0030481117,0.0023009004,0.0007987798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011765143,0.00007387188,0.00051117636,0.000056127417,0.00003849338,0.00025259785,0.000137802,0.8558623,0.0011877427,0.13754399,0.0015886215,0.0026296247],"study_design_scores_gemma":[0.000010686562,0.000009505849,0.000045920908,0.0000035090534,0.000007301989,0.000014610616,0.000014012219,0.9903672,0.000032523043,0.009312559,0.00017228628,0.000009866268],"about_ca_topic_score_codex":0.0207994,"about_ca_topic_score_gemma":0.009013108,"teacher_disagreement_score":0.0207994,"about_ca_system_score_codex":0.004195658,"about_ca_system_score_gemma":0.0029491647,"threshold_uncertainty_score":0.041356683},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10559558,0.002509676,0.8514654,0.0027656755,0.00074814877,0.00021190432,0.00067071995,0.00072078634,0.035312194],"genre_scores_gemma":[0.8590562,0.0018684538,0.039711915,0.00038424143,0.00044026703,0.00035185873,0.0003984309,0.00022423679,0.097564444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989519,0.0002669774,0.000044144697,0.00017925091,0.00033908576,0.00021866961],"domain_scores_gemma":[0.99662066,0.002032649,0.00019940517,0.00017688572,0.00068571593,0.0002846992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020881025,0.001449025,0.0018392246,0.0014106238,0.001426404,0.0044008233,0.0024842564,0.0025551878,0.009849777],"category_scores_gemma":[0.0052745193,0.0008094361,0.001692168,0.0013150157,0.0022051875,0.0032236362,0.002006795,0.0023514132,0.0009213028],"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.00014287852,0.00009271181,0.00063258066,0.00006206522,0.000057097714,0.00013837514,0.00011577399,0.7906276,0.0012499186,0.19677709,0.0024701925,0.0076337024],"study_design_scores_gemma":[0.000023344159,0.000030653,0.00011822467,0.000008213629,0.000012356121,0.000014847749,0.0000203148,0.97966766,0.00019264754,0.019047003,0.00085077126,0.000013949155],"about_ca_topic_score_codex":0.03119272,"about_ca_topic_score_gemma":0.018008396,"teacher_disagreement_score":0.03119272,"about_ca_system_score_codex":0.005104652,"about_ca_system_score_gemma":0.0029853568,"threshold_uncertainty_score":0.06202233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012193247,0.000044990607,0.9980519,0.000050603598,0.000020425472,0.000018747793,0.00000959659,0.00020926257,0.0003750864],"genre_scores_gemma":[0.12507345,0.0001795161,0.8718533,0.00011454972,0.00007685958,0.00024628654,0.00011041719,0.00021145388,0.0021342097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986504,0.00042929358,0.00008489161,0.00023298121,0.00050264806,0.000099883306],"domain_scores_gemma":[0.9964567,0.0019899304,0.00021003767,0.000265869,0.0009772108,0.00010027214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024293533,0.00078578724,0.0008490147,0.0009660439,0.0008868234,0.0016654712,0.0017451723,0.0012593666,0.0028389585],"category_scores_gemma":[0.010621568,0.00051069027,0.0008455857,0.0008793887,0.0009715529,0.0019976974,0.001952703,0.0022901436,0.0010860163],"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.00018514985,0.00009779988,0.00093539467,0.00012890995,0.00007977901,0.000117803895,0.00027863088,0.4705872,0.012405723,0.18654682,0.004404299,0.32423255],"study_design_scores_gemma":[0.000013354867,0.00002089789,0.000034657238,0.0000065622808,0.0000039107513,0.000024001034,0.0000059631952,0.97708046,0.0010125248,0.020849582,0.0009398165,0.00000819837],"about_ca_topic_score_codex":0.0020107487,"about_ca_topic_score_gemma":0.0014035953,"teacher_disagreement_score":0.0028389585,"about_ca_system_score_codex":0.0011470425,"about_ca_system_score_gemma":0.0028116754,"threshold_uncertainty_score":0.012847781},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28722602,0.00065556803,0.6858832,0.0024039305,0.00013996084,0.00009042026,0.00009444988,0.0001111659,0.023395361],"genre_scores_gemma":[0.97926426,0.00018595027,0.01701869,0.00010825859,0.000049192426,0.000052868054,0.000016586215,0.000018990979,0.003285194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803096,0.001031051,0.000048018384,0.00018927235,0.00035839772,0.0003422357],"domain_scores_gemma":[0.9966407,0.002112845,0.00052344427,0.00017577906,0.00028494885,0.0002623245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028299314,0.000573671,0.00062946964,0.00052792404,0.0012340213,0.0020155474,0.0011329023,0.0010942598,0.0023023984],"category_scores_gemma":[0.005494918,0.00041571702,0.0005773767,0.00053405005,0.0018415808,0.002923896,0.0014113386,0.0010376341,0.00016154519],"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.00007002354,0.00009484455,0.00092784135,0.000051711166,0.00004960703,0.00020760155,0.00021039271,0.3970912,0.0011175841,0.59305817,0.00091887004,0.006202181],"study_design_scores_gemma":[0.000023683926,0.000039132592,0.00038648074,0.000008154778,0.000014038473,0.0000402911,0.00016331082,0.7795714,0.00026202056,0.21844892,0.0010258129,0.000016653063],"about_ca_topic_score_codex":0.0045219427,"about_ca_topic_score_gemma":0.004321726,"teacher_disagreement_score":0.0045219427,"about_ca_system_score_codex":0.002590298,"about_ca_system_score_gemma":0.0016744001,"threshold_uncertainty_score":0.018794},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043792,0.0015474004,0.94896287,0.00074781454,0.00007686385,0.00007052219,0.00021841728,0.00026744968,0.004316603],"genre_scores_gemma":[0.93054146,0.003019519,0.058894135,0.00029936145,0.00025303612,0.00022044519,0.00040661666,0.00026038583,0.0061051273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988341,0.00042994416,0.000049607777,0.00020937984,0.0002636767,0.00021339326],"domain_scores_gemma":[0.99305254,0.004572035,0.0008244609,0.00032521025,0.0009562691,0.0002694571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034255711,0.0011873133,0.0011161036,0.0015221983,0.00070399826,0.0015372518,0.0015143688,0.0010424595,0.003585699],"category_scores_gemma":[0.015739119,0.0006806913,0.0014408942,0.0014845972,0.001134766,0.0021541314,0.0013941481,0.0020393129,0.00045099345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058893715,0.00007341067,0.005273457,0.00017684625,0.00017067745,0.0007332266,0.00040337347,0.59008527,0.0025263783,0.38042888,0.003606697,0.016462838],"study_design_scores_gemma":[0.0000026544433,0.00000967261,0.00053658703,0.000011899397,0.000014694073,0.000065351196,0.000030651376,0.9753557,0.00013426726,0.023308972,0.00051838346,0.0000110713145],"about_ca_topic_score_codex":0.008689965,"about_ca_topic_score_gemma":0.004063712,"teacher_disagreement_score":0.008689965,"about_ca_system_score_codex":0.0016021965,"about_ca_system_score_gemma":0.0017002368,"threshold_uncertainty_score":0.018116355},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055564396,0.00052512117,0.93082905,0.0003798216,0.00013073345,0.00012112912,0.0001948967,0.00037978776,0.0118750315],"genre_scores_gemma":[0.83967656,0.0009870325,0.1390707,0.0003887604,0.00037789458,0.00023322408,0.00025850636,0.00007838118,0.018928908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970228,0.00057748164,0.00025783127,0.0005864968,0.0010125183,0.0005429185],"domain_scores_gemma":[0.9946196,0.0018980309,0.00093097804,0.00069284777,0.0014840018,0.00037455943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025502415,0.0009569023,0.0010113264,0.001178361,0.0011090682,0.0036574253,0.0029583191,0.0012735904,0.00476694],"category_scores_gemma":[0.012240917,0.0005494873,0.00096095103,0.0016102584,0.0017334396,0.0048685144,0.0025672256,0.002147078,0.0009670381],"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.00023063841,0.00012125113,0.001479466,0.00016165993,0.000042408657,0.00042752508,0.00039836892,0.1599046,0.005621842,0.8006275,0.0012145953,0.029770173],"study_design_scores_gemma":[0.000051391886,0.00009150792,0.00037371123,0.000015844305,0.000036976387,0.00020356536,0.000056323683,0.8094014,0.0018129244,0.18399292,0.003917965,0.00004555953],"about_ca_topic_score_codex":0.0046172054,"about_ca_topic_score_gemma":0.0023139932,"teacher_disagreement_score":0.00476694,"about_ca_system_score_codex":0.0028383809,"about_ca_system_score_gemma":0.002210731,"threshold_uncertainty_score":0.02059406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6277056,0.0012692431,0.35673755,0.0015971379,0.00030304797,0.00005659889,0.0000670299,0.00044940182,0.011814447],"genre_scores_gemma":[0.99286896,0.00014006608,0.006366643,0.00008102438,0.0000673427,0.000009764261,0.000012792794,0.000020118729,0.00043331087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972779,0.00112051,0.000115513816,0.00033667206,0.0005764443,0.00057294656],"domain_scores_gemma":[0.9810244,0.012927107,0.0012421804,0.0018175754,0.0013597881,0.0016289362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004346468,0.00051998766,0.0012152363,0.00060748245,0.0015104193,0.003245687,0.0019657866,0.0014207055,0.0026391088],"category_scores_gemma":[0.02310245,0.00062635355,0.00060664496,0.000742643,0.0015207423,0.004392645,0.0017487304,0.0021191896,0.0004054271],"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.00291767,0.0007696246,0.007830514,0.00029782022,0.00016047881,0.0005348774,0.0010143658,0.33640623,0.024146607,0.54447776,0.0028714677,0.0785726],"study_design_scores_gemma":[0.000099651596,0.00038409463,0.0011854705,0.000017731752,0.000058813064,0.00024338359,0.00017299957,0.8791181,0.0019294493,0.11620332,0.00053386047,0.000053070686],"about_ca_topic_score_codex":0.0011749582,"about_ca_topic_score_gemma":0.0009982664,"teacher_disagreement_score":0.004346468,"about_ca_system_score_codex":0.0012964815,"about_ca_system_score_gemma":0.0018607954,"threshold_uncertainty_score":0.02298665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5824428,0.00034121372,0.41014934,0.0010813109,0.00009553221,0.00013529367,0.0008299737,0.0005229551,0.00440161],"genre_scores_gemma":[0.97386307,0.0003039651,0.022077983,0.00008601821,0.000083839645,0.00012677678,0.0004955887,0.000052212996,0.0029106382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986498,0.0005481202,0.000062417595,0.0002448154,0.0002573031,0.00023763422],"domain_scores_gemma":[0.99449277,0.0032721877,0.001027361,0.00032030288,0.0006195375,0.00026781458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022803436,0.00082784094,0.00077947864,0.0009771911,0.0006158063,0.0019282785,0.002277791,0.0023293542,0.002244641],"category_scores_gemma":[0.011369511,0.00075892097,0.00069300085,0.0016004628,0.00074412004,0.0020179246,0.0008892844,0.0019834954,0.0004898132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044978708,0.00006577946,0.004159287,0.000018328556,0.000027012651,0.000067344445,0.00016116898,0.9768983,0.0005263117,0.01408238,0.0005160433,0.0034330504],"study_design_scores_gemma":[0.000006185771,0.00001432192,0.0005033918,0.0000019953227,0.0000041250237,0.00001088934,0.000022432765,0.99693644,0.00006299446,0.0022378643,0.0001918768,0.0000075603552],"about_ca_topic_score_codex":0.023649525,"about_ca_topic_score_gemma":0.016130306,"teacher_disagreement_score":0.023649525,"about_ca_system_score_codex":0.0020506636,"about_ca_system_score_gemma":0.0013725446,"threshold_uncertainty_score":0.047023714},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022029325,0.0048556137,0.11592359,0.49207988,0.02778478,0.00023597923,0.0021375665,0.00075064803,0.3342026],"genre_scores_gemma":[0.523103,0.010937966,0.037066128,0.1039302,0.029332522,0.0004655321,0.0011772385,0.0007353529,0.293252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889696,0.00037532416,0.00006176532,0.00021284386,0.000314275,0.00013881142],"domain_scores_gemma":[0.9948974,0.0031496652,0.00017375292,0.00025233498,0.001294645,0.00023212183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019299733,0.0006512505,0.00044107882,0.0009944215,0.0025808134,0.0020558154,0.001943135,0.004684203,0.045051124],"category_scores_gemma":[0.014726013,0.00030761343,0.0007867988,0.0011618314,0.0019716423,0.0068776617,0.0011456629,0.0039890865,0.006804318],"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.000115622766,0.000020236237,0.00029681769,0.00009758323,0.00000959821,0.0006794895,0.00028828223,0.008695936,0.0003217286,0.7763591,0.2032195,0.009896104],"study_design_scores_gemma":[0.000043832577,0.000043380704,0.00054044643,0.00014112862,0.000012469598,0.00043324786,0.0003403757,0.022041112,0.00029583677,0.6186705,0.35737434,0.00006329885],"about_ca_topic_score_codex":0.01402479,"about_ca_topic_score_gemma":0.0045234472,"teacher_disagreement_score":0.045051124,"about_ca_system_score_codex":0.0034950236,"about_ca_system_score_gemma":0.0010170727,"threshold_uncertainty_score":0.15071106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21187949,0.0010172597,0.76008135,0.0048630214,0.00073727756,0.00037862032,0.0011954135,0.0012090711,0.01863851],"genre_scores_gemma":[0.91314703,0.00052509253,0.064966656,0.0007173181,0.00034663195,0.00013759221,0.00026789907,0.00013174243,0.019760042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997897,0.00038845916,0.00011707857,0.0004325907,0.00052054325,0.0006443247],"domain_scores_gemma":[0.9945866,0.002227871,0.0005815322,0.00043340365,0.0012373915,0.0009332771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031969657,0.0010415105,0.0015276937,0.0014416539,0.0027805232,0.004622216,0.0036409358,0.0024770363,0.0059311143],"category_scores_gemma":[0.01207119,0.0008542056,0.0007873639,0.001873421,0.0019193123,0.0042020804,0.0027094588,0.002371409,0.0009732994],"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.002052778,0.00040565635,0.0038385866,0.00047650424,0.00013302318,0.0012213553,0.000548623,0.31189814,0.014763307,0.6289458,0.013386865,0.022329284],"study_design_scores_gemma":[0.00015906058,0.0001180606,0.00028097516,0.000017308768,0.00004018059,0.00012156547,0.0000634065,0.9530963,0.0012750875,0.043698326,0.0010847679,0.000044979613],"about_ca_topic_score_codex":0.014672579,"about_ca_topic_score_gemma":0.008928435,"teacher_disagreement_score":0.014672579,"about_ca_system_score_codex":0.0060924203,"about_ca_system_score_gemma":0.0046938476,"threshold_uncertainty_score":0.04420376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12530519,0.0006754578,0.86778545,0.0019044105,0.00015368863,0.000068153204,0.00009805146,0.0003446274,0.003664922],"genre_scores_gemma":[0.9663187,0.00041836925,0.029787248,0.00026085303,0.00019726249,0.00012375691,0.00009341812,0.00008171279,0.0027186617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644417,0.0017327544,0.00015168388,0.0005502417,0.0006955919,0.00042554957],"domain_scores_gemma":[0.97541124,0.01880918,0.002492338,0.0007740514,0.001547088,0.0009661516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006881913,0.0012831112,0.0015935312,0.00085724413,0.00070417207,0.0026716704,0.0018999198,0.0019164124,0.0012051873],"category_scores_gemma":[0.032273933,0.0008644612,0.0005816593,0.0010763217,0.0025454767,0.0027286976,0.0019196532,0.002184092,0.00017296858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108022025,0.000033746455,0.00039817137,0.00002306982,0.000025064584,0.000024661855,0.000038054168,0.9508996,0.00050136336,0.04418659,0.00037431,0.0033873415],"study_design_scores_gemma":[0.000022627455,0.000015696181,0.000062005645,0.000002408874,0.0000038047776,0.0000032133933,0.000005670464,0.981795,0.000117147625,0.017910406,0.000057530444,0.0000043751265],"about_ca_topic_score_codex":0.00395679,"about_ca_topic_score_gemma":0.0019990697,"teacher_disagreement_score":0.006881913,"about_ca_system_score_codex":0.0029985057,"about_ca_system_score_gemma":0.002534986,"threshold_uncertainty_score":0.03639543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73531145,0.00023954496,0.2593426,0.0014281289,0.000059052036,0.00012844682,0.00014638118,0.000079301724,0.0032650908],"genre_scores_gemma":[0.99108875,0.000067086374,0.008061794,0.000054262495,0.000023110413,0.000025142785,0.000027028165,0.00000942395,0.0006433218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9903149,0.004823487,0.00038723904,0.0010760318,0.0019712583,0.0014271042],"domain_scores_gemma":[0.93167347,0.04831311,0.009996197,0.006282884,0.0024363487,0.0012979902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010856444,0.000680106,0.0011089045,0.0010490018,0.001092306,0.0028145744,0.0020798845,0.0015322019,0.0016080339],"category_scores_gemma":[0.051443532,0.0005319993,0.00095468253,0.0015808202,0.0034572757,0.006283548,0.0033519573,0.0024092807,0.000095627875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008516683,0.00050422834,0.024433529,0.00014666327,0.0003811549,0.0006756719,0.0012522936,0.774743,0.003784007,0.16059446,0.001140776,0.03149258],"study_design_scores_gemma":[0.000073823205,0.00026545816,0.0035061424,0.000016691978,0.0000773645,0.00012385128,0.0003283631,0.9217612,0.0013903682,0.0719432,0.0004608625,0.00005257453],"about_ca_topic_score_codex":0.0044365483,"about_ca_topic_score_gemma":0.0023357447,"teacher_disagreement_score":0.010856444,"about_ca_system_score_codex":0.002708301,"about_ca_system_score_gemma":0.0022750197,"threshold_uncertainty_score":0.05741507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8109748,0.00023326561,0.1705167,0.0041656713,0.00018719393,0.00013235433,0.00019578413,0.00015509734,0.013439181],"genre_scores_gemma":[0.98854876,0.00008936977,0.004092739,0.00016986758,0.00004561968,0.000042666215,0.000036108308,0.000021459058,0.0069535305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747366,0.0010903369,0.000077524935,0.00031437058,0.00020393568,0.00084018],"domain_scores_gemma":[0.9853908,0.009368565,0.0013458285,0.00045686724,0.0008209548,0.0026169932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005128546,0.00087689277,0.0023873625,0.0011670609,0.0021587927,0.004531094,0.0028190399,0.003456993,0.009056445],"category_scores_gemma":[0.014684435,0.0010244489,0.0011796706,0.00092125236,0.0037523448,0.004326374,0.003013912,0.0033276633,0.00044345955],"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.00079407083,0.00057997537,0.004292575,0.00009381821,0.00015042118,0.0007288458,0.00073054235,0.4310653,0.002289498,0.5516036,0.002939422,0.004731933],"study_design_scores_gemma":[0.00013102707,0.00014895888,0.00078661245,0.000015045935,0.000040379025,0.000039269155,0.00031336286,0.89713645,0.00015783703,0.10092024,0.00026341257,0.000047358928],"about_ca_topic_score_codex":0.015231232,"about_ca_topic_score_gemma":0.012326606,"teacher_disagreement_score":0.015231232,"about_ca_system_score_codex":0.0046487777,"about_ca_system_score_gemma":0.004552575,"threshold_uncertainty_score":0.033729374},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012773331,0.0024838082,0.97329843,0.0010521966,0.00017937069,0.00007143588,0.0001778496,0.00030024158,0.009663312],"genre_scores_gemma":[0.40413514,0.007846603,0.56555843,0.0006284899,0.0010898309,0.00048441917,0.0010278104,0.00037510737,0.018854098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988808,0.0003363297,0.000072247,0.00021504785,0.0004003196,0.00009526214],"domain_scores_gemma":[0.99707854,0.0018186967,0.00020966984,0.00040733337,0.00034711164,0.0001387039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001400735,0.0007127699,0.0009071274,0.0015687131,0.0009707277,0.0013566848,0.0010819992,0.000956683,0.006535589],"category_scores_gemma":[0.005363507,0.00037881357,0.0020770847,0.0017264911,0.0014303419,0.0020549793,0.0018331208,0.0022589066,0.001228157],"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.000031202817,0.000091970316,0.00079261255,0.00018503332,0.000037837235,0.00015706898,0.00023223608,0.124917276,0.00138118,0.81533283,0.0031208296,0.05371998],"study_design_scores_gemma":[0.000011061754,0.000021275411,0.00021835338,0.0000397474,0.000008310478,0.00011173659,0.000039461407,0.54682875,0.0005138712,0.4448748,0.007308463,0.000024191042],"about_ca_topic_score_codex":0.003116291,"about_ca_topic_score_gemma":0.0021770399,"teacher_disagreement_score":0.006535589,"about_ca_system_score_codex":0.0014571901,"about_ca_system_score_gemma":0.001287539,"threshold_uncertainty_score":0.021863699},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30246526,0.0016444292,0.64331996,0.004909434,0.0007646417,0.00037504532,0.0020578804,0.0010159829,0.043447323],"genre_scores_gemma":[0.954384,0.0007017137,0.025660861,0.00037241782,0.0002873926,0.00022822626,0.00027669815,0.00009254281,0.017996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988323,0.00025789798,0.00006120726,0.00020962121,0.00030694128,0.00033208338],"domain_scores_gemma":[0.9986455,0.00036371354,0.00034291574,0.00017117333,0.00028735225,0.00018944415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011858394,0.001217517,0.0013106233,0.0010806811,0.001131461,0.0019660261,0.0030314026,0.0025550043,0.005336274],"category_scores_gemma":[0.0032134312,0.0005354903,0.0009365304,0.0011016787,0.0016569353,0.0023632182,0.0021808,0.002496781,0.0012265537],"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.0003524782,0.00022449804,0.0024717923,0.00022505602,0.00006377128,0.001871796,0.00034664158,0.4511131,0.008838611,0.5186825,0.0062270686,0.00958269],"study_design_scores_gemma":[0.00004098458,0.00006791968,0.0003489149,0.000016274751,0.0000287094,0.00015915655,0.000054670636,0.9548316,0.0007834931,0.042201813,0.0014325989,0.000033906264],"about_ca_topic_score_codex":0.010331043,"about_ca_topic_score_gemma":0.0049650595,"teacher_disagreement_score":0.010331043,"about_ca_system_score_codex":0.0018512629,"about_ca_system_score_gemma":0.0014060717,"threshold_uncertainty_score":0.020541787},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11756233,0.71060234,0.031277373,0.05114669,0.004119626,0.00043346104,0.002273206,0.00022750397,0.08235741],"genre_scores_gemma":[0.28959897,0.6313659,0.017287185,0.006885614,0.0019722478,0.0005068952,0.0024955776,0.00017977979,0.04970776],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.995233,0.0018127856,0.0005262294,0.00061116164,0.0012324372,0.0005844378],"domain_scores_gemma":[0.9857654,0.009364559,0.0015867578,0.00077126833,0.0019754453,0.0005364879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077449353,0.0006837659,0.0010162082,0.0030307628,0.0019380022,0.007865837,0.0009992127,0.0016570694,0.011429594],"category_scores_gemma":[0.013558284,0.0005231196,0.0011208886,0.0047147563,0.0018105084,0.0048927693,0.0026788688,0.0026242237,0.0021861764],"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.00022258739,0.00060188246,0.028787594,0.006633452,0.000219391,0.0010953116,0.005388352,0.0043372377,0.0017454665,0.112610996,0.051708803,0.786649],"study_design_scores_gemma":[0.000025530499,0.00056772487,0.060747694,0.011381596,0.0003024828,0.0032923394,0.012752461,0.0033352568,0.0047657373,0.062425148,0.8401962,0.00020784819],"about_ca_topic_score_codex":0.01173075,"about_ca_topic_score_gemma":0.012203452,"teacher_disagreement_score":0.01173075,"about_ca_system_score_codex":0.005551049,"about_ca_system_score_gemma":0.008944001,"threshold_uncertainty_score":0.040959656},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19236153,0.00040035098,0.7957464,0.00043271462,0.000052008043,0.00020703801,0.0007186634,0.0004867016,0.0095946565],"genre_scores_gemma":[0.86191565,0.00027936767,0.13378811,0.00003439132,0.000017316492,0.0001818567,0.00026409572,0.00007824946,0.0034408907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993224,0.00021606738,0.00003064303,0.00019039877,0.000090271344,0.00015024238],"domain_scores_gemma":[0.99859756,0.0009064229,0.0002101213,0.00006970648,0.0001003513,0.00011589523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010578628,0.00088549097,0.0008946092,0.0008281707,0.00049374125,0.0015115464,0.0013790558,0.001071594,0.003823844],"category_scores_gemma":[0.0042118565,0.0008724694,0.00041109129,0.0010426621,0.0009496083,0.0015762773,0.0007453255,0.0007851776,0.00048276456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014624979,0.000047075693,0.0009347279,0.00006104278,0.000010554094,0.000072940216,0.000078321595,0.9693359,0.0030143117,0.0113947205,0.00071908074,0.014185051],"study_design_scores_gemma":[0.000033492015,0.000088569344,0.00072315196,0.000014819729,0.000015006952,0.00003217669,0.00009525759,0.9824645,0.0027809131,0.012701641,0.0010305657,0.000019866577],"about_ca_topic_score_codex":0.005796824,"about_ca_topic_score_gemma":0.006548919,"teacher_disagreement_score":0.005796824,"about_ca_system_score_codex":0.001450213,"about_ca_system_score_gemma":0.002149888,"threshold_uncertainty_score":0.012792051},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002688244,0.0009836424,0.98141944,0.00054174755,0.0001769102,0.00016751677,0.00008065423,0.0005605122,0.013381337],"genre_scores_gemma":[0.2419639,0.0039001415,0.7165627,0.00044313804,0.0002620372,0.0011953505,0.00034129975,0.00066337595,0.034668073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987691,0.00043657352,0.000070490976,0.00015062663,0.000425857,0.00014726061],"domain_scores_gemma":[0.9989502,0.0006362257,0.000054888595,0.00014114725,0.00014460391,0.00007303193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024096258,0.0009836049,0.00072520855,0.00082475913,0.0013831491,0.0026587206,0.002046275,0.001354697,0.018417817],"category_scores_gemma":[0.0058871773,0.0010417898,0.0010180465,0.0014465462,0.0013173129,0.004046901,0.0025867918,0.0028027336,0.0028472685],"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.000055164895,0.00006039238,0.00038619083,0.00030944037,0.000048956703,0.0001443924,0.00042583616,0.18077597,0.0029555883,0.7065476,0.010228946,0.09806151],"study_design_scores_gemma":[0.00003498751,0.00006041461,0.00013138329,0.00017540147,0.00004427592,0.000069063,0.00016342012,0.6185528,0.0019204696,0.32085216,0.05796668,0.000028892555],"about_ca_topic_score_codex":0.0047306274,"about_ca_topic_score_gemma":0.007215439,"teacher_disagreement_score":0.018417817,"about_ca_system_score_codex":0.0029741856,"about_ca_system_score_gemma":0.0027248673,"threshold_uncertainty_score":0.06161368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6208116,0.0011793561,0.34795284,0.0043873196,0.0006992933,0.00014704594,0.0007134635,0.00070529303,0.023403715],"genre_scores_gemma":[0.981501,0.00025895378,0.01039259,0.0002047372,0.00020956981,0.000028002556,0.00012461146,0.000042452422,0.007238072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994336,0.0000942284,0.000018850282,0.000112023066,0.00016229073,0.0001790588],"domain_scores_gemma":[0.9982103,0.00068920816,0.0003068719,0.0002037312,0.00030927898,0.00028063607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013227491,0.0005721056,0.00088769034,0.0009589636,0.0015149949,0.0022680839,0.0017201868,0.0016750236,0.0033091325],"category_scores_gemma":[0.006665865,0.0004031186,0.00062452536,0.00095528446,0.0016266032,0.002368916,0.0016079037,0.0018269201,0.00038083797],"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.00055718166,0.00014922385,0.0043527866,0.00012607283,0.0000480852,0.00081942003,0.00034662097,0.20719361,0.008239553,0.75831187,0.00673048,0.013125057],"study_design_scores_gemma":[0.000043522927,0.00005628789,0.0009802034,0.000011833053,0.000025487028,0.00012658411,0.00005381118,0.90615857,0.0012526567,0.09057152,0.00067865994,0.00004090535],"about_ca_topic_score_codex":0.01061103,"about_ca_topic_score_gemma":0.0061999112,"teacher_disagreement_score":0.01061103,"about_ca_system_score_codex":0.002655488,"about_ca_system_score_gemma":0.0026589863,"threshold_uncertainty_score":0.021098554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19372311,0.0016328463,0.7851987,0.0010117503,0.00019424307,0.0001034059,0.00023491513,0.00080484303,0.01709618],"genre_scores_gemma":[0.968609,0.0007252625,0.019818712,0.0001370476,0.00013710158,0.00007336322,0.00009061342,0.00014258023,0.010266404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989574,0.00037736326,0.000030097,0.0001993051,0.00016687844,0.0002689248],"domain_scores_gemma":[0.9970017,0.0022159014,0.00022708437,0.00010109776,0.00024992842,0.0002042342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014437772,0.0015126739,0.0017014699,0.00073547644,0.0008698029,0.0028728202,0.0031636234,0.0018779151,0.004405926],"category_scores_gemma":[0.0053205667,0.0010605116,0.0005541526,0.002104271,0.0016012714,0.0025481065,0.0015292044,0.0013639189,0.0006126226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027907314,0.00008414072,0.00026435347,0.000116347415,0.000029771827,0.00016909135,0.00007789311,0.959391,0.003568889,0.02176079,0.0019730604,0.012285562],"study_design_scores_gemma":[0.000015569814,0.00004517929,0.00006570501,0.000009533597,0.000011062711,0.000026515474,0.000021854883,0.9878565,0.0004228153,0.011327147,0.00018824311,0.000009779758],"about_ca_topic_score_codex":0.004380059,"about_ca_topic_score_gemma":0.0026793364,"teacher_disagreement_score":0.004405926,"about_ca_system_score_codex":0.0029591604,"about_ca_system_score_gemma":0.0011093995,"threshold_uncertainty_score":0.021470308},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3365806,0.0035463746,0.60474056,0.009007239,0.0012466714,0.00033939737,0.0014555771,0.0011242316,0.041959334],"genre_scores_gemma":[0.95847654,0.0010412803,0.010058819,0.00059251767,0.00041407856,0.00012890379,0.00031946073,0.00017657362,0.028791707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973295,0.00076119916,0.000072027964,0.00047384252,0.00029650496,0.001066928],"domain_scores_gemma":[0.9931377,0.0044811396,0.00071614754,0.00030555335,0.0006499669,0.0007095214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035696677,0.002090532,0.0045151305,0.0016515463,0.0023974127,0.005129717,0.005217556,0.005672699,0.011217983],"category_scores_gemma":[0.008719142,0.0017235359,0.0025554239,0.0023481145,0.003413121,0.0052725486,0.002758551,0.004848802,0.0011761065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003579161,0.00016578884,0.00083312206,0.00010406302,0.00007011109,0.0004414179,0.00019359605,0.87677264,0.0008156515,0.111698255,0.0043645273,0.0041829073],"study_design_scores_gemma":[0.00003766511,0.000022050279,0.000121803816,0.000008234136,0.00002513902,0.000030050043,0.0000320342,0.98512936,0.000048281483,0.014246558,0.00027651878,0.000022288297],"about_ca_topic_score_codex":0.04394499,"about_ca_topic_score_gemma":0.022670463,"teacher_disagreement_score":0.04394499,"about_ca_system_score_codex":0.0060424255,"about_ca_system_score_gemma":0.0034318797,"threshold_uncertainty_score":0.08737838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54534155,0.0015324783,0.34877998,0.004384935,0.00027940646,0.0003152739,0.0026794665,0.0007067784,0.09598013],"genre_scores_gemma":[0.9516933,0.0005883446,0.010440598,0.00022640993,0.00007796348,0.00012821303,0.00037825876,0.000027875694,0.03643908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996599,0.000080408754,0.000015796231,0.0000750648,0.00007501506,0.00009377938],"domain_scores_gemma":[0.9994735,0.00016889605,0.000095638185,0.000035259167,0.00007946261,0.00014722205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000567861,0.00048809274,0.0009830929,0.0006805819,0.0008653302,0.0026072927,0.0022550796,0.0023735836,0.010103736],"category_scores_gemma":[0.0016562894,0.00052873406,0.0007903734,0.0011189561,0.0010743478,0.0020606588,0.0011391247,0.0010502047,0.0010005353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022631352,0.00015948054,0.0031624497,0.00010506324,0.0001252226,0.0015151409,0.0003006657,0.7162992,0.0016535457,0.26621634,0.0037737077,0.006463026],"study_design_scores_gemma":[0.00009567477,0.0000996771,0.0009662077,0.000016842421,0.00003952777,0.00016332915,0.0001455306,0.9372912,0.00012824232,0.057676516,0.003338168,0.00003904245],"about_ca_topic_score_codex":0.016923653,"about_ca_topic_score_gemma":0.010693687,"teacher_disagreement_score":0.016923653,"about_ca_system_score_codex":0.0010816761,"about_ca_system_score_gemma":0.0012878034,"threshold_uncertainty_score":0.033800364},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39662597,0.00082783523,0.59306383,0.0007560048,0.00013273493,0.0001532578,0.00013077955,0.00039207624,0.007917553],"genre_scores_gemma":[0.9594402,0.00030108506,0.036254272,0.00009639239,0.000056178385,0.000070578426,0.000053280008,0.00006705959,0.0036609615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810153,0.000793202,0.00006011482,0.0002517832,0.000256433,0.0005369905],"domain_scores_gemma":[0.99622947,0.001944602,0.00070462644,0.0003037373,0.00035099458,0.00046660655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024617093,0.0009200716,0.0011844091,0.0005132432,0.0011714804,0.0018760514,0.0016840743,0.0010782233,0.002148019],"category_scores_gemma":[0.0064529986,0.00066705473,0.0008316202,0.00063697115,0.0016836294,0.002549879,0.0014846206,0.0011282128,0.000396101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014935213,0.000051945168,0.0005811955,0.000035951904,0.000040652412,0.0002106042,0.0000785676,0.9721404,0.0029826248,0.02033699,0.00041196425,0.0029796408],"study_design_scores_gemma":[0.000013103342,0.000027099948,0.000121888086,0.0000021126634,0.000008934136,0.000026313732,0.000031845204,0.9936935,0.00033182235,0.005568418,0.0001668541,0.000008026123],"about_ca_topic_score_codex":0.006526409,"about_ca_topic_score_gemma":0.003210454,"teacher_disagreement_score":0.006526409,"about_ca_system_score_codex":0.0019996834,"about_ca_system_score_gemma":0.0012394188,"threshold_uncertainty_score":0.014508724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016673915,0.0003128074,0.968914,0.00079450203,0.00020229672,0.00014588851,0.00019159573,0.000348415,0.012416617],"genre_scores_gemma":[0.38365546,0.00095650804,0.5860502,0.0006247762,0.00042453085,0.0003452249,0.0005065545,0.00022934483,0.027207376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993394,0.00014140464,0.000028918948,0.00007546531,0.00023462501,0.00018015092],"domain_scores_gemma":[0.9988883,0.0006014669,0.000108244785,0.000077602235,0.00023587208,0.00008844756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009608416,0.00093069155,0.000976208,0.0007499562,0.0011200871,0.0015526103,0.0013216415,0.0014606112,0.008150676],"category_scores_gemma":[0.0040082023,0.00044513718,0.0008324387,0.0009971234,0.00075307896,0.0010838629,0.0015691575,0.001972118,0.0013445491],"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.00011087705,0.00024008009,0.0014758455,0.00018399821,0.000051937797,0.00054602535,0.00020931412,0.75440747,0.005156872,0.1522846,0.016512735,0.06882025],"study_design_scores_gemma":[0.00002420161,0.000015144794,0.0002058699,0.00000810507,0.0000069068114,0.00005987112,0.000040583713,0.97002935,0.00040848518,0.027410546,0.0017813268,0.000009721782],"about_ca_topic_score_codex":0.00792601,"about_ca_topic_score_gemma":0.017646074,"teacher_disagreement_score":0.008150676,"about_ca_system_score_codex":0.0014590014,"about_ca_system_score_gemma":0.005899119,"threshold_uncertainty_score":0.027266681},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077843085,0.0011682181,0.8973713,0.0013772465,0.00030266208,0.00012826963,0.00016895204,0.0005903409,0.021049866],"genre_scores_gemma":[0.9289255,0.001286844,0.051804036,0.00042082212,0.0003005235,0.00024899238,0.00018893846,0.00023132628,0.016593028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986737,0.00044353178,0.000055950983,0.00016456362,0.00035080165,0.00031145292],"domain_scores_gemma":[0.9936068,0.004500202,0.0005353365,0.00025566804,0.000749029,0.00035282844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022945516,0.001382908,0.0017054538,0.0013649656,0.0011543345,0.0029337157,0.0022613616,0.0014870522,0.0042413194],"category_scores_gemma":[0.013181747,0.001006389,0.0007930396,0.0011608978,0.0028139788,0.0023377435,0.0024288185,0.0023830724,0.00043535285],"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.00023501863,0.00012989041,0.00032318188,0.00017661927,0.000065850305,0.0000904646,0.0002075144,0.62158525,0.0034460034,0.3574689,0.00369948,0.012571842],"study_design_scores_gemma":[0.00005064538,0.000038188653,0.00008697746,0.000016432617,0.000013873459,0.000012856771,0.000026539228,0.87445986,0.00031880365,0.12453531,0.0004243892,0.00001611186],"about_ca_topic_score_codex":0.010877627,"about_ca_topic_score_gemma":0.0074062697,"teacher_disagreement_score":0.010877627,"about_ca_system_score_codex":0.0040685995,"about_ca_system_score_gemma":0.004327812,"threshold_uncertainty_score":0.029519856},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13427208,0.00080737786,0.84595746,0.0017475589,0.00028057102,0.0003408935,0.00096479553,0.0005029481,0.015126285],"genre_scores_gemma":[0.7651362,0.00052786,0.2063266,0.00032663785,0.00019311356,0.00061137695,0.00067284115,0.0002885735,0.025916899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807787,0.00059900875,0.000083761544,0.00054993096,0.00027080052,0.00041862682],"domain_scores_gemma":[0.9952533,0.0033704399,0.00046514263,0.00021711351,0.00032266378,0.0003712591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003653667,0.0020127506,0.0029076182,0.0012191149,0.0008574124,0.0027117042,0.004655437,0.0034053558,0.010376076],"category_scores_gemma":[0.00810683,0.0014944255,0.0020387725,0.0016453053,0.0019208586,0.0023076434,0.00182491,0.0025720336,0.0008053876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001544604,0.00008815185,0.0003475341,0.00010158163,0.000043151857,0.0002020537,0.000057313497,0.9778371,0.00045202777,0.014221393,0.0010543013,0.00544092],"study_design_scores_gemma":[0.000067238965,0.00006541351,0.00011930565,0.000008474827,0.0000131910965,0.000030110496,0.00002547952,0.991504,0.00023277476,0.007467609,0.00045206773,0.00001418138],"about_ca_topic_score_codex":0.0087883165,"about_ca_topic_score_gemma":0.004954531,"teacher_disagreement_score":0.010376076,"about_ca_system_score_codex":0.0027063296,"about_ca_system_score_gemma":0.0020422428,"threshold_uncertainty_score":0.03471142},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44392344,0.004840865,0.521715,0.0036907734,0.00042233866,0.00015018218,0.00032799176,0.0015040787,0.023425365],"genre_scores_gemma":[0.99078417,0.00058057794,0.006103007,0.00014467967,0.00010920431,0.000046212637,0.00008353874,0.00007243852,0.0020761972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644655,0.001257783,0.00014119864,0.0004076525,0.0007272238,0.0010196217],"domain_scores_gemma":[0.9671474,0.025518714,0.0029638342,0.0010383978,0.0021084517,0.0012232015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007758462,0.0018866801,0.0017103441,0.0014525987,0.001147928,0.0026849716,0.0026089225,0.0022441563,0.0027285991],"category_scores_gemma":[0.034523804,0.0008874387,0.00080088153,0.0010239902,0.0033283134,0.0034279977,0.0025878476,0.0028805195,0.00044202755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046268743,0.00020644684,0.0016466278,0.00017365115,0.00008103927,0.00014250613,0.00021974162,0.9204014,0.004526996,0.06456894,0.0013875574,0.0061823055],"study_design_scores_gemma":[0.000015875341,0.00004821466,0.0002794993,0.000012781548,0.000013367434,0.000018853729,0.00003494686,0.9893197,0.00031297657,0.009846561,0.00008125465,0.000016001486],"about_ca_topic_score_codex":0.008412214,"about_ca_topic_score_gemma":0.003387962,"teacher_disagreement_score":0.008412214,"about_ca_system_score_codex":0.004389966,"about_ca_system_score_gemma":0.0028495206,"threshold_uncertainty_score":0.04103118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19656472,0.017932413,0.43498585,0.009602979,0.003276307,0.00022254454,0.00028762856,0.001349844,0.3357777],"genre_scores_gemma":[0.9544998,0.004021047,0.010273427,0.0011130618,0.0012294198,0.00012388644,0.00007141383,0.00040715004,0.028260872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994923,0.00015133791,0.000018385112,0.000075203105,0.00015148737,0.00011135528],"domain_scores_gemma":[0.99647576,0.0025246693,0.00014703462,0.00025718528,0.00037289728,0.00022247578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012607229,0.00089555123,0.0011680168,0.0011058631,0.0011438304,0.0017902983,0.0017296169,0.0013509567,0.011592563],"category_scores_gemma":[0.0079282895,0.0006739695,0.0007762445,0.00096801645,0.002694738,0.003925224,0.0027907768,0.0026850048,0.00084990624],"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.00008219097,0.000073105104,0.0003053774,0.00021099484,0.000027230895,0.00013979024,0.00034223092,0.050049484,0.003667387,0.9297291,0.0053559435,0.010017152],"study_design_scores_gemma":[0.000026687925,0.0000344976,0.00035875168,0.000046921883,0.000021948741,0.00008392504,0.00009889881,0.34908068,0.00083285477,0.644593,0.0047895066,0.000032398693],"about_ca_topic_score_codex":0.0030980308,"about_ca_topic_score_gemma":0.0011246696,"teacher_disagreement_score":0.011592563,"about_ca_system_score_codex":0.0018643794,"about_ca_system_score_gemma":0.0006973602,"threshold_uncertainty_score":0.038780987},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018494885,0.0055219242,0.947384,0.0033369705,0.0014515569,0.00005174237,0.00042394828,0.0005665491,0.022768345],"genre_scores_gemma":[0.767313,0.012902206,0.14279544,0.002149529,0.0048062797,0.00022699717,0.0008474983,0.0010515531,0.06790752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985293,0.00039992353,0.00008492578,0.00026170758,0.00056328834,0.00016090603],"domain_scores_gemma":[0.9938445,0.0042068413,0.00028536248,0.00048567422,0.0008758463,0.00030171458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036674263,0.0010995116,0.0009143972,0.00092598685,0.0007928541,0.0021691425,0.0028164724,0.00089005247,0.0062983604],"category_scores_gemma":[0.013004385,0.000677467,0.0007667036,0.0023742523,0.0019513922,0.0052710385,0.0014071274,0.0037437642,0.0015044371],"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.00029630034,0.00009637939,0.0009521326,0.0002720805,0.00004303518,0.00071872555,0.0004350148,0.089176804,0.0036330442,0.8559239,0.019252073,0.029200422],"study_design_scores_gemma":[0.000045561126,0.00013717757,0.0010198829,0.00010742411,0.0000443291,0.00030035264,0.00010117155,0.64869463,0.0021300172,0.32187814,0.02546707,0.00007418349],"about_ca_topic_score_codex":0.012080053,"about_ca_topic_score_gemma":0.0041161445,"teacher_disagreement_score":0.012080053,"about_ca_system_score_codex":0.0031537288,"about_ca_system_score_gemma":0.0022778877,"threshold_uncertainty_score":0.02401948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15875846,0.00061172707,0.8334565,0.00044434497,0.00006764524,0.00003717713,0.00012690017,0.0003706698,0.0061265854],"genre_scores_gemma":[0.9612662,0.00052388356,0.032866504,0.0001488608,0.00006499291,0.00007729125,0.00018377963,0.00009776038,0.0047708037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999406,0.00014399119,0.000026748226,0.000087494875,0.000208674,0.00012695995],"domain_scores_gemma":[0.9968899,0.0016161507,0.0004327641,0.00020288237,0.00059111236,0.00026714968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023473173,0.00064918015,0.00080457143,0.0011073201,0.00048488655,0.0013033001,0.0017651425,0.0010944934,0.003462038],"category_scores_gemma":[0.009968961,0.00034547923,0.00093693775,0.00087721203,0.0020099883,0.003129888,0.0015879151,0.0020376774,0.0005053906],"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.0001531089,0.00012668707,0.003347229,0.00014609013,0.000073043644,0.0006926709,0.0004060839,0.3597226,0.00882542,0.6118691,0.0013455753,0.013292345],"study_design_scores_gemma":[0.000011949432,0.00002704288,0.00056631555,0.000015231581,0.000011124996,0.00008699447,0.000057639503,0.9114145,0.0007051376,0.08680693,0.00027476696,0.00002240072],"about_ca_topic_score_codex":0.0037657784,"about_ca_topic_score_gemma":0.002233797,"teacher_disagreement_score":0.0037657784,"about_ca_system_score_codex":0.0016159096,"about_ca_system_score_gemma":0.0013467196,"threshold_uncertainty_score":0.012413979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50562674,0.0014590655,0.47739324,0.0010863497,0.00011077001,0.000080181744,0.00023021418,0.0005883826,0.013425054],"genre_scores_gemma":[0.991236,0.00027767886,0.0061541446,0.00008175017,0.00004206509,0.00005248162,0.000055697754,0.000045024317,0.0020551686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980562,0.00052988355,0.00006300847,0.00027706358,0.00031972592,0.0007541712],"domain_scores_gemma":[0.9905813,0.006384405,0.0011979033,0.00040152064,0.0007602538,0.0006746726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003490249,0.0013415675,0.0016603384,0.0015381521,0.0013803514,0.0022879175,0.0017382394,0.0014292628,0.0023309027],"category_scores_gemma":[0.016271818,0.00091319386,0.0010713888,0.0010966355,0.0032774985,0.0034919712,0.002240058,0.0018033416,0.00039201765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034233724,0.000109336725,0.0022445663,0.00017524524,0.00012424805,0.0007880225,0.00047630715,0.82978714,0.009488986,0.15017071,0.0012527838,0.0050403094],"study_design_scores_gemma":[0.00002579715,0.00007016513,0.00049014424,0.0000225826,0.00003323165,0.00011196103,0.000120696655,0.9451446,0.0008936632,0.052833103,0.00022804074,0.000026109627],"about_ca_topic_score_codex":0.0051628505,"about_ca_topic_score_gemma":0.00254125,"teacher_disagreement_score":0.0051628505,"about_ca_system_score_codex":0.0040861736,"about_ca_system_score_gemma":0.0022450981,"threshold_uncertainty_score":0.02964735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.593037,0.0026775606,0.3937003,0.002956007,0.00036120534,0.00012140344,0.00026270718,0.0005785265,0.006305255],"genre_scores_gemma":[0.9875058,0.00037616075,0.010467157,0.00006018916,0.000098466175,0.000019347248,0.00004460019,0.000017869696,0.0014104442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987997,0.0004229149,0.00004670884,0.0001876625,0.00023965232,0.00030342862],"domain_scores_gemma":[0.9934638,0.0038292012,0.00050854014,0.0002741009,0.0014578083,0.0004665042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005454766,0.0005317392,0.00086403877,0.0010333281,0.0010394091,0.001599437,0.001894145,0.0014597956,0.0021489605],"category_scores_gemma":[0.013126756,0.00040345732,0.000573493,0.001529921,0.0008679574,0.0021490841,0.0009172606,0.0013696738,0.00012796132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061226153,0.00046717227,0.008991942,0.0001553463,0.000059904414,0.00021364698,0.00019361092,0.8709885,0.0027340844,0.063081376,0.0045240503,0.047978107],"study_design_scores_gemma":[0.0000066262573,0.00003903746,0.0005376865,0.0000035477713,0.000012801761,0.000012673992,0.00003996823,0.99645543,0.00015210945,0.0026195839,0.00011309875,0.000007519182],"about_ca_topic_score_codex":0.033531703,"about_ca_topic_score_gemma":0.019208042,"teacher_disagreement_score":0.033531703,"about_ca_system_score_codex":0.0044303127,"about_ca_system_score_gemma":0.004232329,"threshold_uncertainty_score":0.06667304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002162597,0.0006338701,0.9909315,0.00025851824,0.00010278988,0.000020149431,0.00005180473,0.00006431678,0.005774432],"genre_scores_gemma":[0.50795245,0.005918132,0.4620289,0.00078005897,0.0012089845,0.0007340198,0.00028356744,0.00029590024,0.0207981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856794,0.0004893846,0.00006498362,0.00021674162,0.00055283424,0.00010805497],"domain_scores_gemma":[0.99790895,0.0013766563,0.00018164216,0.00022974884,0.00022808922,0.000074920456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00311702,0.0013965751,0.00093106006,0.0016067122,0.0009237679,0.0020789,0.0016672187,0.0011875038,0.0035395909],"category_scores_gemma":[0.0058893817,0.00042087625,0.0011617661,0.001584793,0.0025129558,0.004361026,0.0017317275,0.0033102634,0.0006961689],"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.000005190751,0.000009333965,0.00006440326,0.00002469685,0.0000088754905,0.00003030516,0.00004762613,0.04356305,0.000507408,0.9525578,0.00039450705,0.0027868215],"study_design_scores_gemma":[0.00000548957,0.000016830043,0.00007903606,0.000024246496,0.000013697899,0.0000381698,0.000021654514,0.44499934,0.00026594964,0.54753006,0.006990844,0.000014578223],"about_ca_topic_score_codex":0.003985214,"about_ca_topic_score_gemma":0.0023424984,"teacher_disagreement_score":0.003985214,"about_ca_system_score_codex":0.003174994,"about_ca_system_score_gemma":0.0014667497,"threshold_uncertainty_score":0.023036301},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09747865,0.00104005,0.8913106,0.0017491165,0.00017653046,0.000087033855,0.00010896801,0.00040033436,0.00764867],"genre_scores_gemma":[0.91442525,0.000790474,0.07798681,0.00047321047,0.00022978648,0.00017794291,0.00010532177,0.00014070162,0.005670438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697554,0.001551311,0.00008901427,0.00035863311,0.0005653758,0.00046014617],"domain_scores_gemma":[0.98917913,0.007600887,0.0011162079,0.0010284681,0.000631547,0.00044368638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061787814,0.0006236543,0.0010861135,0.0012056419,0.0012211138,0.0016852089,0.0017629913,0.0013224593,0.0029195843],"category_scores_gemma":[0.016484363,0.0005532417,0.000943572,0.0008893857,0.0032421441,0.0045824847,0.0021289375,0.001735888,0.00030112866],"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.00014323533,0.00006709107,0.00056434015,0.000058148147,0.000033209002,0.00006557948,0.000120943136,0.4559944,0.0016168794,0.5286035,0.0013395896,0.0113930395],"study_design_scores_gemma":[0.000023770112,0.00003914696,0.00013902182,0.000010941755,0.000008569359,0.000019681793,0.000018112602,0.8934539,0.00027813474,0.10542232,0.000570745,0.000015652071],"about_ca_topic_score_codex":0.0035920115,"about_ca_topic_score_gemma":0.0029555876,"teacher_disagreement_score":0.0061787814,"about_ca_system_score_codex":0.0037848228,"about_ca_system_score_gemma":0.0024629193,"threshold_uncertainty_score":0.032676935},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06053091,0.00035274785,0.9113284,0.001179451,0.00014519438,0.00007346944,0.00045972326,0.00011890426,0.025811259],"genre_scores_gemma":[0.9148666,0.00067743723,0.05387671,0.00047402483,0.00019189421,0.00024721943,0.0004136143,0.00009147809,0.029160889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992192,0.00019030776,0.0000462732,0.0001549944,0.0002566656,0.00013255971],"domain_scores_gemma":[0.9984421,0.00070893846,0.00031929245,0.00014263038,0.00026799543,0.00011892758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013082986,0.0005178884,0.00050134247,0.0006429823,0.00040375107,0.0013782476,0.0013114186,0.0012023058,0.0044041523],"category_scores_gemma":[0.0051042116,0.00035894325,0.0009029132,0.0005029725,0.001239011,0.0022040042,0.0020448684,0.0018062631,0.0004130605],"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.000010315345,0.000028360098,0.0005944351,0.00002182959,0.000012391489,0.00010330925,0.00017475159,0.14566047,0.001091069,0.84683144,0.00073463056,0.0047370223],"study_design_scores_gemma":[0.00001831407,0.000021325706,0.00037682065,0.0000094027,0.000009126917,0.000058259084,0.000043158394,0.63498485,0.00029928892,0.36163476,0.0025302842,0.000014387003],"about_ca_topic_score_codex":0.0072623994,"about_ca_topic_score_gemma":0.0035819393,"teacher_disagreement_score":0.0072623994,"about_ca_system_score_codex":0.0018728328,"about_ca_system_score_gemma":0.0013279167,"threshold_uncertainty_score":0.014733374},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15941423,0.00081904716,0.80917287,0.005760566,0.00087371026,0.00008146182,0.00041886812,0.00073031656,0.022728926],"genre_scores_gemma":[0.95733047,0.0017303835,0.018043285,0.0007806438,0.00037249553,0.0001027965,0.0003274742,0.00027468137,0.02103777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914074,0.00031538945,0.000036847647,0.00009565504,0.00018833054,0.00022304992],"domain_scores_gemma":[0.99213725,0.0054602316,0.000670445,0.0006116808,0.00088070106,0.00023970401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031322322,0.000904857,0.0009810667,0.0011293321,0.0004622873,0.002628128,0.0034102353,0.003955595,0.006039545],"category_scores_gemma":[0.030294994,0.0013832643,0.0012531728,0.0015847748,0.0013136087,0.00513301,0.0007646275,0.0027840093,0.0025870344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001920251,0.00014220337,0.0055371337,0.00014162899,0.00007067123,0.00041653521,0.00048290254,0.529229,0.0021343997,0.4349449,0.0060805366,0.020628123],"study_design_scores_gemma":[0.00001548716,0.0000140610155,0.00044033304,0.00001620444,0.000012520111,0.00007313988,0.000068539324,0.95219904,0.00023268028,0.04606324,0.0008473156,0.000017347049],"about_ca_topic_score_codex":0.0068561956,"about_ca_topic_score_gemma":0.002882576,"teacher_disagreement_score":0.0068561956,"about_ca_system_score_codex":0.0011445688,"about_ca_system_score_gemma":0.00075891044,"threshold_uncertainty_score":0.020204246},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3526655,0.0020182086,0.58978605,0.007571525,0.0010681859,0.0003589393,0.0028078742,0.0012358183,0.042487822],"genre_scores_gemma":[0.9608429,0.0006029381,0.018693442,0.00047620604,0.00041396747,0.00013910915,0.0002774839,0.00010507742,0.018448958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879396,0.00023455331,0.000051082814,0.00023058416,0.00022191416,0.00046785097],"domain_scores_gemma":[0.99753714,0.0008008863,0.000666999,0.00023519342,0.00037057762,0.0003892571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017971908,0.0016618108,0.002101845,0.0013379698,0.0015605177,0.0026841403,0.0052327393,0.0034301467,0.007834577],"category_scores_gemma":[0.0051013087,0.0008478553,0.0015220252,0.0016629488,0.0018533213,0.0028079946,0.0022060187,0.0032301776,0.0017875768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005336416,0.00033513855,0.005752015,0.0003245952,0.000111080066,0.0022350403,0.00045791088,0.70814025,0.005856719,0.2471988,0.013613661,0.01544116],"study_design_scores_gemma":[0.00003372394,0.00005803515,0.00058767793,0.000013600762,0.000033019878,0.00014420635,0.000058388337,0.9801839,0.00032513269,0.017668026,0.0008599604,0.000034353518],"about_ca_topic_score_codex":0.017305423,"about_ca_topic_score_gemma":0.011309472,"teacher_disagreement_score":0.017305423,"about_ca_system_score_codex":0.0024660279,"about_ca_system_score_gemma":0.0015124306,"threshold_uncertainty_score":0.034409404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9494273,0.00013104694,0.048499245,0.0003278042,0.000016866577,0.000036932335,0.000050809285,0.00005761181,0.0014524047],"genre_scores_gemma":[0.99820054,0.0000483813,0.0012274778,0.000018493927,0.000007874151,0.000011767547,0.00001938927,0.000004139955,0.00046192887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978787,0.0007595384,0.00008057502,0.0003210491,0.00026803304,0.0006922291],"domain_scores_gemma":[0.9902958,0.006079449,0.0018731646,0.00030798893,0.0006321982,0.00081134454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033876577,0.00052962004,0.00085912365,0.0006928883,0.0008595666,0.0015010185,0.001472184,0.0012468648,0.0012954354],"category_scores_gemma":[0.007971333,0.00058951916,0.0006313021,0.000691908,0.0014268503,0.0016975824,0.0008474592,0.00094206334,0.00013978782],"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.0007020632,0.00034970455,0.034733642,0.0000939394,0.00016212276,0.0008479635,0.00088993955,0.88708967,0.0041337023,0.061992433,0.0009011043,0.008103761],"study_design_scores_gemma":[0.00002010508,0.00008670147,0.0024870944,0.0000048047214,0.00002181562,0.00006913096,0.00019580896,0.9915181,0.00021861511,0.005273694,0.00008039671,0.000023708673],"about_ca_topic_score_codex":0.012096578,"about_ca_topic_score_gemma":0.009898381,"teacher_disagreement_score":0.012096578,"about_ca_system_score_codex":0.0018924781,"about_ca_system_score_gemma":0.0018821788,"threshold_uncertainty_score":0.024052322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74332005,0.00044387925,0.25137037,0.0010478408,0.0000377139,0.000073773364,0.00014694495,0.0002626774,0.0032966523],"genre_scores_gemma":[0.99155444,0.00014985805,0.007190012,0.00008499585,0.000024252962,0.000035478708,0.00005979589,0.000025681986,0.00087546714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993113,0.0002482639,0.000020991212,0.0001243364,0.00013212336,0.00016293925],"domain_scores_gemma":[0.9912143,0.006088323,0.0010898891,0.00050034974,0.0006701897,0.00043688185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032448575,0.00041380693,0.0007488907,0.0010151371,0.00072426064,0.0010444048,0.0009745201,0.0009691502,0.0012547337],"category_scores_gemma":[0.013495883,0.00044145738,0.0006221223,0.00043451926,0.0018962531,0.00258545,0.0006992595,0.00091098866,0.0001454885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014276578,0.00008402218,0.004852856,0.000059616676,0.000050130417,0.00019150432,0.000208402,0.90077,0.006792132,0.08140064,0.00083078264,0.004617247],"study_design_scores_gemma":[0.000008904449,0.000028127854,0.0009532252,0.0000059027543,0.0000048198294,0.000042449075,0.000038697715,0.97998613,0.00042697898,0.018389218,0.00010146303,0.000014046856],"about_ca_topic_score_codex":0.0038043605,"about_ca_topic_score_gemma":0.0018918035,"teacher_disagreement_score":0.0038043605,"about_ca_system_score_codex":0.0020777676,"about_ca_system_score_gemma":0.0010889502,"threshold_uncertainty_score":0.017160654},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009645598,0.1430891,0.3522923,0.0432112,0.21748105,0.0009871694,0.0028306737,0.004065571,0.22639735],"genre_scores_gemma":[0.075121865,0.074621074,0.11381061,0.0071557458,0.0635938,0.0011911204,0.007776905,0.0017768582,0.65495205],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99726653,0.00079394324,0.00019161862,0.00041123058,0.0011103655,0.00022624877],"domain_scores_gemma":[0.9946696,0.0014322646,0.00021150254,0.0006174909,0.0022208758,0.00084814325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00468234,0.0017437937,0.0020391762,0.0013449148,0.001211566,0.004563098,0.002200558,0.0020214356,0.086108334],"category_scores_gemma":[0.008723668,0.00055555464,0.0011289708,0.0014106252,0.0010393996,0.0031643766,0.0019395255,0.004748421,0.030207412],"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.0003714292,0.00015008356,0.00071342464,0.0004876177,0.00009108412,0.00020634031,0.00017988519,0.002680293,0.002315495,0.027401153,0.7234405,0.24196272],"study_design_scores_gemma":[0.00004238896,0.00015948286,0.00082086126,0.00025112389,0.000040051087,0.00027179005,0.00008295478,0.010210076,0.00064213085,0.017177274,0.970271,0.00003091091],"about_ca_topic_score_codex":0.003168249,"about_ca_topic_score_gemma":0.0024125492,"teacher_disagreement_score":0.086108334,"about_ca_system_score_codex":0.0022114895,"about_ca_system_score_gemma":0.0027331116,"threshold_uncertainty_score":0.28806102},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025871145,0.000043838834,0.99579066,0.000059234004,0.000039779512,0.00005753303,0.000035405443,0.00042324528,0.00096333894],"genre_scores_gemma":[0.061239015,0.00006979531,0.9369094,0.00007589804,0.000025135872,0.0003203375,0.00007149585,0.000091385555,0.0011974997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996439,0.00010342825,0.000026642208,0.000044853652,0.00015666142,0.00002436396],"domain_scores_gemma":[0.99779713,0.0011720499,0.00015839312,0.00023909075,0.0005500799,0.00008319559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015576369,0.0005802543,0.00045903606,0.0010570367,0.00068200805,0.00054346526,0.0011641207,0.0011801196,0.003868182],"category_scores_gemma":[0.006624192,0.0003469384,0.00046674596,0.0011357059,0.00071520585,0.00079303543,0.00060128205,0.0013336798,0.0010581561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018725489,0.000291341,0.0031103564,0.00033506582,0.00008523239,0.0001801981,0.00027251663,0.6871107,0.03413507,0.08022723,0.005273005,0.18879195],"study_design_scores_gemma":[0.000029007246,0.000020401947,0.00011967208,0.000009668119,0.000005684976,0.000041843836,0.000006766055,0.9936619,0.0014503659,0.0033435395,0.0012992851,0.00001189707],"about_ca_topic_score_codex":0.004656453,"about_ca_topic_score_gemma":0.004020975,"teacher_disagreement_score":0.004656453,"about_ca_system_score_codex":0.0008148514,"about_ca_system_score_gemma":0.0017691591,"threshold_uncertainty_score":0.012940407},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33569884,0.0005561831,0.64086753,0.0046122065,0.0007646928,0.00018687845,0.00025169284,0.0005015912,0.016560376],"genre_scores_gemma":[0.9639447,0.00019515809,0.021417757,0.00049676496,0.00029395014,0.00005188578,0.00008385133,0.000072169256,0.013443857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99560416,0.0009655068,0.00018861811,0.00084157847,0.0009450325,0.0014550966],"domain_scores_gemma":[0.9757311,0.013236124,0.0023201657,0.0028002572,0.0030341898,0.0028781167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007976882,0.0006967663,0.00203457,0.0011694902,0.0018692939,0.0050031887,0.0049423757,0.0031932297,0.009617152],"category_scores_gemma":[0.030519882,0.0013373755,0.0010973979,0.0017128551,0.0022489328,0.0070406827,0.0025583422,0.004443483,0.0010297033],"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.0013248766,0.00065806217,0.0071146465,0.00014610143,0.00010384922,0.0014404191,0.00080614304,0.122167066,0.004675364,0.81255,0.008308272,0.040705137],"study_design_scores_gemma":[0.00011004031,0.00015224278,0.00087223685,0.000018394894,0.000055458637,0.00037047462,0.00022220146,0.800262,0.0012223717,0.19543542,0.0012173529,0.00006181326],"about_ca_topic_score_codex":0.004791291,"about_ca_topic_score_gemma":0.0038758914,"teacher_disagreement_score":0.009617152,"about_ca_system_score_codex":0.003766056,"about_ca_system_score_gemma":0.0036676775,"threshold_uncertainty_score":0.04218626},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31390303,0.0005733619,0.6754702,0.0010576674,0.00014757477,0.00017131811,0.0003211559,0.00023105183,0.008124625],"genre_scores_gemma":[0.98278576,0.00014954682,0.012743432,0.00007498575,0.000027440878,0.00007655986,0.000073869676,0.000017003138,0.004051378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979134,0.0006212696,0.00009254202,0.0004968791,0.000310098,0.00056568853],"domain_scores_gemma":[0.9958681,0.002444544,0.0005447066,0.00013941874,0.00056833314,0.00043495107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022441116,0.0012045789,0.0015615582,0.00077617244,0.00095378887,0.002439422,0.0015303778,0.001728491,0.003541482],"category_scores_gemma":[0.005258046,0.00072474085,0.0008091377,0.0006470294,0.001806049,0.0019967507,0.0019356158,0.0014484016,0.00027885073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018226205,0.00011345913,0.0007865304,0.00006340055,0.000058209742,0.00028402993,0.0001416116,0.94401896,0.002238307,0.049040273,0.0004342482,0.0026387111],"study_design_scores_gemma":[0.000024588458,0.000037827584,0.00012806868,0.000003810066,0.000009082119,0.000013185815,0.000030416139,0.99244446,0.00014191074,0.0070248507,0.00013121884,0.000010508678],"about_ca_topic_score_codex":0.011742741,"about_ca_topic_score_gemma":0.004900499,"teacher_disagreement_score":0.011742741,"about_ca_system_score_codex":0.0030111307,"about_ca_system_score_gemma":0.001769908,"threshold_uncertainty_score":0.023348808},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06384501,0.0024676071,0.9082484,0.0020087168,0.00045697647,0.00008120563,0.00019577923,0.00020736543,0.022488909],"genre_scores_gemma":[0.9707324,0.0010912472,0.014745275,0.00015226881,0.0001285045,0.00011188926,0.0000960941,0.000046492984,0.012895846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996271,0.00015552848,0.000010851752,0.00004844642,0.00007663945,0.00008145671],"domain_scores_gemma":[0.9990251,0.00055732985,0.00012450828,0.000033999055,0.00017363373,0.000085522544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083261955,0.0008349335,0.0013840523,0.00039948738,0.0004520717,0.0016389474,0.0010579309,0.0014338953,0.0028690898],"category_scores_gemma":[0.0033524577,0.00050116953,0.0007698488,0.00058041106,0.001447056,0.0011593761,0.0011262724,0.0015192305,0.00023529147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025848713,0.000012713969,0.000116439915,0.000025778085,0.00001122462,0.000029786974,0.000020382267,0.97365135,0.00027469784,0.023870183,0.00045070084,0.0015108066],"study_design_scores_gemma":[0.0000028818683,0.0000046418454,0.000022422502,0.0000024251685,0.0000018006913,0.0000017168032,0.0000040812142,0.99677116,0.000030215737,0.0030146718,0.00014206802,0.0000019583522],"about_ca_topic_score_codex":0.021081546,"about_ca_topic_score_gemma":0.008657505,"teacher_disagreement_score":0.021081546,"about_ca_system_score_codex":0.001516381,"about_ca_system_score_gemma":0.0017204382,"threshold_uncertainty_score":0.04191768},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050710127,0.00027718357,0.9407783,0.00067851983,0.00007821969,0.00018473796,0.0001323182,0.00029217347,0.0068683624],"genre_scores_gemma":[0.8691204,0.00036275893,0.12527862,0.00029987178,0.00009428068,0.00021052187,0.00013577337,0.00010995578,0.0043877177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976967,0.0011610548,0.00007708719,0.0003554875,0.00030812534,0.00040153446],"domain_scores_gemma":[0.995411,0.0033108213,0.00028178692,0.00016404413,0.0004653441,0.00036697864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033062575,0.0008446166,0.0017005516,0.0011004962,0.00092026417,0.0021804743,0.0020147928,0.0024333252,0.0054175137],"category_scores_gemma":[0.010174056,0.001147823,0.000649726,0.001175541,0.001450264,0.0017706427,0.0024636304,0.0012724312,0.00064723904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026738903,0.00009645458,0.00036795,0.0001190459,0.000041244988,0.0000480606,0.000069358706,0.93025076,0.003259031,0.049110066,0.001252456,0.015118169],"study_design_scores_gemma":[0.000029607832,0.000039466173,0.00005070148,0.0000074719387,0.000009618757,0.000007633521,0.000011171166,0.9850257,0.00022533872,0.014365659,0.0002203042,0.00000729835],"about_ca_topic_score_codex":0.005113504,"about_ca_topic_score_gemma":0.0041532153,"teacher_disagreement_score":0.0054175137,"about_ca_system_score_codex":0.002872427,"about_ca_system_score_gemma":0.0033514793,"threshold_uncertainty_score":0.020841002},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27302703,0.00061116606,0.7047926,0.002591537,0.0003243446,0.00023736416,0.0013863902,0.0014421821,0.015587406],"genre_scores_gemma":[0.95523953,0.00024297234,0.023170771,0.00021567091,0.00016434219,0.00014649553,0.00032728008,0.00013925078,0.020353772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980471,0.00040922104,0.00007714148,0.00059706037,0.0003256853,0.00054388796],"domain_scores_gemma":[0.99701715,0.0014041346,0.00037690898,0.0003359164,0.0005428253,0.00032316044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002281015,0.0011668302,0.0017803708,0.0011417494,0.0011210698,0.0037165617,0.0047009774,0.0036372412,0.0074355025],"category_scores_gemma":[0.0044417074,0.0010395581,0.0012008043,0.0016074138,0.001334347,0.0043823617,0.0014353326,0.0022698552,0.001429714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038892258,0.0002959049,0.002292089,0.00009120134,0.00007671651,0.0005220871,0.00024944489,0.9100796,0.002494681,0.06562287,0.0033926913,0.014493704],"study_design_scores_gemma":[0.000019948116,0.000022585753,0.00019317615,0.0000034299544,0.000017095235,0.00003739234,0.000013967381,0.9938881,0.00011806482,0.00537313,0.0003027805,0.000010481776],"about_ca_topic_score_codex":0.018094718,"about_ca_topic_score_gemma":0.011507623,"teacher_disagreement_score":0.018094718,"about_ca_system_score_codex":0.003550582,"about_ca_system_score_gemma":0.0021900316,"threshold_uncertainty_score":0.035978794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5520676,0.0021189114,0.42570138,0.0029500176,0.00030981205,0.00011822339,0.00019003435,0.00072828686,0.015815778],"genre_scores_gemma":[0.98908335,0.0003096191,0.007288916,0.00010516853,0.00008642863,0.000033134434,0.000070111615,0.000046328223,0.0029768937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766135,0.00095524394,0.000047976984,0.00032018003,0.00044013755,0.00057510403],"domain_scores_gemma":[0.9896728,0.0062784315,0.00090387894,0.00038286427,0.0014947723,0.0012673488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004959127,0.0012561195,0.0018552534,0.0012260433,0.0015200025,0.0027802044,0.0032882988,0.002164878,0.0033068734],"category_scores_gemma":[0.013529018,0.0006849624,0.0008282469,0.0011331367,0.002276933,0.0033143312,0.0020804398,0.0020857856,0.00046420994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032162396,0.00014272601,0.0014589756,0.00007577837,0.000069799324,0.00014032992,0.00022568768,0.92658985,0.0024299754,0.06297435,0.0014914215,0.004079577],"study_design_scores_gemma":[0.000009646912,0.000043829365,0.00007514918,0.0000029799983,0.0000091944175,0.000011816533,0.000022298276,0.99596584,0.000111029185,0.0036648687,0.00007523759,0.000008130465],"about_ca_topic_score_codex":0.012377255,"about_ca_topic_score_gemma":0.004368575,"teacher_disagreement_score":0.012377255,"about_ca_system_score_codex":0.0038244766,"about_ca_system_score_gemma":0.002897817,"threshold_uncertainty_score":0.027748644},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024902271,0.000661911,0.9613539,0.0010995193,0.0001409974,0.000076640536,0.00030845485,0.00022438364,0.011231745],"genre_scores_gemma":[0.92337704,0.0019640648,0.052528154,0.00026373836,0.0002599751,0.0004718161,0.00037582088,0.00008596713,0.02067338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988617,0.0003398661,0.000048757374,0.00025822606,0.00029588598,0.00019565431],"domain_scores_gemma":[0.9994072,0.00021619124,0.000129478,0.00003218791,0.00014965492,0.00006533303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009833988,0.00079328904,0.000984241,0.0006880879,0.0008204534,0.0021639233,0.0021875906,0.0016660533,0.0035693524],"category_scores_gemma":[0.0018199049,0.0006205163,0.0006935929,0.00096423755,0.0012105308,0.0018142824,0.0009688174,0.0014982547,0.0005377536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002238643,0.000023309103,0.00042521316,0.00003127419,0.00001651122,0.00009071321,0.000045349236,0.8927842,0.000963029,0.1021501,0.00088926137,0.0025586742],"study_design_scores_gemma":[0.000004956129,0.000010033956,0.00010277984,0.0000034838313,0.000004985392,0.000013429836,0.000010345696,0.9908839,0.00007624748,0.008383889,0.0004982543,0.000007790908],"about_ca_topic_score_codex":0.018753847,"about_ca_topic_score_gemma":0.007746867,"teacher_disagreement_score":0.018753847,"about_ca_system_score_codex":0.0030059873,"about_ca_system_score_gemma":0.002875239,"threshold_uncertainty_score":0.03728938},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012006359,0.00014359497,0.98524,0.00021081422,0.00002805318,0.00003492517,0.000049145776,0.00013879991,0.0021483055],"genre_scores_gemma":[0.7103977,0.0003091983,0.28193513,0.00015923423,0.000061718936,0.0002606569,0.00016350266,0.000102567246,0.0066102515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990682,0.0003330417,0.000043206972,0.00020433708,0.00019407336,0.00015712825],"domain_scores_gemma":[0.99740654,0.0018348155,0.0003134161,0.00012507511,0.0001786411,0.00014156762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017009776,0.00079753326,0.001299613,0.00061659503,0.0007362626,0.0014981669,0.0019282188,0.0013027063,0.0028634449],"category_scores_gemma":[0.004426892,0.00071985123,0.00077958783,0.0011128851,0.0016936888,0.001393641,0.0023622955,0.00189775,0.0003596113],"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.000028828474,0.000015452197,0.00021806172,0.000027268856,0.0000163396,0.000033445343,0.000026466103,0.9643102,0.00021321581,0.029038258,0.00023061999,0.0058418927],"study_design_scores_gemma":[0.0000071007003,0.000006195568,0.000028835555,0.0000026036907,0.0000020234254,0.000005814078,0.0000036053987,0.9881584,0.000072741066,0.01154043,0.00016926599,0.0000029995058],"about_ca_topic_score_codex":0.007945681,"about_ca_topic_score_gemma":0.007735048,"teacher_disagreement_score":0.007945681,"about_ca_system_score_codex":0.0019150678,"about_ca_system_score_gemma":0.0019264146,"threshold_uncertainty_score":0.015798867},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012595324,0.0001568391,0.98066026,0.00042249725,0.000029932125,0.000053323154,0.00008329423,0.000111442576,0.005887],"genre_scores_gemma":[0.910112,0.0004516417,0.08240793,0.00016271294,0.00011771007,0.00029952385,0.00014949388,0.00004944659,0.0062495535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976907,0.000761257,0.00009889545,0.00045761617,0.000758606,0.00023293852],"domain_scores_gemma":[0.9981394,0.0008837813,0.000305885,0.00032834077,0.00021855404,0.00012403517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017622975,0.0007528928,0.0011774959,0.0006058421,0.0005661673,0.0015872333,0.0022897273,0.0012532205,0.0028995243],"category_scores_gemma":[0.0033993365,0.00050871895,0.0010034359,0.00091210695,0.002178781,0.0028290947,0.0019302306,0.0015238125,0.00028425737],"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.0000531372,0.00004660647,0.00031239013,0.000057889018,0.000042896885,0.00015407625,0.00012224079,0.61892176,0.0010711425,0.36576048,0.0006768599,0.012780553],"study_design_scores_gemma":[0.00001836064,0.00004114654,0.000102169506,0.000010323085,0.000014566285,0.00003079659,0.000019725481,0.87038237,0.00037888062,0.12762971,0.0013579874,0.00001399261],"about_ca_topic_score_codex":0.002905258,"about_ca_topic_score_gemma":0.0019206639,"teacher_disagreement_score":0.002905258,"about_ca_system_score_codex":0.0020876823,"about_ca_system_score_gemma":0.0020544191,"threshold_uncertainty_score":0.015147269},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45893446,0.0042504403,0.48162887,0.004603568,0.0003467909,0.00008988832,0.00020778096,0.00016335331,0.049774878],"genre_scores_gemma":[0.97374976,0.001447322,0.012914723,0.00021378133,0.00027958682,0.00005910174,0.000066055174,0.000031899817,0.011237737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957997,0.00014931068,0.000017831258,0.000050830742,0.00010918898,0.00009282554],"domain_scores_gemma":[0.99861276,0.0005866122,0.0003107797,0.000078960446,0.00018940435,0.00022142958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014405908,0.0005694724,0.0006467224,0.0013710121,0.0009834705,0.0019769282,0.0010431837,0.0011729437,0.0024883884],"category_scores_gemma":[0.0051272763,0.00029756472,0.00061135576,0.0012197706,0.0019181443,0.002474395,0.0013091572,0.0012705759,0.00036148165],"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.000013430329,0.000013653475,0.0005772874,0.000021762708,0.000005914851,0.00014153251,0.00017971621,0.016361501,0.00044021892,0.97967094,0.00052043813,0.0020536592],"study_design_scores_gemma":[0.000021747634,0.00002361323,0.00046911478,0.000029273711,0.00000962415,0.00011642708,0.00014419295,0.3862815,0.0003602652,0.6098299,0.0026886663,0.000025551059],"about_ca_topic_score_codex":0.0042669233,"about_ca_topic_score_gemma":0.0024954916,"teacher_disagreement_score":0.0042669233,"about_ca_system_score_codex":0.0021572637,"about_ca_system_score_gemma":0.0009913354,"threshold_uncertainty_score":0.01565218},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6036475,0.0007491268,0.3873052,0.0009302216,0.00006300809,0.00008556108,0.00016801582,0.00040196266,0.0066494304],"genre_scores_gemma":[0.99413884,0.00024919718,0.004169478,0.000054855125,0.00004036563,0.000033704982,0.00004916183,0.00003011945,0.0012343399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914944,0.00022900262,0.00003623444,0.00016716763,0.00019237665,0.00022584993],"domain_scores_gemma":[0.9916345,0.0044655516,0.001682477,0.00039993456,0.0007734719,0.0010440362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023518775,0.0008084464,0.001205391,0.0016138954,0.0010177003,0.0021739253,0.0015169673,0.0010356515,0.0021170366],"category_scores_gemma":[0.0151240425,0.0005440128,0.0009474421,0.00082556513,0.003284489,0.0024824843,0.0019123082,0.0019162585,0.00019656986],"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.00019279617,0.00019519794,0.005035052,0.00018398301,0.00016918659,0.0009408263,0.00085180614,0.40632412,0.016851591,0.5603802,0.001988207,0.0068870764],"study_design_scores_gemma":[0.000024699608,0.000049224393,0.0012520918,0.000010087517,0.00002091849,0.000084175466,0.00011393752,0.93138766,0.00058114674,0.06613302,0.000308536,0.000034600573],"about_ca_topic_score_codex":0.0071301525,"about_ca_topic_score_gemma":0.00218007,"teacher_disagreement_score":0.0071301525,"about_ca_system_score_codex":0.0024099627,"about_ca_system_score_gemma":0.0010345156,"threshold_uncertainty_score":0.017485619},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.708519,0.00034804465,0.28362292,0.00088257063,0.000107999345,0.00018114001,0.0001241405,0.00044405428,0.005770089],"genre_scores_gemma":[0.9885274,0.000054965487,0.010644801,0.000038338665,0.000013624155,0.000029984765,0.000017023198,0.000016273105,0.00065754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923456,0.00020841966,0.000048399786,0.00014247089,0.00013783583,0.00022843666],"domain_scores_gemma":[0.9974843,0.0011416493,0.000590839,0.00015423929,0.00030603574,0.00032285554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002153864,0.00080502237,0.00081922923,0.0007601514,0.00077425904,0.0017558351,0.0015147185,0.0008624044,0.002314034],"category_scores_gemma":[0.004696502,0.0004518496,0.0005135882,0.00036064145,0.0015140185,0.0010646806,0.00089000585,0.0011769835,0.00018648377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000554199,0.00022704927,0.0011667566,0.000067247805,0.00003469192,0.00017239572,0.00013552482,0.95502985,0.011377462,0.021637546,0.0006847214,0.008912517],"study_design_scores_gemma":[0.00006019268,0.00012599859,0.00030845896,0.000008554595,0.000019956395,0.000013723812,0.000045721616,0.9933462,0.0017926362,0.004135764,0.00012388935,0.0000188701],"about_ca_topic_score_codex":0.008527458,"about_ca_topic_score_gemma":0.004313252,"teacher_disagreement_score":0.008527458,"about_ca_system_score_codex":0.002676346,"about_ca_system_score_gemma":0.0015092907,"threshold_uncertainty_score":0.019418418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59155273,0.0003665082,0.38685033,0.0005673437,0.000094130235,0.000056643225,0.00020520894,0.0006489297,0.019658202],"genre_scores_gemma":[0.98612404,0.00014744325,0.010195618,0.00007334137,0.00007376491,0.00002999556,0.00008394768,0.000054102467,0.0032177337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998998,0.00015949892,0.00005880999,0.00026054788,0.00027613717,0.00024698518],"domain_scores_gemma":[0.9950595,0.0022722948,0.00088999874,0.0005817144,0.00078119675,0.00041533684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014063778,0.00056541926,0.0006586723,0.0010824441,0.0009459759,0.002071851,0.0006193804,0.0006260423,0.0048648957],"category_scores_gemma":[0.0077519333,0.00047213063,0.00090748223,0.0005867069,0.003014938,0.0029219936,0.0012866068,0.0014049166,0.0006437473],"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.000211513,0.000075204975,0.005489255,0.000051419524,0.000051140378,0.0006030788,0.0006712542,0.027031455,0.0052314936,0.953584,0.0006075321,0.00639256],"study_design_scores_gemma":[0.00004702948,0.000114269176,0.0024814392,0.00004981687,0.00003595646,0.00023635926,0.00013627809,0.15066844,0.0035120316,0.839433,0.0032254101,0.000059970047],"about_ca_topic_score_codex":0.0028093115,"about_ca_topic_score_gemma":0.0021083362,"teacher_disagreement_score":0.0048648957,"about_ca_system_score_codex":0.001401527,"about_ca_system_score_gemma":0.0008955606,"threshold_uncertainty_score":0.01627469},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9405894,0.000102759754,0.05565556,0.0003694396,0.00002382018,0.000051405634,0.00005691333,0.00003322658,0.0031175541],"genre_scores_gemma":[0.9964766,0.000034093468,0.0023618962,0.000028550234,0.00000980507,0.000015577554,0.000016268797,0.0000049069104,0.0010522068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861777,0.00044977342,0.000050894,0.00019923355,0.00013579047,0.00054642523],"domain_scores_gemma":[0.99508864,0.0026526114,0.00097532343,0.00015418245,0.0003730399,0.0007562494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021412992,0.00060842553,0.0009331933,0.00048337586,0.00097334624,0.0018090457,0.001511756,0.0014602329,0.0031832748],"category_scores_gemma":[0.005797025,0.00038413092,0.0007623157,0.00050707266,0.0012545162,0.0018553388,0.0010997406,0.0010137637,0.00028014873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019411835,0.00094462116,0.038076602,0.00022882473,0.0002550819,0.0022849122,0.00160548,0.7412159,0.015929537,0.1770261,0.0019011903,0.018590542],"study_design_scores_gemma":[0.000059438935,0.00025889365,0.0024403112,0.000007797934,0.000034307206,0.00009614393,0.0005501246,0.9838209,0.00061418087,0.0118299285,0.00025445438,0.00003345839],"about_ca_topic_score_codex":0.0070874533,"about_ca_topic_score_gemma":0.0052470956,"teacher_disagreement_score":0.0070874533,"about_ca_system_score_codex":0.0013825155,"about_ca_system_score_gemma":0.001320352,"threshold_uncertainty_score":0.014092386},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13322689,0.0060552973,0.80263823,0.003185651,0.000410724,0.00016157563,0.0004920924,0.0009614143,0.05286811],"genre_scores_gemma":[0.8756405,0.0055039814,0.09632614,0.0009957354,0.0008432423,0.00021381833,0.0006085384,0.0010811214,0.018786915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871826,0.00027949756,0.000059314574,0.00013019901,0.00040139037,0.00041141352],"domain_scores_gemma":[0.9928007,0.0046932595,0.0007959894,0.00035775176,0.0010144579,0.00033779835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023935735,0.0016421269,0.0014954453,0.0027451655,0.0011543923,0.0025187596,0.0022391065,0.0015456444,0.006716166],"category_scores_gemma":[0.018515425,0.0007143895,0.0015586206,0.0015355144,0.0024313084,0.0041899127,0.0018200877,0.0034752784,0.0017275097],"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.00027358398,0.00035868428,0.0044033593,0.0005465239,0.00011669843,0.0016980827,0.0021274672,0.35502774,0.013306698,0.56947124,0.01117861,0.041491278],"study_design_scores_gemma":[0.000022652568,0.000029827286,0.0008674376,0.00008753017,0.00003333941,0.00046900412,0.0003188218,0.88885957,0.0020400267,0.10433843,0.0028708046,0.00006252035],"about_ca_topic_score_codex":0.005973344,"about_ca_topic_score_gemma":0.005218665,"teacher_disagreement_score":0.006716166,"about_ca_system_score_codex":0.0032450997,"about_ca_system_score_gemma":0.0024798398,"threshold_uncertainty_score":0.023544967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043424875,0.00056930195,0.98656917,0.0005786773,0.0001329346,0.00013086578,0.00021018842,0.000602422,0.0068639624],"genre_scores_gemma":[0.20705414,0.0025688296,0.76693803,0.00055571744,0.00055904174,0.00079620647,0.0008032984,0.0013316519,0.019393083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989256,0.0002684404,0.00006525249,0.00014366675,0.00045345724,0.00014356499],"domain_scores_gemma":[0.99216217,0.005718042,0.00053291407,0.0006321496,0.0008349588,0.000119751785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028353676,0.0022856623,0.0011313225,0.0018782915,0.0008091689,0.002130261,0.0019184904,0.0017599855,0.014849181],"category_scores_gemma":[0.023988698,0.0008560536,0.0018432785,0.0014066503,0.0015021353,0.0058269,0.0015186556,0.0046986197,0.0056906994],"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.00007384828,0.0003098718,0.0014999411,0.0005253762,0.000073364485,0.00034327348,0.00047894844,0.4506384,0.009045244,0.40633732,0.015874965,0.11479937],"study_design_scores_gemma":[0.000015660002,0.00002303782,0.00029087462,0.000056588964,0.000017534841,0.00013881741,0.000072147865,0.89127964,0.0017913517,0.10141879,0.0048594894,0.000036110745],"about_ca_topic_score_codex":0.0037921784,"about_ca_topic_score_gemma":0.0057222242,"teacher_disagreement_score":0.014849181,"about_ca_system_score_codex":0.0024093003,"about_ca_system_score_gemma":0.0038423268,"threshold_uncertainty_score":0.049675465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5177806,0.00090954633,0.4705075,0.0012780852,0.00013419589,0.00017125739,0.00051697134,0.00051312,0.008188666],"genre_scores_gemma":[0.96134984,0.0002243675,0.036466885,0.00004960809,0.00006954281,0.000044442924,0.0003037673,0.000038869603,0.0014525772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955076,0.002007963,0.0002872164,0.00036719878,0.0012108267,0.00061916624],"domain_scores_gemma":[0.9696221,0.023249265,0.001965954,0.0017744406,0.0017186016,0.0016697339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005908057,0.0010099785,0.0013571804,0.003902613,0.0012760814,0.0044093886,0.0013408484,0.0014729265,0.0042432873],"category_scores_gemma":[0.029913638,0.0006521232,0.00085895834,0.003197268,0.002074847,0.0057986686,0.0018839614,0.0020350765,0.00038070296],"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.00076848443,0.00025388907,0.009963188,0.00021366475,0.00011727044,0.00013836044,0.00035900602,0.5737905,0.0024134715,0.29503208,0.0027502778,0.11419985],"study_design_scores_gemma":[0.00003558408,0.0002520183,0.0019504979,0.00004905866,0.000031769006,0.000037957416,0.00014842927,0.7281785,0.0009314303,0.26766035,0.00068116694,0.000043229793],"about_ca_topic_score_codex":0.0025752296,"about_ca_topic_score_gemma":0.0031048406,"teacher_disagreement_score":0.005908057,"about_ca_system_score_codex":0.0021997395,"about_ca_system_score_gemma":0.0018734069,"threshold_uncertainty_score":0.031245172},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33056167,0.0012980467,0.6489216,0.002389039,0.00019956799,0.00024040513,0.00033419087,0.00053194916,0.015523514],"genre_scores_gemma":[0.9877978,0.00022224725,0.007819195,0.00009614065,0.000060121234,0.000038340193,0.000049020084,0.000038439113,0.0038785588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989862,0.0002664501,0.00003144816,0.00017813726,0.00024522835,0.00029256984],"domain_scores_gemma":[0.997247,0.0016893762,0.00038547427,0.00007526773,0.00041905374,0.00018381224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001981883,0.000797737,0.0013019335,0.00076580327,0.001190254,0.0020104016,0.001785768,0.0012810578,0.0033939872],"category_scores_gemma":[0.004503332,0.00079830387,0.0005739248,0.00066769455,0.0015262862,0.0014070664,0.0010636958,0.0010551759,0.00023288658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001946743,0.000082406936,0.0012096314,0.00009914593,0.00004417771,0.00036101803,0.0001376169,0.946162,0.0038185362,0.042738363,0.0012191851,0.0039332304],"study_design_scores_gemma":[0.0000058124433,0.000010678034,0.00010503914,0.0000018897562,0.0000056643694,0.00001702254,0.00001016409,0.99795854,0.00012079927,0.0016998013,0.00006058924,0.0000039347797],"about_ca_topic_score_codex":0.017211633,"about_ca_topic_score_gemma":0.0073949317,"teacher_disagreement_score":0.017211633,"about_ca_system_score_codex":0.0037424986,"about_ca_system_score_gemma":0.002895704,"threshold_uncertainty_score":0.0342229},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68259007,0.00039680928,0.31312743,0.000760833,0.00004627593,0.000041550607,0.00008686043,0.00032389487,0.0026262396],"genre_scores_gemma":[0.9944009,0.000111917514,0.0043617217,0.00005091103,0.000022011232,0.000023217142,0.000053527885,0.000033279233,0.00094257033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999406,0.00017053694,0.000025991443,0.00011365725,0.00016013069,0.00012375982],"domain_scores_gemma":[0.99466634,0.0029481188,0.0011057466,0.00028494332,0.0006166503,0.0003782309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032309024,0.0004647561,0.000599485,0.0009938485,0.0006001076,0.001237193,0.0010430571,0.00082093943,0.0011361126],"category_scores_gemma":[0.012729148,0.00032021734,0.000539247,0.0005643142,0.0019485506,0.0023605803,0.00090277137,0.0009168954,0.00015347105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029187396,0.00013586791,0.012090885,0.00010477653,0.00007607063,0.00066226616,0.0006285827,0.8026375,0.008614779,0.16473204,0.0014146836,0.0086106565],"study_design_scores_gemma":[0.000006748917,0.000025631898,0.0011494547,0.0000051118313,0.0000061427318,0.000055921708,0.00006218464,0.98760855,0.0003917133,0.010548881,0.00012383178,0.000015895577],"about_ca_topic_score_codex":0.004181154,"about_ca_topic_score_gemma":0.001690908,"teacher_disagreement_score":0.004181154,"about_ca_system_score_codex":0.0018721493,"about_ca_system_score_gemma":0.00082162576,"threshold_uncertainty_score":0.017086864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5565419,0.0003966094,0.43255714,0.0009546675,0.000063342195,0.000055659966,0.00010457176,0.0003455009,0.008980675],"genre_scores_gemma":[0.993313,0.00012914705,0.00478701,0.00007104318,0.000024196594,0.000029739791,0.000029479665,0.000035556142,0.0015807636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895656,0.00035521886,0.000042806623,0.00021084934,0.00020276042,0.00023177551],"domain_scores_gemma":[0.993619,0.0032931606,0.0013883213,0.00044033266,0.00064540043,0.00061366556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002774829,0.0005493739,0.0011896011,0.0010751458,0.000707099,0.0014722939,0.0014563827,0.0011936914,0.0023995852],"category_scores_gemma":[0.010122912,0.00041283315,0.0010523675,0.0003462977,0.002665467,0.0022582975,0.0016840213,0.0019191962,0.00019408838],"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.00016575835,0.00017776796,0.0027674725,0.0001224734,0.000071688635,0.00061738765,0.0002664285,0.6008697,0.012359641,0.37402567,0.0009227772,0.0076332684],"study_design_scores_gemma":[0.000008772295,0.000063632644,0.0004537124,0.000010055768,0.000009951674,0.000086412976,0.00003611375,0.9551902,0.0010648341,0.04286771,0.00019108583,0.000017455028],"about_ca_topic_score_codex":0.0031825155,"about_ca_topic_score_gemma":0.00091161864,"teacher_disagreement_score":0.0031825155,"about_ca_system_score_codex":0.002075653,"about_ca_system_score_gemma":0.0008510643,"threshold_uncertainty_score":0.015060008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62875074,0.0007872485,0.3642461,0.00097366644,0.000083219704,0.000059250193,0.00011321958,0.00033142345,0.0046551693],"genre_scores_gemma":[0.9940578,0.000148515,0.004506736,0.000056572968,0.000029054303,0.000025305775,0.0000545991,0.000028002632,0.0010934643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995189,0.00015849598,0.000017587654,0.00007827443,0.0001258308,0.000100888275],"domain_scores_gemma":[0.99640393,0.001884516,0.0008119802,0.00019039882,0.0004277152,0.00028147976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025340866,0.0004435361,0.00047815757,0.000893052,0.0005574389,0.0010169569,0.0009896137,0.0007143946,0.0011434653],"category_scores_gemma":[0.008967452,0.0002703018,0.00052100123,0.00048841804,0.0016624714,0.0022442942,0.0008315064,0.00076289236,0.00015669463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000260607,0.00014907554,0.009133113,0.00012899937,0.000079769285,0.0004944129,0.00043733668,0.75896186,0.009550043,0.21006595,0.0017602872,0.008978646],"study_design_scores_gemma":[0.000005467424,0.000024216992,0.0009846776,0.0000049313107,0.000005912265,0.000050002025,0.000046763646,0.9853843,0.00040840154,0.012905148,0.00016843705,0.000011789539],"about_ca_topic_score_codex":0.0032739548,"about_ca_topic_score_gemma":0.0014409916,"teacher_disagreement_score":0.0032739548,"about_ca_system_score_codex":0.0018063843,"about_ca_system_score_gemma":0.0006601567,"threshold_uncertainty_score":0.013401687},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09182317,0.0011463718,0.896946,0.001460182,0.00022196912,0.0001234443,0.0001372524,0.00032937512,0.007812155],"genre_scores_gemma":[0.9091393,0.0007197066,0.083296604,0.00046396017,0.00019616833,0.00018368407,0.00013387702,0.000115587754,0.0057511744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978011,0.0010918402,0.000066470784,0.0002611765,0.00041523052,0.00036416075],"domain_scores_gemma":[0.9908728,0.006404031,0.0010267069,0.0008281538,0.00048802327,0.00038025784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00577628,0.0006122555,0.0009919297,0.0013685192,0.0011225711,0.0013818278,0.001836297,0.0013945418,0.0033945115],"category_scores_gemma":[0.015448643,0.00047297004,0.00095860637,0.0008398252,0.0029630542,0.0044480036,0.0018767419,0.0016295509,0.0002894571],"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.00014693997,0.000077938304,0.0008571232,0.000073786985,0.00004744957,0.00007009629,0.00011345744,0.38814676,0.0017665713,0.5937508,0.0017541882,0.013194937],"study_design_scores_gemma":[0.000026667192,0.0000643747,0.00023054169,0.000015655782,0.00001160186,0.000037831633,0.000025970989,0.86288667,0.00040458725,0.13551027,0.00076694257,0.000018948413],"about_ca_topic_score_codex":0.002556158,"about_ca_topic_score_gemma":0.0027605456,"teacher_disagreement_score":0.00577628,"about_ca_system_score_codex":0.003299843,"about_ca_system_score_gemma":0.0018131455,"threshold_uncertainty_score":0.030548275},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21948878,0.0036865536,0.7603497,0.0012206511,0.00053620344,0.00017553079,0.0003217962,0.0007805067,0.013440269],"genre_scores_gemma":[0.9441322,0.0014927872,0.049845397,0.00019150563,0.0001572996,0.00012747648,0.00030135192,0.00025882653,0.0034930354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782217,0.00093017035,0.000104063874,0.00015224911,0.00058961037,0.00040174162],"domain_scores_gemma":[0.9850366,0.011371837,0.00067085103,0.000608343,0.0017904211,0.00052197155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050325044,0.0010579333,0.0023378134,0.0020941314,0.0014129134,0.0028026137,0.0025951331,0.002500488,0.0018590328],"category_scores_gemma":[0.020559555,0.0007042137,0.001343879,0.0019840724,0.0018312914,0.0026962801,0.0016678467,0.002402214,0.000375928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011056462,0.000043058404,0.00039517588,0.000047141268,0.000018714198,0.00002966009,0.0000988385,0.9808132,0.0002747143,0.014041803,0.0003184973,0.003808669],"study_design_scores_gemma":[0.0000050581616,0.000012852057,0.000053465432,0.000008458345,0.0000045461693,0.0000044939848,0.00001933039,0.99748564,0.000083507635,0.002200043,0.000116719886,0.0000057857756],"about_ca_topic_score_codex":0.028372467,"about_ca_topic_score_gemma":0.00911263,"teacher_disagreement_score":0.028372467,"about_ca_system_score_codex":0.0042829704,"about_ca_system_score_gemma":0.003803997,"threshold_uncertainty_score":0.056414664},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20370652,0.0004266512,0.7937795,0.0003802293,0.00004760494,0.000040398707,0.00015461452,0.00053151866,0.0009329582],"genre_scores_gemma":[0.97154546,0.00022916774,0.02711494,0.000034368226,0.000027454753,0.000029542904,0.00020274906,0.00003316473,0.00078314875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994438,0.00019483373,0.000021973337,0.00011164943,0.00015362562,0.00007417133],"domain_scores_gemma":[0.9956245,0.0033774737,0.0003082602,0.00015114024,0.00042691987,0.00011178849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018333853,0.000712163,0.0006953782,0.0009819667,0.00035490547,0.0010283388,0.0010533584,0.0008110119,0.0007720363],"category_scores_gemma":[0.0088978205,0.00065493217,0.00056810543,0.0008598943,0.0006873406,0.0017438668,0.00070183986,0.0014817619,0.00021713349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052334126,0.000022242742,0.0016593726,0.000010863295,0.000016573284,0.000014064463,0.000023894338,0.9893197,0.00040057124,0.0026809897,0.0001459865,0.005653525],"study_design_scores_gemma":[6.4424086e-7,0.0000021760388,0.000114650946,5.446607e-7,8.6617877e-7,0.0000013013341,0.0000012124206,0.9992132,0.000058900634,0.0005866605,0.000018113757,0.000001753889],"about_ca_topic_score_codex":0.021880614,"about_ca_topic_score_gemma":0.0116075715,"teacher_disagreement_score":0.021880614,"about_ca_system_score_codex":0.0017374115,"about_ca_system_score_gemma":0.00078151096,"threshold_uncertainty_score":0.043506563},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039223777,0.0034423997,0.08074631,0.006255724,0.0049342127,0.0008147498,0.010108684,0.03367736,0.8560982],"genre_scores_gemma":[0.04926727,0.0046044746,0.056636628,0.005131869,0.0023567176,0.00087926595,0.024099035,0.006734877,0.85029],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967451,0.0004405346,0.00021846367,0.00068638514,0.0015750099,0.00033445744],"domain_scores_gemma":[0.9943779,0.00078280986,0.0003510382,0.0016298185,0.0021515246,0.00070699636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026847813,0.0014532938,0.0011601245,0.0028453805,0.0017385788,0.006378274,0.004054203,0.0034460416,0.43698528],"category_scores_gemma":[0.0076471036,0.0007446699,0.001088694,0.0025669448,0.0008105762,0.004777224,0.0047584395,0.0025586672,0.3657523],"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.00031770015,0.00018726551,0.0011803092,0.0005769278,0.000047217047,0.0003958787,0.00022290285,0.0014651564,0.0044335425,0.03158311,0.5536683,0.4059217],"study_design_scores_gemma":[0.000037839447,0.00006837041,0.0005566586,0.000092660375,0.000015715628,0.00033430717,0.000067908055,0.0025544625,0.0014674165,0.006403565,0.98837143,0.000029599067],"about_ca_topic_score_codex":0.0025439046,"about_ca_topic_score_gemma":0.002365182,"teacher_disagreement_score":0.43698528,"about_ca_system_score_codex":0.001657968,"about_ca_system_score_gemma":0.0026578244,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24076144,0.00081017305,0.74074864,0.00095674075,0.00032201357,0.00013333702,0.00082189933,0.0003848944,0.015060759],"genre_scores_gemma":[0.9275707,0.0006721385,0.056429736,0.00021907873,0.00030911586,0.00015530623,0.00062005984,0.0002487834,0.013775153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942786,0.00007233987,0.000030886742,0.00008670377,0.00016267548,0.00021954061],"domain_scores_gemma":[0.9991703,0.00015332935,0.00023977144,0.00008967947,0.00020206728,0.00014490665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008754619,0.00096315914,0.0006622091,0.0012401456,0.00043723357,0.0011058842,0.0012193867,0.0006696449,0.005332324],"category_scores_gemma":[0.0025688808,0.0003224866,0.0010532261,0.00096340734,0.0008282658,0.0010703524,0.001198029,0.001288204,0.00096888887],"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.0004289184,0.00026365666,0.01197644,0.00032073134,0.00007362933,0.002595282,0.000608517,0.40341127,0.025154216,0.469929,0.010640488,0.07459787],"study_design_scores_gemma":[0.000014117754,0.000099232486,0.0038598375,0.00002608325,0.000026256706,0.0003346785,0.0001901897,0.92427325,0.0027612085,0.06498289,0.0033904128,0.000041806397],"about_ca_topic_score_codex":0.006438901,"about_ca_topic_score_gemma":0.0024801453,"teacher_disagreement_score":0.006438901,"about_ca_system_score_codex":0.0011810625,"about_ca_system_score_gemma":0.0010216039,"threshold_uncertainty_score":0.017838418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8763575,0.0003805445,0.12047568,0.00044852743,0.00003702607,0.00006433476,0.00097478967,0.0006078828,0.0006536406],"genre_scores_gemma":[0.98556745,0.00013777774,0.012541278,0.000031613115,0.000016628403,0.00003011681,0.0012696258,0.000023107925,0.00038229808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994462,0.00018796299,0.000026592545,0.00013882684,0.00012208667,0.00007824195],"domain_scores_gemma":[0.9938904,0.004634424,0.00039993372,0.00032976698,0.00055004604,0.00019545837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025710845,0.0006487991,0.00057625875,0.0015673729,0.00038315204,0.0010060889,0.0010813706,0.0010410502,0.000748657],"category_scores_gemma":[0.009682901,0.00057836814,0.0007288574,0.0011738597,0.0005104912,0.0017150538,0.00058597815,0.0015339194,0.0002515657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016735888,0.00010334525,0.016292281,0.000024565245,0.000039622948,0.000032618696,0.00006540743,0.96722007,0.00056138425,0.0022549883,0.0008258975,0.012412286],"study_design_scores_gemma":[0.0000019717847,0.0000064081514,0.0011103922,0.0000011777298,0.0000017483777,0.0000032902042,0.0000057779694,0.99804544,0.00010467976,0.00067546417,0.000039948794,0.0000036483934],"about_ca_topic_score_codex":0.025032436,"about_ca_topic_score_gemma":0.019269234,"teacher_disagreement_score":0.025032436,"about_ca_system_score_codex":0.0019289384,"about_ca_system_score_gemma":0.0006280063,"threshold_uncertainty_score":0.049773455},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25199407,0.0016893,0.7325701,0.0031213094,0.00011780799,0.000070732174,0.000098198616,0.00013711488,0.010201428],"genre_scores_gemma":[0.98394793,0.00061630533,0.013837881,0.00010866284,0.00009712498,0.000021026375,0.000016686441,0.000015159396,0.0013391416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932563,0.000274138,0.000024499941,0.00009466676,0.00010252271,0.0001784561],"domain_scores_gemma":[0.9980578,0.0012687384,0.00027558987,0.00007886263,0.00017464213,0.00014440117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013897311,0.00047647886,0.0007038926,0.00064083317,0.0009326378,0.001638006,0.0012349548,0.0015093675,0.0021284483],"category_scores_gemma":[0.004858826,0.00040439607,0.00057693745,0.00072260154,0.0015936308,0.0028744503,0.0009328595,0.001006648,0.000091476555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065793225,0.0001042293,0.0038527788,0.000102628444,0.00006841876,0.0002454306,0.00038317096,0.67717576,0.004621523,0.2996271,0.0010510496,0.012702118],"study_design_scores_gemma":[0.000013195137,0.0000656286,0.0009674981,0.0000104623805,0.000022880813,0.000041821433,0.00014966393,0.93597317,0.00022670504,0.061951753,0.0005602614,0.000016976468],"about_ca_topic_score_codex":0.0120709855,"about_ca_topic_score_gemma":0.007738401,"teacher_disagreement_score":0.0120709855,"about_ca_system_score_codex":0.0024985168,"about_ca_system_score_gemma":0.0013777602,"threshold_uncertainty_score":0.02400142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5404763,0.0010401245,0.44259053,0.0011740221,0.0000896633,0.0000926689,0.00025875427,0.00037714,0.01390073],"genre_scores_gemma":[0.97950476,0.00024652822,0.017896337,0.00007196651,0.00003196697,0.000040245814,0.0000969281,0.00006290868,0.0020483206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996903,0.00007904904,0.0000112567395,0.00003834834,0.0000820823,0.00009899561],"domain_scores_gemma":[0.99757224,0.00156108,0.00035124837,0.00008341961,0.00031139795,0.000120536206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014323129,0.0004658059,0.0005633826,0.0010635082,0.00059400557,0.001303176,0.0010334118,0.0008850313,0.0033597958],"category_scores_gemma":[0.0069456603,0.00034684467,0.0004913187,0.00087000796,0.0012707642,0.0011751944,0.0007438464,0.0010256617,0.0002527141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014015906,0.00012095264,0.0071851625,0.00016428517,0.000051066305,0.0010624963,0.0005210775,0.75417733,0.008462349,0.21091917,0.002891105,0.014304867],"study_design_scores_gemma":[0.000008793907,0.000010128532,0.0006944655,0.00000893286,0.0000043491295,0.00010268131,0.00011415733,0.98536575,0.00042117908,0.012994105,0.00026361577,0.000011695721],"about_ca_topic_score_codex":0.004510146,"about_ca_topic_score_gemma":0.00311109,"teacher_disagreement_score":0.004510146,"about_ca_system_score_codex":0.0015175547,"about_ca_system_score_gemma":0.0011414743,"threshold_uncertainty_score":0.011239648},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012890169,0.00006009969,0.9967784,0.00005486033,0.0000538404,0.000021682095,0.000038492493,0.0012339073,0.00046973556],"genre_scores_gemma":[0.095556386,0.00017170708,0.89914274,0.00017627171,0.000128926,0.00028016476,0.00036994572,0.00091182947,0.003262108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879944,0.00035334507,0.000073389805,0.00024208326,0.00041698912,0.00011483705],"domain_scores_gemma":[0.9976877,0.0012741958,0.00010892897,0.00027185472,0.0005683446,0.0000889675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00218887,0.0012437085,0.0013817587,0.0010731826,0.0010326869,0.0020875153,0.0029101297,0.0016406844,0.0066448264],"category_scores_gemma":[0.008602435,0.0008137643,0.0013959941,0.0013032735,0.00091339974,0.0027674905,0.0028550772,0.0030556298,0.0026411342],"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.00051160966,0.00015148285,0.00066411344,0.00021903834,0.00015261039,0.00009131668,0.00020857278,0.394556,0.007586623,0.103096515,0.016627531,0.47613454],"study_design_scores_gemma":[0.000027199902,0.000021972517,0.000033018965,0.000008652734,0.0000061002565,0.000016383325,0.000005722359,0.9679101,0.0009935672,0.029463554,0.0015059109,0.000007765312],"about_ca_topic_score_codex":0.0026546244,"about_ca_topic_score_gemma":0.0023154907,"teacher_disagreement_score":0.0066448264,"about_ca_system_score_codex":0.0011900358,"about_ca_system_score_gemma":0.002797549,"threshold_uncertainty_score":0.022229135},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014135088,0.00082257367,0.9794159,0.00083254144,0.00019596638,0.00007583481,0.000032225704,0.0000952438,0.004394647],"genre_scores_gemma":[0.9022818,0.0013563795,0.0899405,0.000388848,0.00033206274,0.00014962646,0.000059146896,0.000093299845,0.0053983703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981559,0.000762125,0.000067216795,0.00024914692,0.00046650987,0.00029903074],"domain_scores_gemma":[0.9973265,0.0018388784,0.00024669705,0.00012685962,0.00033977022,0.00012129272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032039448,0.0017182367,0.0015126106,0.00072008825,0.0006126912,0.0022301832,0.0020506147,0.0018217649,0.0030610033],"category_scores_gemma":[0.0064498135,0.0009418609,0.0011985353,0.0010858378,0.0017606608,0.0035176473,0.0011971188,0.0028232718,0.0002667374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012469568,0.00013817765,0.00023650107,0.00011941743,0.00006618933,0.000108234526,0.000084034036,0.84637916,0.0017759486,0.1340842,0.0021276749,0.014755721],"study_design_scores_gemma":[0.000012074993,0.000027548436,0.000040692597,0.0000053106746,0.0000069434222,0.000010069934,0.00000948373,0.9864178,0.00021289212,0.012794016,0.0004536666,0.000009501546],"about_ca_topic_score_codex":0.005450836,"about_ca_topic_score_gemma":0.004170676,"teacher_disagreement_score":0.005450836,"about_ca_system_score_codex":0.003036146,"about_ca_system_score_gemma":0.0020724926,"threshold_uncertainty_score":0.022028863},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18647525,0.00035502572,0.8063887,0.0019365419,0.0002146071,0.00011923721,0.00016814483,0.0005073865,0.0038351612],"genre_scores_gemma":[0.9648576,0.00014604176,0.031388536,0.00016910746,0.00013257949,0.000040300485,0.00006985569,0.000092071896,0.0031037827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98868793,0.003444346,0.0007436992,0.001701567,0.004026962,0.0013954198],"domain_scores_gemma":[0.87124234,0.095669195,0.0067926156,0.014414169,0.009248637,0.002632997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014898039,0.0007391336,0.002236982,0.0018945164,0.0024628278,0.006151548,0.0050302916,0.0034668453,0.0048161177],"category_scores_gemma":[0.11404602,0.0014518941,0.0009591495,0.0040798117,0.00290579,0.010294537,0.004571492,0.0038318518,0.00047962996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001283227,0.00044364354,0.012694905,0.00018405823,0.00018872958,0.00091861933,0.0014518406,0.5560339,0.0055575976,0.36420897,0.0037873797,0.05324713],"study_design_scores_gemma":[0.00002854028,0.000057708177,0.00051140686,0.000008278389,0.00003244253,0.00011915237,0.00006932112,0.9376948,0.001188348,0.059906967,0.0003529281,0.00003016476],"about_ca_topic_score_codex":0.007405166,"about_ca_topic_score_gemma":0.0038444535,"teacher_disagreement_score":0.014898039,"about_ca_system_score_codex":0.003951284,"about_ca_system_score_gemma":0.005375726,"threshold_uncertainty_score":0.07878935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91877794,0.000581179,0.04261566,0.0065131905,0.00017487159,0.000056882996,0.00005929146,0.000036654517,0.031184226],"genre_scores_gemma":[0.9940737,0.00015145181,0.0025287,0.00015092842,0.000057011766,0.00001813847,0.000009609246,0.000008280704,0.0030021141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982855,0.0006355823,0.00006742565,0.00022043682,0.00029838787,0.0004926523],"domain_scores_gemma":[0.9911567,0.005504265,0.0008730662,0.0005771595,0.00050943496,0.0013793819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040236455,0.00036004765,0.0006647966,0.0004573338,0.0010528102,0.0042136805,0.0018828607,0.0018102609,0.019247081],"category_scores_gemma":[0.0143045075,0.0002849569,0.00053553877,0.0005876662,0.002246731,0.00827966,0.003619026,0.0016984353,0.00051439955],"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.0009508442,0.00084804936,0.019687245,0.00016664497,0.000052464427,0.0008403062,0.0026975793,0.032012448,0.0015374486,0.81692237,0.003661825,0.1206228],"study_design_scores_gemma":[0.00015120159,0.00072625716,0.01563113,0.00023330953,0.00006794636,0.0002545418,0.0112391515,0.19097467,0.00095797674,0.7728871,0.0067954436,0.00008122791],"about_ca_topic_score_codex":0.0030458812,"about_ca_topic_score_gemma":0.0031474212,"teacher_disagreement_score":0.019247081,"about_ca_system_score_codex":0.001965359,"about_ca_system_score_gemma":0.0011752811,"threshold_uncertainty_score":0.06438792},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42382663,0.00093941233,0.56279427,0.0007354258,0.00017217758,0.00010338365,0.000108293694,0.0007283633,0.010592066],"genre_scores_gemma":[0.98245806,0.00025568632,0.015403641,0.00006309619,0.000061024533,0.000028331453,0.000028704479,0.000033775952,0.0016677408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924964,0.00014429372,0.000035763598,0.00014438595,0.00023838297,0.00018755558],"domain_scores_gemma":[0.9984086,0.0007606843,0.00022083688,0.00019536613,0.00030970675,0.000104887265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012844605,0.00039520636,0.00046627637,0.00054762413,0.0009429667,0.0010829009,0.0010594547,0.00059236574,0.0019679966],"category_scores_gemma":[0.0059393574,0.0003668937,0.0003880393,0.000519621,0.0008526747,0.0021507046,0.0007915602,0.0007428387,0.0002702044],"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.00051296124,0.00019155296,0.0045127315,0.00012889603,0.00004759848,0.00027474333,0.00058419665,0.6599346,0.028829316,0.25836703,0.002477985,0.044138413],"study_design_scores_gemma":[0.000026695003,0.00004434584,0.00031459183,0.0000052222904,0.00000985022,0.000043201857,0.000037172602,0.96110046,0.0018702365,0.035750497,0.00078257004,0.000015226637],"about_ca_topic_score_codex":0.0031988975,"about_ca_topic_score_gemma":0.0016513742,"teacher_disagreement_score":0.0031988975,"about_ca_system_score_codex":0.0011377026,"about_ca_system_score_gemma":0.0008902284,"threshold_uncertainty_score":0.008254647},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36538404,0.002023148,0.21965417,0.0053561246,0.0015260703,0.0105050905,0.16808926,0.098136924,0.12932512],"genre_scores_gemma":[0.4248909,0.0012454832,0.46263495,0.000798495,0.0002838885,0.0116073815,0.046269346,0.004848055,0.047421474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996696,0.0016859279,0.0005115052,0.0003878281,0.00055787445,0.00016094363],"domain_scores_gemma":[0.98172796,0.012592213,0.0018990615,0.0011097481,0.0016335422,0.0010375557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056256647,0.0008593467,0.00077051675,0.0072570113,0.0008212203,0.002298744,0.0012858086,0.00057159155,0.07806032],"category_scores_gemma":[0.035425637,0.0005415027,0.0009427686,0.0049361745,0.00033536085,0.003329557,0.0033411519,0.0009349982,0.0116134975],"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.0011124647,0.00060116535,0.10467144,0.0019345654,0.00017115526,0.0004147529,0.0077106818,0.0016402997,0.0013907455,0.0038358686,0.12692419,0.7495927],"study_design_scores_gemma":[0.00073622976,0.0013513007,0.29993647,0.0024686586,0.00039038327,0.0012472771,0.013196235,0.03361822,0.0049921996,0.013654995,0.6279206,0.00048740773],"about_ca_topic_score_codex":0.006294601,"about_ca_topic_score_gemma":0.012712028,"teacher_disagreement_score":0.07806032,"about_ca_system_score_codex":0.00087240746,"about_ca_system_score_gemma":0.0014119665,"threshold_uncertainty_score":0.26113784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7824343,0.0002853911,0.20946464,0.0013420504,0.00009777265,0.00007255502,0.00016036924,0.00028092338,0.005861936],"genre_scores_gemma":[0.9963775,0.00005115775,0.0018029808,0.00003539595,0.000022443637,0.000018374089,0.000022405848,0.000008358356,0.0016613472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986469,0.00031506317,0.000059078488,0.00026420463,0.00028286988,0.00043192008],"domain_scores_gemma":[0.996268,0.0018549532,0.000861342,0.00019395568,0.00050352846,0.0003181502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016602294,0.00060545304,0.0011646593,0.00074720825,0.00096704904,0.0026332429,0.0013779078,0.001552407,0.0024127157],"category_scores_gemma":[0.0066098957,0.00043481015,0.0005706798,0.00077147706,0.0016135926,0.0016528876,0.0013718219,0.0015090205,0.00026755602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021871223,0.00015663546,0.005423701,0.000053463827,0.00008318093,0.0009094066,0.0003771987,0.9084182,0.00499695,0.071050584,0.00067191594,0.007640037],"study_design_scores_gemma":[0.000010250711,0.000019378922,0.00043549694,0.0000036421918,0.000009489493,0.00003349559,0.000050006147,0.99110913,0.00029939887,0.00784148,0.00017877005,0.000009459731],"about_ca_topic_score_codex":0.014344688,"about_ca_topic_score_gemma":0.005793552,"teacher_disagreement_score":0.014344688,"about_ca_system_score_codex":0.0025018074,"about_ca_system_score_gemma":0.0010824343,"threshold_uncertainty_score":0.028522372},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106415555,0.000982515,0.88265914,0.0012293473,0.00012684969,0.00011906428,0.00031447495,0.0003986361,0.00775444],"genre_scores_gemma":[0.89978653,0.0007149326,0.08656777,0.00015983895,0.00009641944,0.00019074944,0.00023074653,0.00022617087,0.01202689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998804,0.000435202,0.00004030901,0.00023378877,0.00022776188,0.00025895363],"domain_scores_gemma":[0.9976521,0.001476337,0.0003048628,0.0000915778,0.00024911715,0.0002260638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023269753,0.00089287414,0.001481379,0.00063483993,0.0007238459,0.0020468545,0.0015916729,0.0016466641,0.0055872225],"category_scores_gemma":[0.005935142,0.0007896695,0.0010651934,0.00073122076,0.0008812635,0.0011697013,0.0011444684,0.0014500997,0.0004890409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042111777,0.000014075443,0.00035038954,0.00003081827,0.000010856203,0.000016080732,0.00002590594,0.99075127,0.0004926146,0.003547246,0.0003260668,0.004392509],"study_design_scores_gemma":[0.000006241143,0.000022232729,0.00032129994,0.000007696288,0.0000056719437,0.000007823289,0.00001737163,0.9969893,0.0002060611,0.002062759,0.0003471218,0.0000063902694],"about_ca_topic_score_codex":0.01495479,"about_ca_topic_score_gemma":0.011033897,"teacher_disagreement_score":0.01495479,"about_ca_system_score_codex":0.0032694065,"about_ca_system_score_gemma":0.0020785064,"threshold_uncertainty_score":0.029735446},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051245995,0.0008111132,0.9386794,0.0020560245,0.00014190606,0.00023682984,0.00035111574,0.00011401972,0.006363517],"genre_scores_gemma":[0.7474507,0.0012990615,0.224106,0.00076020765,0.000381128,0.00073734426,0.0006841885,0.00022409376,0.024357345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950565,0.0028784948,0.00015616589,0.000710001,0.0006279624,0.0005708199],"domain_scores_gemma":[0.9671474,0.029155277,0.0013446648,0.0004184693,0.00091039255,0.0010238967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010812914,0.0015811048,0.004320799,0.0017264459,0.0012364208,0.0038100807,0.003547112,0.004184352,0.0070842225],"category_scores_gemma":[0.031514097,0.0034219055,0.0024680265,0.002397424,0.0042245467,0.0045182332,0.004077493,0.003569503,0.00031946847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013252461,0.0001074197,0.0006958524,0.000116396666,0.00005993501,0.00013162202,0.000077263474,0.9114759,0.0003218336,0.08355407,0.0006220768,0.0027051165],"study_design_scores_gemma":[0.000022464212,0.000026759011,0.00012659696,0.0000097704915,0.000011604439,0.000012366369,0.000011496193,0.98500603,0.00006178334,0.014547201,0.00015400407,0.000009800336],"about_ca_topic_score_codex":0.025871368,"about_ca_topic_score_gemma":0.017598543,"teacher_disagreement_score":0.025871368,"about_ca_system_score_codex":0.0051913452,"about_ca_system_score_gemma":0.0043031597,"threshold_uncertainty_score":0.057184815},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5233244,0.0022141684,0.45749873,0.0025092496,0.00025874554,0.00010384544,0.00047674443,0.00043135343,0.013182765],"genre_scores_gemma":[0.97880405,0.00036703187,0.017065354,0.00016175574,0.00006646506,0.000022294113,0.00009678092,0.000031860738,0.0033843773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980265,0.000038387123,0.000005880891,0.000041273015,0.000054117794,0.000057767582],"domain_scores_gemma":[0.9995758,0.0001741727,0.0000941368,0.00003508017,0.000077714394,0.000043115208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006273758,0.00033031896,0.000408604,0.00036892924,0.00044834617,0.0013323709,0.0011693531,0.0007283505,0.0021426925],"category_scores_gemma":[0.0020984614,0.00019856553,0.0002921534,0.0004969164,0.00066833856,0.0011909287,0.00057631696,0.0009043942,0.00019626833],"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.00021295741,0.00008225388,0.0036282043,0.00014121487,0.00003439791,0.0007773191,0.00023138727,0.5080111,0.014122004,0.44908032,0.004298194,0.019380623],"study_design_scores_gemma":[0.000016736976,0.000031051117,0.00050255004,0.00000833287,0.000008227373,0.000095339,0.000028810196,0.9720838,0.0009444451,0.025410052,0.0008583007,0.000012306177],"about_ca_topic_score_codex":0.009546013,"about_ca_topic_score_gemma":0.0065137055,"teacher_disagreement_score":0.009546013,"about_ca_system_score_codex":0.0018937214,"about_ca_system_score_gemma":0.0014419607,"threshold_uncertainty_score":0.01898092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36721107,0.00029710578,0.62659353,0.0004950467,0.00006492776,0.00015668054,0.00015656256,0.00041583774,0.0046092058],"genre_scores_gemma":[0.9806748,0.000070828326,0.018359274,0.0000308706,0.0000075547114,0.00003662445,0.000039457973,0.000023794126,0.0007567493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853265,0.0005748147,0.00007415864,0.00019650676,0.00021131171,0.0004105732],"domain_scores_gemma":[0.9917344,0.0057246597,0.001084057,0.00024722767,0.00070580473,0.00050388195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031236766,0.000642473,0.0012599521,0.0007483296,0.00067863823,0.001915166,0.00093363086,0.0009828612,0.003089677],"category_scores_gemma":[0.009178096,0.00067638705,0.00039820018,0.00063200464,0.0015566658,0.0015115378,0.00082447584,0.0010212901,0.00022583519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046427325,0.000028080083,0.00020365661,0.000011753115,0.0000065641793,0.000016814638,0.000020060601,0.9897425,0.00037140335,0.007833521,0.00012966317,0.0015895447],"study_design_scores_gemma":[0.000008636112,0.000011271931,0.000045180437,0.0000019422314,0.0000017544858,0.0000022709364,0.000007878913,0.99689806,0.00015555124,0.002811531,0.000053096945,0.000002769665],"about_ca_topic_score_codex":0.012314025,"about_ca_topic_score_gemma":0.0056644212,"teacher_disagreement_score":0.012314025,"about_ca_system_score_codex":0.0034097333,"about_ca_system_score_gemma":0.0033710697,"threshold_uncertainty_score":0.024739444},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14806993,0.0024277857,0.7578216,0.021983592,0.00050183304,0.00021586574,0.00021746814,0.0004931029,0.06826884],"genre_scores_gemma":[0.97494316,0.0005518221,0.014844374,0.0003773356,0.00023378656,0.000046031702,0.00005186759,0.000035897836,0.008915602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920813,0.0040602097,0.00032010904,0.0006192524,0.0018402269,0.0010788721],"domain_scores_gemma":[0.9805386,0.0126155615,0.0012449496,0.0025491961,0.002215234,0.00083633757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007872158,0.00038034745,0.00091739564,0.0011566184,0.0026778409,0.007829108,0.0011902427,0.0026330396,0.0059640165],"category_scores_gemma":[0.026231863,0.0005339032,0.00093891675,0.0018182963,0.003841228,0.007985392,0.002862594,0.0036456753,0.0006806773],"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.00008819287,0.00005429738,0.0014415034,0.000057163972,0.000028257658,0.00011675816,0.0005176874,0.021604517,0.000491822,0.9533261,0.003038725,0.019234946],"study_design_scores_gemma":[0.000020432284,0.000057420606,0.00057529385,0.0000324986,0.000026648187,0.00012084578,0.0003651582,0.1962974,0.00084014103,0.79546267,0.0061806254,0.00002083454],"about_ca_topic_score_codex":0.003888266,"about_ca_topic_score_gemma":0.0021186925,"teacher_disagreement_score":0.007872158,"about_ca_system_score_codex":0.0042906334,"about_ca_system_score_gemma":0.0044463086,"threshold_uncertainty_score":0.041632473},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4125424,0.00049605797,0.5770143,0.0017804054,0.0002038497,0.000077463206,0.00020964393,0.00040064644,0.0072752535],"genre_scores_gemma":[0.99238354,0.00010643958,0.004134213,0.0000444812,0.000026477932,0.000022956845,0.0000306555,0.000020468793,0.0032307354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946934,0.00017565637,0.000016816764,0.00015006255,0.000060679053,0.00012757075],"domain_scores_gemma":[0.99428743,0.003822845,0.00079573214,0.00013809552,0.0006452651,0.00031066456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018337021,0.00057178666,0.0010658599,0.0006945298,0.00066486915,0.0014090515,0.001108293,0.0012704434,0.0026210644],"category_scores_gemma":[0.0089848,0.00058032176,0.0004879311,0.00052227906,0.0012939114,0.0012166447,0.0010791838,0.00096160447,0.00021528969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002777467,0.000053061638,0.00085793977,0.000048182086,0.000036544632,0.00009733764,0.00009966255,0.9637306,0.004328655,0.025014525,0.00088470866,0.0045710555],"study_design_scores_gemma":[0.000011502333,0.000026172986,0.0001450698,0.00000255816,0.000006346494,0.0000050640033,0.000016885886,0.99639446,0.00024621046,0.0030549986,0.000086565255,0.0000042006045],"about_ca_topic_score_codex":0.0075455736,"about_ca_topic_score_gemma":0.0043216217,"teacher_disagreement_score":0.0075455736,"about_ca_system_score_codex":0.0023115561,"about_ca_system_score_gemma":0.0012386687,"threshold_uncertainty_score":0.016771615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11593892,0.0013947525,0.8702474,0.0016443506,0.00018309163,0.00018888646,0.0003017718,0.00029659923,0.0098042125],"genre_scores_gemma":[0.96878314,0.0008519313,0.021757327,0.0002245226,0.00014884089,0.00015579733,0.00019983397,0.000068933325,0.0078096977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990845,0.00027275115,0.000039491322,0.00013037128,0.00025440982,0.00021846661],"domain_scores_gemma":[0.99749494,0.0014869036,0.00028641414,0.000086518994,0.0004891688,0.00015601024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002372018,0.0009369454,0.0012715487,0.0007585659,0.0008821754,0.0018313775,0.0015013709,0.0016692327,0.0027073373],"category_scores_gemma":[0.0051144133,0.00053977204,0.0011488178,0.00060149905,0.0013329808,0.0016217999,0.0011083215,0.0015667165,0.0002802131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005406432,0.000056967107,0.00079845486,0.000066726476,0.00004183931,0.00020255985,0.00015547087,0.89938307,0.0023331211,0.09381993,0.00089294877,0.0021947115],"study_design_scores_gemma":[0.0000038615585,0.0000071363397,0.00007200317,0.0000028466234,0.000004462367,0.0000075352914,0.000010433639,0.9967968,0.00006858132,0.0029094168,0.00011282857,0.000004152816],"about_ca_topic_score_codex":0.020059966,"about_ca_topic_score_gemma":0.007772748,"teacher_disagreement_score":0.020059966,"about_ca_system_score_codex":0.003706661,"about_ca_system_score_gemma":0.00300067,"threshold_uncertainty_score":0.039886415},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13714778,0.0002790645,0.8396651,0.0007164106,0.00007249825,0.00012304467,0.00014756013,0.00010927957,0.021739317],"genre_scores_gemma":[0.97868997,0.000100610596,0.017462913,0.000046340647,0.000019490195,0.000054691536,0.000045001205,0.000011000583,0.0035699077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992793,0.00021881305,0.000031479,0.00015165469,0.00017877661,0.00013997198],"domain_scores_gemma":[0.99861383,0.0007428338,0.00022273148,0.00009261368,0.00025232453,0.000075586635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011584036,0.0006235027,0.0005922435,0.0003788325,0.0004191595,0.0012561543,0.0009041607,0.00086314185,0.003608095],"category_scores_gemma":[0.0031127778,0.0003738751,0.00031432108,0.00039934195,0.001180945,0.0013220481,0.0010273345,0.0007169351,0.00024104494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017560626,0.0000628561,0.00041213335,0.00008790756,0.0000303655,0.00010910255,0.00009868041,0.84201956,0.0026831422,0.1364197,0.0009945984,0.016906366],"study_design_scores_gemma":[0.000023841905,0.00006219239,0.0001380953,0.000009186711,0.0000073266533,0.000015452326,0.000020076628,0.96153486,0.00061312394,0.0371245,0.0004430052,0.000008303991],"about_ca_topic_score_codex":0.0038435075,"about_ca_topic_score_gemma":0.0020187881,"teacher_disagreement_score":0.0038435075,"about_ca_system_score_codex":0.0015654213,"about_ca_system_score_gemma":0.0012005108,"threshold_uncertainty_score":0.012070298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61139077,0.0002843633,0.378137,0.0006910546,0.00009024141,0.0001473434,0.00025679346,0.00022740931,0.008775014],"genre_scores_gemma":[0.98749524,0.00008893191,0.008280197,0.000052621166,0.000017111735,0.00004556302,0.000072051276,0.000017729073,0.0039306576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841046,0.0004430203,0.00006416241,0.00036072056,0.000217828,0.00050384935],"domain_scores_gemma":[0.99647945,0.0018214518,0.00051293505,0.00020786501,0.000530478,0.00044786112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017896172,0.000756431,0.0011829241,0.0006722154,0.00096254353,0.0018978366,0.0015287655,0.0017034442,0.0036134373],"category_scores_gemma":[0.0054112175,0.0005205356,0.0008933751,0.00057269586,0.001345274,0.0018634027,0.0015048684,0.0012897791,0.00041088104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042726423,0.00025052592,0.0049086725,0.000109481225,0.0001254732,0.0010378961,0.0005261016,0.808439,0.013048848,0.16381392,0.0014232189,0.0058895615],"study_design_scores_gemma":[0.000023649594,0.0000435934,0.0003095361,0.000004977969,0.00001359274,0.000051994262,0.000075149364,0.9908524,0.00051686086,0.0079062525,0.00018750674,0.000014537641],"about_ca_topic_score_codex":0.006906438,"about_ca_topic_score_gemma":0.0029842004,"teacher_disagreement_score":0.006906438,"about_ca_system_score_codex":0.0022090403,"about_ca_system_score_gemma":0.001545027,"threshold_uncertainty_score":0.016027749},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020146675,0.00007077826,0.9893504,0.00094945234,0.00014777506,0.000056670415,0.000042354335,0.00031859285,0.0070494087],"genre_scores_gemma":[0.121551126,0.0002540501,0.8588879,0.00085290096,0.00041491986,0.00029647836,0.000086405285,0.00066576584,0.016990477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951662,0.002042031,0.00025297015,0.00069346954,0.0014763974,0.000368979],"domain_scores_gemma":[0.9959837,0.0016769598,0.00022413307,0.001106241,0.0007975802,0.00021134494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043697054,0.0010563914,0.0013889167,0.0018811828,0.0027885018,0.0051457225,0.0038697328,0.0025914565,0.010134262],"category_scores_gemma":[0.01697392,0.00091558887,0.0013803651,0.0018812338,0.005362843,0.009175377,0.0061092335,0.0070781945,0.0032159889],"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.000008509969,0.000016183836,0.00007787675,0.000017740409,0.00000458678,0.000032321015,0.00012564543,0.0041516763,0.0003766044,0.9869824,0.0015703357,0.0066360496],"study_design_scores_gemma":[0.000018353176,0.000018548862,0.000058840273,0.000018174977,0.000008907118,0.000057867077,0.00008949407,0.14360678,0.000645867,0.84184074,0.013606646,0.000029751533],"about_ca_topic_score_codex":0.005708754,"about_ca_topic_score_gemma":0.006685909,"teacher_disagreement_score":0.010134262,"about_ca_system_score_codex":0.0030211734,"about_ca_system_score_gemma":0.0049595004,"threshold_uncertainty_score":0.033902466},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0862587,0.0030660764,0.8753328,0.0037696126,0.0005476548,0.00018829198,0.00061773986,0.00037132428,0.029847788],"genre_scores_gemma":[0.9013972,0.0022954878,0.06517903,0.00075724086,0.0004504287,0.00031452786,0.00068080385,0.0002730782,0.02865208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837744,0.00066694047,0.000051406172,0.00017135113,0.0003076377,0.00042516945],"domain_scores_gemma":[0.9879782,0.009120266,0.00063114736,0.0003393227,0.001157586,0.0007734388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042274385,0.0018976758,0.0033381933,0.0022944259,0.0015993044,0.0041996427,0.0057562967,0.004450171,0.007189845],"category_scores_gemma":[0.021905242,0.0013152112,0.0021783207,0.0022343295,0.0030354809,0.0054684347,0.0027547167,0.0044551212,0.0008201919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007113822,0.0000689738,0.0004245859,0.00007829707,0.000031515898,0.00010337923,0.00013218106,0.8450196,0.0002332319,0.14933756,0.0022768944,0.002222774],"study_design_scores_gemma":[0.000008554567,0.000005574378,0.000039291273,0.000007520513,0.0000072289317,0.0000074085383,0.000020399057,0.98493063,0.000014163094,0.014782879,0.00017059507,0.0000057463167],"about_ca_topic_score_codex":0.041226607,"about_ca_topic_score_gemma":0.020184914,"teacher_disagreement_score":0.041226607,"about_ca_system_score_codex":0.006168314,"about_ca_system_score_gemma":0.005750822,"threshold_uncertainty_score":0.081973255},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0105291,0.00039965275,0.9819717,0.0009618568,0.00019932417,0.00009772816,0.000085778396,0.00011912398,0.0056358026],"genre_scores_gemma":[0.75969416,0.0017992893,0.19665883,0.00081946084,0.0012126886,0.0007007128,0.00017655028,0.00029743364,0.038640864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928126,0.0026208898,0.0002595624,0.0011064337,0.0020050476,0.0011954966],"domain_scores_gemma":[0.98775196,0.0074994136,0.0010743116,0.0007747213,0.0019120049,0.0009875225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010020446,0.0020881281,0.0030709857,0.004001523,0.0022804986,0.0057656127,0.0069153,0.003620445,0.008036619],"category_scores_gemma":[0.02993922,0.0018597338,0.0029945683,0.003801636,0.00536028,0.008919402,0.004970561,0.0054342006,0.00089965377],"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.000047650337,0.00011382812,0.0008250972,0.00011021727,0.00006047615,0.00011861236,0.00046142444,0.38152042,0.00052693085,0.5926778,0.0021062496,0.021431347],"study_design_scores_gemma":[0.0000082863,0.0000594372,0.00026141995,0.000033385986,0.000030668125,0.000037540955,0.00011472116,0.8175393,0.0001646326,0.18032776,0.0013757773,0.00004712954],"about_ca_topic_score_codex":0.009331447,"about_ca_topic_score_gemma":0.006585868,"teacher_disagreement_score":0.010020446,"about_ca_system_score_codex":0.005794335,"about_ca_system_score_gemma":0.0059274323,"threshold_uncertainty_score":0.052993834},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47707447,0.0017299782,0.4915368,0.0071767997,0.0005585575,0.00030612192,0.0004974501,0.00074538705,0.020374466],"genre_scores_gemma":[0.9816458,0.0004937832,0.006547432,0.0002239389,0.00022737998,0.000075724005,0.00010530546,0.000086077576,0.010594526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98957235,0.0037567306,0.0005085901,0.0014876085,0.0011518085,0.0035229642],"domain_scores_gemma":[0.9493348,0.035018012,0.0054011247,0.0023398483,0.003774536,0.004131655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014951881,0.002470192,0.00746214,0.0025683432,0.0032118082,0.010851212,0.007235188,0.0075930315,0.008909464],"category_scores_gemma":[0.0566839,0.0036458327,0.0036554919,0.0035773488,0.009339662,0.012071037,0.004815878,0.007830994,0.00094869407],"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.0006515519,0.00029314647,0.003005938,0.00025646485,0.00019424506,0.0012515852,0.000946117,0.3850449,0.0017079754,0.5956744,0.0030546144,0.007919135],"study_design_scores_gemma":[0.000095222924,0.00013290542,0.0006142906,0.000024254501,0.00008683179,0.00019915822,0.00026448997,0.8359402,0.00020999982,0.16196701,0.00037837858,0.00008723402],"about_ca_topic_score_codex":0.016027652,"about_ca_topic_score_gemma":0.0077287923,"teacher_disagreement_score":0.016027652,"about_ca_system_score_codex":0.007701213,"about_ca_system_score_gemma":0.004795745,"threshold_uncertainty_score":0.079074085},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46829268,0.0019014764,0.5072694,0.0029008933,0.0002530251,0.00022408082,0.0006928129,0.0003461469,0.018119434],"genre_scores_gemma":[0.9810674,0.0008126576,0.011486197,0.0001998053,0.0001438814,0.00011046415,0.00014658175,0.000045851422,0.005987183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961344,0.0015902725,0.00013825601,0.00047846508,0.00042751632,0.0012312153],"domain_scores_gemma":[0.9821578,0.012330094,0.0026595541,0.0005321234,0.0011577634,0.00116275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005737616,0.001858917,0.002600614,0.0018273985,0.0016931809,0.0032783397,0.002645802,0.0023783238,0.0041714087],"category_scores_gemma":[0.014359593,0.001053389,0.001610375,0.0016217004,0.0035068463,0.004156299,0.0017294522,0.0025757686,0.0004860703],"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.00029722022,0.00019889398,0.002502844,0.00010398629,0.00008963571,0.00045071926,0.00030308872,0.7894808,0.0013483681,0.20098293,0.000966092,0.0032754862],"study_design_scores_gemma":[0.000039533006,0.00006171074,0.0004669337,0.000014008551,0.000022329566,0.00003095784,0.00007186637,0.96866196,0.00008248192,0.030302621,0.00021610952,0.000029421895],"about_ca_topic_score_codex":0.02895201,"about_ca_topic_score_gemma":0.01618107,"teacher_disagreement_score":0.02895201,"about_ca_system_score_codex":0.005109643,"about_ca_system_score_gemma":0.0033470353,"threshold_uncertainty_score":0.05756694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59988517,0.00020446941,0.3927044,0.00049431465,0.00014076242,0.000101115445,0.00006794049,0.0008600503,0.005541819],"genre_scores_gemma":[0.9908982,0.00003752773,0.0076300446,0.000027848828,0.00002480325,0.000014609698,0.000018008957,0.000026613558,0.0013224471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854517,0.0006475417,0.00007628327,0.00022148406,0.00024747572,0.00026209265],"domain_scores_gemma":[0.9909017,0.006643006,0.0005781104,0.00066742615,0.00063820946,0.0005715507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034622832,0.00055579876,0.0010204867,0.0006331927,0.0007593789,0.0021635909,0.002107967,0.0014069122,0.0034318],"category_scores_gemma":[0.009389303,0.0006386452,0.0004623245,0.00091609417,0.0011750953,0.0019556363,0.0014355212,0.0012633174,0.0003476905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025879713,0.0007611049,0.0049029947,0.00008412063,0.000103257815,0.0005219915,0.00064209296,0.8792125,0.010643149,0.044955242,0.0014078792,0.054177787],"study_design_scores_gemma":[0.00003374973,0.0000796575,0.0002480227,0.0000025499442,0.000023053055,0.000024652254,0.000040797197,0.9948827,0.000605686,0.0038913484,0.00015566418,0.000012117953],"about_ca_topic_score_codex":0.008351334,"about_ca_topic_score_gemma":0.003987598,"teacher_disagreement_score":0.008351334,"about_ca_system_score_codex":0.0012636442,"about_ca_system_score_gemma":0.0018421832,"threshold_uncertainty_score":0.018310547},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012057425,0.00032902125,0.98504215,0.00028918273,0.0000744085,0.000049239017,0.000036145582,0.0005223868,0.0015999448],"genre_scores_gemma":[0.85590094,0.0004008381,0.13970132,0.00033764704,0.00010364897,0.00018379414,0.00008515384,0.000087370296,0.003199253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994733,0.00016619649,0.000026856978,0.00011249301,0.00013930873,0.00008199548],"domain_scores_gemma":[0.9985297,0.00089164556,0.00013928622,0.000066434746,0.00026403085,0.00010889392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016451839,0.00079678727,0.0009186456,0.00040718378,0.00030692937,0.0007193369,0.002071085,0.0009896877,0.0017787726],"category_scores_gemma":[0.0043156263,0.00032490664,0.0004210847,0.00040258616,0.00094167347,0.0008910763,0.00092773844,0.0020671445,0.0002683994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079793084,0.00009870004,0.0006650088,0.000055277913,0.000039457445,0.00003148073,0.000042281474,0.94525605,0.0011489269,0.009569143,0.0010042601,0.04200965],"study_design_scores_gemma":[0.000006843964,0.000017358489,0.00002735944,0.0000017653609,0.0000030410713,0.0000023997757,0.0000011153387,0.9980439,0.00013761685,0.0016361391,0.00012031508,0.0000021763194],"about_ca_topic_score_codex":0.009503297,"about_ca_topic_score_gemma":0.0073023974,"teacher_disagreement_score":0.009503297,"about_ca_system_score_codex":0.00147209,"about_ca_system_score_gemma":0.0018710535,"threshold_uncertainty_score":0.018895984},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15189268,0.0026416578,0.8116319,0.002618829,0.00087612943,0.00019401379,0.00029902247,0.00042547533,0.029420238],"genre_scores_gemma":[0.96441555,0.0012844923,0.017588276,0.00034318015,0.00039167257,0.000086922504,0.00009339415,0.000059532973,0.015736999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965933,0.0012734815,0.00011179519,0.0006081797,0.00069859537,0.0007146157],"domain_scores_gemma":[0.9873394,0.00802739,0.0013744781,0.0013797183,0.0011415137,0.00073762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004615328,0.0013062803,0.0018397463,0.0008106893,0.0014162848,0.005434446,0.003672298,0.0028387764,0.010459379],"category_scores_gemma":[0.016402371,0.0010621414,0.0017639039,0.0015655153,0.0031725997,0.0069073373,0.0025012887,0.0047359397,0.0009432395],"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.00042799898,0.00036797108,0.0023844563,0.00014391443,0.00014518986,0.00041640157,0.00036420475,0.3287557,0.0022560684,0.644291,0.0032460443,0.017201042],"study_design_scores_gemma":[0.00007978087,0.00011254521,0.00045806653,0.000012159741,0.00008074832,0.00011371538,0.00004264693,0.8945241,0.00040286354,0.10275297,0.0013683599,0.000052045965],"about_ca_topic_score_codex":0.005064372,"about_ca_topic_score_gemma":0.003359564,"teacher_disagreement_score":0.010459379,"about_ca_system_score_codex":0.0032523475,"about_ca_system_score_gemma":0.0023215548,"threshold_uncertainty_score":0.03499013},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006186469,0.00005695884,0.9926367,0.000089668254,0.000011367025,0.00006407335,0.00003603934,0.0000902136,0.0008284867],"genre_scores_gemma":[0.3695487,0.0001972198,0.628729,0.0000924943,0.000068120025,0.0004216974,0.00014231473,0.000043009994,0.00075744424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711883,0.0014738644,0.00018082678,0.00032926686,0.0007036542,0.00019361437],"domain_scores_gemma":[0.99334705,0.0049583954,0.0006640586,0.00026567475,0.0005528832,0.00021191256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068204785,0.0015140531,0.0011376917,0.0025306516,0.00069108396,0.0017452245,0.0015860912,0.0013014657,0.0027810743],"category_scores_gemma":[0.013663967,0.0006115131,0.0017264385,0.0017341858,0.00139887,0.0018245201,0.0016412571,0.0021938048,0.00028203486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005444881,0.000054918266,0.0007386598,0.000064441025,0.000048021593,0.000052665404,0.00006848234,0.90804356,0.00053865585,0.055123936,0.000346575,0.03486559],"study_design_scores_gemma":[0.000008252343,0.000045071887,0.000063260515,0.000010734209,0.000006534482,0.000009806902,0.000012486683,0.9824818,0.00015163097,0.01685123,0.00035247003,0.0000068433774],"about_ca_topic_score_codex":0.0036583012,"about_ca_topic_score_gemma":0.0027846922,"teacher_disagreement_score":0.0068204785,"about_ca_system_score_codex":0.0017138068,"about_ca_system_score_gemma":0.0021687422,"threshold_uncertainty_score":0.036070585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74063283,0.0010358073,0.2510985,0.0019226725,0.00014953545,0.00006899987,0.0001978742,0.0005723715,0.0043213624],"genre_scores_gemma":[0.9972988,0.00011250966,0.001883469,0.00007231041,0.00002905018,0.000016203901,0.00003921324,0.000025192052,0.0005233151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819416,0.0009288326,0.000055661432,0.00024960501,0.00024375503,0.0003279854],"domain_scores_gemma":[0.9750241,0.019115902,0.0032195866,0.00085813313,0.0009744945,0.00080775336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056925183,0.0008776844,0.0010431668,0.0015817635,0.00088263955,0.002015373,0.0018083284,0.0017631565,0.001134417],"category_scores_gemma":[0.031498905,0.0007849531,0.0007335327,0.0007944056,0.0026008228,0.0027365154,0.0014756726,0.00178609,0.0001162603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012580545,0.00007955355,0.0033818032,0.000036182417,0.00006115565,0.00014989989,0.000076854354,0.93588734,0.0011311785,0.056940697,0.000616889,0.0015126868],"study_design_scores_gemma":[0.0000060383163,0.0000114603945,0.00034229137,0.000003974913,0.0000056014173,0.000018844716,0.000018698744,0.98981196,0.00013359166,0.009594756,0.000041949454,0.0000107323585],"about_ca_topic_score_codex":0.009429691,"about_ca_topic_score_gemma":0.0029981679,"teacher_disagreement_score":0.009429691,"about_ca_system_score_codex":0.0030872193,"about_ca_system_score_gemma":0.0011037188,"threshold_uncertainty_score":0.030105233},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24303916,0.0039460235,0.7456498,0.00030897654,0.0001386979,0.00021800981,0.00017091904,0.002756503,0.0037719782],"genre_scores_gemma":[0.637519,0.0023689603,0.35817096,0.000093452,0.00006089737,0.00022521298,0.0004016454,0.00025607142,0.0009037449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566394,0.0016551897,0.000495389,0.00047864314,0.0015544811,0.00015231584],"domain_scores_gemma":[0.97938925,0.014818171,0.0010524464,0.0020977457,0.0024057701,0.00023662562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005088105,0.0008795874,0.0012792862,0.0011919076,0.0006644391,0.0010012229,0.0020870147,0.001307175,0.001248861],"category_scores_gemma":[0.02477664,0.000608596,0.0007257482,0.0021137763,0.00061008334,0.0016703336,0.00068251,0.0009512841,0.00040907523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013058315,0.0009596943,0.0059098755,0.00085070886,0.00029862957,0.00007286102,0.00045189788,0.56448126,0.010214087,0.008500155,0.0016062486,0.40534875],"study_design_scores_gemma":[0.00010591895,0.00035230754,0.0012801584,0.00004729883,0.000037684495,0.0000612695,0.00006659697,0.986591,0.008327195,0.0016622765,0.0014394305,0.000028961405],"about_ca_topic_score_codex":0.0072927945,"about_ca_topic_score_gemma":0.0038592918,"teacher_disagreement_score":0.0072927945,"about_ca_system_score_codex":0.001192304,"about_ca_system_score_gemma":0.0014920663,"threshold_uncertainty_score":0.026908815},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12000845,0.0016109052,0.86906093,0.0050423504,0.00018827918,0.00019560005,0.0005720778,0.0005142039,0.002807185],"genre_scores_gemma":[0.88216,0.0013794769,0.10052878,0.0004920175,0.00041900988,0.00020963178,0.0009287102,0.00036867423,0.013513681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846137,0.00069925777,0.00005619923,0.00034869232,0.00016425805,0.00027028422],"domain_scores_gemma":[0.9878506,0.009452796,0.00078720716,0.00026150688,0.0009979563,0.00064997945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00611778,0.0019851925,0.0043883366,0.001911864,0.0014065338,0.002774147,0.0034129622,0.004798816,0.0034069794],"category_scores_gemma":[0.021998394,0.0018574612,0.0017903484,0.002027834,0.002768986,0.004602679,0.0021996496,0.0035708603,0.00032062182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029047055,0.00012532098,0.002608824,0.00020628505,0.00013866398,0.00016451687,0.00013515414,0.9122072,0.00047241143,0.061562706,0.0070429086,0.0150455255],"study_design_scores_gemma":[0.000017683149,0.000015889167,0.000253772,0.000006763691,0.00001310977,0.00001145313,0.000017669428,0.9870841,0.000062132836,0.012311863,0.00019429023,0.000011205737],"about_ca_topic_score_codex":0.047982853,"about_ca_topic_score_gemma":0.01868251,"teacher_disagreement_score":0.047982853,"about_ca_system_score_codex":0.0031497467,"about_ca_system_score_gemma":0.002526989,"threshold_uncertainty_score":0.09540713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9818911,0.00015491333,0.014510315,0.00065381813,0.000013413978,0.00003900585,0.00015894674,0.000048600352,0.0025298279],"genre_scores_gemma":[0.9988673,0.000026958443,0.00076573127,0.000020447618,0.000022081713,0.0000077876575,0.000052428884,0.0000071409468,0.00023023016],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959234,0.0015529369,0.00029712336,0.0004932056,0.0008729819,0.0008603709],"domain_scores_gemma":[0.8104074,0.15434642,0.016293447,0.0072906027,0.006068692,0.0055933837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008577222,0.00023776037,0.00085176487,0.0029838898,0.0014807831,0.0051271403,0.0014711847,0.0014277025,0.007502978],"category_scores_gemma":[0.119287714,0.00036789227,0.0004941998,0.0026653695,0.0025107672,0.004857307,0.0020418405,0.0014654548,0.00045295313],"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.0011218236,0.0005421263,0.7883083,0.00011944684,0.0003239216,0.00026157426,0.005681519,0.060872022,0.002607173,0.083525546,0.0030245625,0.053611934],"study_design_scores_gemma":[0.00013224545,0.00048284192,0.43955278,0.00010173066,0.00018323537,0.0003421391,0.004987508,0.31145906,0.0017748243,0.23885785,0.0020225835,0.000103189195],"about_ca_topic_score_codex":0.011044866,"about_ca_topic_score_gemma":0.008432631,"teacher_disagreement_score":0.011044866,"about_ca_system_score_codex":0.0023296168,"about_ca_system_score_gemma":0.0015410351,"threshold_uncertainty_score":0.04536128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70992607,0.00072543905,0.27104726,0.0075769965,0.00016342044,0.00012544861,0.0004902999,0.0002860531,0.009659091],"genre_scores_gemma":[0.9932807,0.00017875656,0.004617633,0.0002629524,0.00009951768,0.000031961106,0.00005634693,0.000019147636,0.0014530679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973677,0.0008160349,0.00013570912,0.00045421568,0.00050621113,0.00072013866],"domain_scores_gemma":[0.98096406,0.01265054,0.0028014157,0.00145018,0.0012474805,0.0008863335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043966216,0.00055895763,0.0015515278,0.0008465315,0.0013610033,0.0034112548,0.002094524,0.0025209878,0.0038474055],"category_scores_gemma":[0.028080631,0.00072298036,0.0013009476,0.0008658576,0.0018552815,0.0061382866,0.002080439,0.0026386017,0.00026754275],"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.0008556884,0.0004430175,0.014758289,0.00035101763,0.00028913794,0.0022739228,0.001893561,0.46267325,0.014310885,0.4736981,0.005720705,0.022732368],"study_design_scores_gemma":[0.00012273766,0.00016520459,0.0030871143,0.000030285082,0.000099918245,0.00022390134,0.00028063642,0.8335492,0.0014161099,0.15994446,0.0009952814,0.0000852784],"about_ca_topic_score_codex":0.0057595777,"about_ca_topic_score_gemma":0.0024418705,"teacher_disagreement_score":0.0057595777,"about_ca_system_score_codex":0.0027310709,"about_ca_system_score_gemma":0.0018536346,"threshold_uncertainty_score":0.023251832},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43205866,0.001935821,0.50909865,0.011145141,0.00095346395,0.0001429519,0.0002368445,0.00029180365,0.04413658],"genre_scores_gemma":[0.97298616,0.0007035789,0.023502942,0.00064519956,0.00029056778,0.000047828304,0.000050260533,0.000051732488,0.0017217116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997259,0.000862052,0.00014743928,0.00056578655,0.0005732434,0.0005925014],"domain_scores_gemma":[0.9782641,0.015611069,0.0017300136,0.0011771983,0.0022548486,0.00096275256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054652505,0.00033750822,0.0009028849,0.0004845684,0.00090575503,0.0037172397,0.0016146208,0.0025310246,0.0027397573],"category_scores_gemma":[0.042409483,0.0003098705,0.00041548506,0.0006285156,0.002244165,0.004647366,0.0008737469,0.0019537646,0.00047089488],"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.00019412524,0.00026629842,0.009837067,0.00017654618,0.00009247002,0.00060758315,0.0004541481,0.15140253,0.0017617088,0.765978,0.010076846,0.05915266],"study_design_scores_gemma":[0.00005525565,0.000081618964,0.0017508513,0.00006038775,0.000026394819,0.00021999868,0.00040477634,0.39548177,0.0012510276,0.5978494,0.0027746435,0.00004390375],"about_ca_topic_score_codex":0.0051876204,"about_ca_topic_score_gemma":0.0025724238,"teacher_disagreement_score":0.0054652505,"about_ca_system_score_codex":0.001248962,"about_ca_system_score_gemma":0.0018955467,"threshold_uncertainty_score":0.028903365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52908707,0.000841027,0.45369598,0.0007625595,0.00003244581,0.0001901545,0.00024707668,0.00022023563,0.014923552],"genre_scores_gemma":[0.9770495,0.00019093245,0.020874219,0.00005774853,0.000028755949,0.00006901293,0.00006568363,0.00004658142,0.0016174875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969632,0.0015362748,0.00010206306,0.0003298421,0.00050749694,0.00056107313],"domain_scores_gemma":[0.991351,0.0063612796,0.0011392812,0.00025693633,0.0004670774,0.00042448178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005077447,0.001135926,0.0012804491,0.001194404,0.00043764093,0.0021579056,0.0009296679,0.0009016284,0.0025456294],"category_scores_gemma":[0.013700563,0.0006286489,0.00084774423,0.0009881086,0.0012201727,0.0034556969,0.0014026907,0.0010386078,0.00020522124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021115514,0.00006248446,0.0012559751,0.000055127515,0.00007351531,0.00011078747,0.00004668953,0.95580506,0.0010908943,0.028747145,0.00031598812,0.012225089],"study_design_scores_gemma":[0.000036221387,0.00018018406,0.001301947,0.000011308459,0.000034671502,0.000058488775,0.00006327173,0.9608068,0.0011023546,0.036057577,0.0003218405,0.00002533587],"about_ca_topic_score_codex":0.0019189533,"about_ca_topic_score_gemma":0.0011380321,"teacher_disagreement_score":0.005077447,"about_ca_system_score_codex":0.0020252264,"about_ca_system_score_gemma":0.0007832906,"threshold_uncertainty_score":0.026852429},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044915367,0.0011890255,0.94473714,0.00067893806,0.00013942453,0.000073147865,0.00016854546,0.0002897989,0.007808607],"genre_scores_gemma":[0.84968555,0.00143421,0.14279729,0.00030469423,0.00025173955,0.00018850932,0.0003375249,0.00022523625,0.004775355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972385,0.0007851895,0.00013674979,0.00048014268,0.0008932995,0.00046616734],"domain_scores_gemma":[0.9911383,0.005905009,0.0008643463,0.0006367509,0.0010239573,0.00043168708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038869737,0.0010489703,0.0019462327,0.0010647284,0.00091164943,0.002190564,0.0026767142,0.0010918503,0.001934171],"category_scores_gemma":[0.020869337,0.0006638931,0.0011809618,0.0011548003,0.0016860885,0.0028370046,0.0014753493,0.0023815583,0.0003124561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009751467,0.00005863311,0.0006884049,0.00010381828,0.000041474337,0.0000794228,0.00007653934,0.83508545,0.0013879021,0.14252177,0.0015887795,0.018270237],"study_design_scores_gemma":[0.000019129124,0.000027688819,0.000100985875,0.000009263719,0.000005540796,0.000019424599,0.000009220249,0.9371226,0.00030100576,0.06196864,0.00040749408,0.000009067923],"about_ca_topic_score_codex":0.009129329,"about_ca_topic_score_gemma":0.0051605096,"teacher_disagreement_score":0.009129329,"about_ca_system_score_codex":0.002907646,"about_ca_system_score_gemma":0.0040008556,"threshold_uncertainty_score":0.021096587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23470578,0.00063776004,0.75544375,0.0010580607,0.000091986105,0.00009232342,0.00017818695,0.00038454848,0.0074075996],"genre_scores_gemma":[0.9799774,0.00033141233,0.017582504,0.000060183444,0.000063128515,0.00006628,0.00005116488,0.00004180889,0.0018261147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980233,0.00092395354,0.00007280109,0.00025489496,0.0003493833,0.00037562332],"domain_scores_gemma":[0.9935015,0.005008786,0.0005273628,0.00021501316,0.00044003624,0.0003073935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032340148,0.0008781989,0.0013239962,0.00083572906,0.0009043339,0.0023948902,0.0017139568,0.0011189103,0.0019996671],"category_scores_gemma":[0.01039204,0.00072281744,0.00054917444,0.0013504089,0.0017849215,0.0029524795,0.0015088617,0.0011652302,0.00026372014],"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.00012280063,0.00007662793,0.0004303979,0.000060478003,0.00003786498,0.00011570251,0.00010604042,0.9317224,0.0015431085,0.060658023,0.00065690087,0.004469674],"study_design_scores_gemma":[0.00001817667,0.000020438742,0.00007779011,0.0000040596324,0.000006732176,0.000010400511,0.000018996718,0.9672122,0.00024453632,0.032232776,0.00014664925,0.0000072004323],"about_ca_topic_score_codex":0.005643674,"about_ca_topic_score_gemma":0.0039245584,"teacher_disagreement_score":0.005643674,"about_ca_system_score_codex":0.0036841962,"about_ca_system_score_gemma":0.0023699563,"threshold_uncertainty_score":0.026730835},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38691163,0.0029656137,0.4969857,0.03004393,0.0006056585,0.00012933322,0.0003936464,0.00051654055,0.081447996],"genre_scores_gemma":[0.9805304,0.0007584892,0.0120011745,0.00064738083,0.00012898074,0.000047539084,0.000052335155,0.000044534565,0.005789229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999629,0.00010083736,0.000007943219,0.00010489867,0.00007203573,0.000085132895],"domain_scores_gemma":[0.9986753,0.00048366448,0.00022724135,0.0001784332,0.00011866416,0.00031656938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006095437,0.0003561993,0.00030247497,0.00035296803,0.001374421,0.0028774135,0.00078479236,0.0011201132,0.004053774],"category_scores_gemma":[0.0027780754,0.00023472792,0.00032722097,0.00066342636,0.0022911874,0.0046027377,0.0014206492,0.0012202337,0.0002993314],"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.00016140279,0.00012620103,0.0074429717,0.00020822078,0.000081187216,0.00057967054,0.0010614343,0.1478062,0.003915811,0.71335155,0.014623627,0.11064177],"study_design_scores_gemma":[0.000030522657,0.00021277048,0.0077669765,0.00016442429,0.00008280406,0.0005528537,0.0020566026,0.26166418,0.0024891424,0.64761645,0.077274516,0.00008875797],"about_ca_topic_score_codex":0.004986096,"about_ca_topic_score_gemma":0.0036066312,"teacher_disagreement_score":0.004986096,"about_ca_system_score_codex":0.0016103421,"about_ca_system_score_gemma":0.0010106311,"threshold_uncertainty_score":0.013561189},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05317206,0.0004500328,0.9438745,0.0009874173,0.00004911272,0.00006493794,0.00009896851,0.00015462252,0.0011482175],"genre_scores_gemma":[0.9115792,0.0006422613,0.081078134,0.00022167484,0.00016845486,0.00014643835,0.00031084544,0.000120216246,0.005732804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988771,0.0005361008,0.000034829547,0.00023318772,0.0001815493,0.00013725445],"domain_scores_gemma":[0.991903,0.0062571894,0.0006853378,0.0002240918,0.00066506414,0.00026520912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042342246,0.0011530916,0.0017105996,0.0009822424,0.0006168219,0.0012836594,0.0013479077,0.0022046913,0.0014629246],"category_scores_gemma":[0.016108096,0.0007160338,0.00089845277,0.0008003551,0.0019300167,0.0023224375,0.0013914733,0.0017528482,0.00019677538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013653822,0.000055956352,0.00210331,0.00012075546,0.0000774083,0.00016174221,0.00009007789,0.9202903,0.0010518852,0.06064021,0.0015352292,0.013736536],"study_design_scores_gemma":[0.000007080095,0.000015267895,0.00022625201,0.000004249226,0.0000046964856,0.0000119358,0.000011302399,0.9857044,0.00012346274,0.013717946,0.00016727847,0.0000060827488],"about_ca_topic_score_codex":0.013475931,"about_ca_topic_score_gemma":0.0041852933,"teacher_disagreement_score":0.013475931,"about_ca_system_score_codex":0.0017431381,"about_ca_system_score_gemma":0.0014665073,"threshold_uncertainty_score":0.02679497},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03223761,0.0001378692,0.96341264,0.00035867712,0.00003804105,0.00013311318,0.00006327958,0.00019479031,0.0034239886],"genre_scores_gemma":[0.80446565,0.00029474936,0.19163872,0.0002338068,0.000064897205,0.00022995552,0.000108601744,0.0001017025,0.0028619082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762446,0.0011977538,0.00009370007,0.00031795088,0.0003917877,0.000374385],"domain_scores_gemma":[0.9964653,0.0024657962,0.0002180398,0.0001688233,0.0004233489,0.0002585413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037095414,0.00075426046,0.001363204,0.0010628242,0.0010491722,0.002158537,0.0016622238,0.0020289847,0.0033733712],"category_scores_gemma":[0.010743116,0.0009816797,0.00062088075,0.0011760248,0.0014886354,0.0018639518,0.002128514,0.001155137,0.00044120225],"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.0001438556,0.00006944193,0.00032865722,0.00007913278,0.000029209961,0.000037497037,0.00008683596,0.9248482,0.0035193271,0.056171663,0.000721981,0.013964216],"study_design_scores_gemma":[0.00001815469,0.000024849805,0.000037853613,0.0000055383252,0.0000067413143,0.000005658724,0.000012440049,0.98317873,0.00028355521,0.016209997,0.00021082166,0.0000056371628],"about_ca_topic_score_codex":0.005927781,"about_ca_topic_score_gemma":0.0049770577,"teacher_disagreement_score":0.005927781,"about_ca_system_score_codex":0.0028862692,"about_ca_system_score_gemma":0.0036920235,"threshold_uncertainty_score":0.020941436},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04954733,0.00087622146,0.9222995,0.0029806604,0.00043374288,0.00019838416,0.0010205453,0.00049468473,0.022149004],"genre_scores_gemma":[0.8672542,0.001319146,0.06002034,0.0008455692,0.00033689363,0.0006164358,0.00069883047,0.000183059,0.068725444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982693,0.00058870675,0.000061918356,0.00032533682,0.00026181617,0.00049289974],"domain_scores_gemma":[0.99638295,0.0020782913,0.0004049713,0.00013923882,0.00053225824,0.0004623892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026740383,0.0013845388,0.0022833277,0.001427294,0.001558547,0.004097656,0.003607281,0.0040535717,0.010732287],"category_scores_gemma":[0.008326835,0.0011658081,0.0013507471,0.0016810818,0.002941161,0.0034231304,0.0024760163,0.0026388878,0.0013845921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010778799,0.00007933142,0.00056633167,0.00006288291,0.000034765544,0.00016958594,0.00012425432,0.7393114,0.0007960642,0.25271004,0.0025806653,0.0034569777],"study_design_scores_gemma":[0.000017886334,0.000014985151,0.00006289142,0.000007191381,0.000007661832,0.00001166315,0.000018584255,0.97636867,0.000034848865,0.022850256,0.0005934268,0.0000120601],"about_ca_topic_score_codex":0.023840226,"about_ca_topic_score_gemma":0.012556822,"teacher_disagreement_score":0.023840226,"about_ca_system_score_codex":0.005279476,"about_ca_system_score_gemma":0.0038196885,"threshold_uncertainty_score":0.04740292},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3689833,0.0016984488,0.6128632,0.0011361721,0.000360783,0.00009435008,0.00019657606,0.0007048527,0.0139623135],"genre_scores_gemma":[0.97390693,0.00034546602,0.023416689,0.00013031493,0.0001886121,0.000038301885,0.00003980985,0.000040476658,0.0018933072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905485,0.00017981388,0.000048694583,0.0001983474,0.00025271054,0.0002655121],"domain_scores_gemma":[0.99797696,0.000903896,0.0003501274,0.00029664685,0.0003055076,0.00016685987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009347043,0.00034253468,0.00052235177,0.0005130835,0.0007569492,0.0013198981,0.0010957187,0.00060446764,0.0027714097],"category_scores_gemma":[0.004029193,0.0002970443,0.0005619245,0.00062550884,0.000725964,0.0017433214,0.0009920851,0.00094087573,0.00035536647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003166102,0.0002633559,0.007935992,0.00021339967,0.00012776299,0.00038686307,0.00048209084,0.60538894,0.021561107,0.2896342,0.0048680166,0.0688216],"study_design_scores_gemma":[0.000025121702,0.000088401335,0.0010191678,0.000010637675,0.000022163038,0.000086993205,0.00006026458,0.9627114,0.001220881,0.032818943,0.0019158704,0.000020132544],"about_ca_topic_score_codex":0.004417164,"about_ca_topic_score_gemma":0.0024358658,"teacher_disagreement_score":0.004417164,"about_ca_system_score_codex":0.0014014089,"about_ca_system_score_gemma":0.0009959495,"threshold_uncertainty_score":0.010167956},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10709551,0.0019253261,0.88035417,0.0009859407,0.00013846162,0.00006757412,0.00025828098,0.00023823867,0.008936459],"genre_scores_gemma":[0.9531673,0.0012476806,0.041796852,0.00023178877,0.00037157664,0.00013688482,0.0002504316,0.00019129388,0.002606142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730057,0.0009894432,0.00008089134,0.00041506658,0.0008314876,0.00038262454],"domain_scores_gemma":[0.94346035,0.04695714,0.0025391045,0.0019125451,0.0041438383,0.0009870551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058262316,0.0009295298,0.0008106816,0.0018484049,0.00051747664,0.0015783717,0.0016118024,0.0011599681,0.0019732201],"category_scores_gemma":[0.052472126,0.00041826584,0.00062148756,0.0011985992,0.002138376,0.0033675262,0.0016358427,0.0018363562,0.00027542142],"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.00029054834,0.00011179012,0.00717867,0.00028729675,0.00015256135,0.00040314643,0.00024476988,0.46636185,0.018940086,0.4725455,0.003904483,0.029579353],"study_design_scores_gemma":[0.00000945658,0.00005528691,0.0017812902,0.00003112132,0.000012995473,0.0001881291,0.000040968753,0.91030234,0.002272587,0.08422601,0.0010371245,0.00004272225],"about_ca_topic_score_codex":0.0010714506,"about_ca_topic_score_gemma":0.00060565874,"teacher_disagreement_score":0.0058262316,"about_ca_system_score_codex":0.0014354652,"about_ca_system_score_gemma":0.0009441642,"threshold_uncertainty_score":0.030812442},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09667436,0.00007277927,0.89808905,0.00025101771,0.00003376703,0.0001144434,0.00012156171,0.0015661021,0.0030768774],"genre_scores_gemma":[0.7713964,0.000095882126,0.22711979,0.00010124372,0.000017458719,0.00023961745,0.00018255334,0.00013714888,0.0007098084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986694,0.00075711217,0.000058197107,0.00012761739,0.0002050176,0.00018264387],"domain_scores_gemma":[0.9921388,0.0060144123,0.00032905242,0.00093997916,0.00041505377,0.00016274308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029287487,0.0006575584,0.0011556823,0.00052646175,0.00074498035,0.0009585703,0.0014134012,0.0010622082,0.0030709929],"category_scores_gemma":[0.010936435,0.00069599383,0.00072344014,0.0008554184,0.00096722465,0.0019038419,0.0011995661,0.001832484,0.00034730558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003706317,0.000023206438,0.0003720342,0.0000064450433,0.000006776187,0.000011189712,0.000016118025,0.9913741,0.00027453993,0.004885499,0.00010073862,0.002892265],"study_design_scores_gemma":[0.0000054735638,0.000004654391,0.000022721852,7.2872564e-7,0.0000010367726,0.000001347676,0.0000020071027,0.9987601,0.00016598008,0.0009904989,0.000043963737,0.0000014671833],"about_ca_topic_score_codex":0.0155754,"about_ca_topic_score_gemma":0.008420137,"teacher_disagreement_score":0.0155754,"about_ca_system_score_codex":0.0016003607,"about_ca_system_score_gemma":0.0017603214,"threshold_uncertainty_score":0.0309695},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5548924,0.00076045154,0.37903297,0.0020818051,0.00019159356,0.00050350674,0.0017664327,0.0020366465,0.058734223],"genre_scores_gemma":[0.95733523,0.0003780838,0.030183148,0.000145437,0.00004409168,0.00034808164,0.0005672688,0.0001028788,0.01089579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924904,0.00025809175,0.00003691559,0.00011835147,0.00014339961,0.00019411517],"domain_scores_gemma":[0.99866986,0.0006302536,0.00014620912,0.00009591151,0.00024029786,0.00021750052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008025835,0.00078838866,0.0010536937,0.00079050683,0.0010738212,0.002235395,0.0023030152,0.0029203796,0.0076732705],"category_scores_gemma":[0.0027001528,0.0005834322,0.0007194226,0.0010463174,0.0012982961,0.0017401022,0.0011709025,0.0015112868,0.00075337756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003894199,0.000032898064,0.0004880737,0.000013568175,0.000010355074,0.00006312927,0.000061775354,0.9913489,0.00049513316,0.0064458665,0.00020856842,0.0007928884],"study_design_scores_gemma":[0.000017218075,0.000015352063,0.000103657316,0.0000035634089,0.000005545882,0.000012262024,0.000022159107,0.99754,0.00020975029,0.0014986203,0.0005647897,0.0000070769056],"about_ca_topic_score_codex":0.041415177,"about_ca_topic_score_gemma":0.013126675,"teacher_disagreement_score":0.041415177,"about_ca_system_score_codex":0.002478381,"about_ca_system_score_gemma":0.002964848,"threshold_uncertainty_score":0.08234823},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18459174,0.0015041837,0.80586183,0.0011236705,0.00014603895,0.000116105846,0.00035407292,0.00031509713,0.0059872223],"genre_scores_gemma":[0.9794708,0.00061056233,0.01451743,0.00012706697,0.00010098899,0.000073556796,0.0002270227,0.00006666134,0.0048059453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992242,0.00019146105,0.000028481383,0.0001174711,0.00026898275,0.00016945596],"domain_scores_gemma":[0.9973437,0.0014173968,0.000341677,0.000097591204,0.0006204309,0.00017918095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020307077,0.00085471483,0.0010000656,0.00093568984,0.0007459817,0.0012723961,0.0013786047,0.00088487193,0.0023712069],"category_scores_gemma":[0.0047635026,0.00042486333,0.0011163934,0.00066250516,0.0011056835,0.0016697572,0.00080739433,0.0010933945,0.00022300094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022187196,0.000076126424,0.002719517,0.00017306814,0.000090805705,0.00030695277,0.0002092302,0.8604269,0.008053553,0.119598925,0.0016327291,0.00649035],"study_design_scores_gemma":[0.000003956878,0.000013306678,0.00029990735,0.0000025574366,0.000007357572,0.000019762667,0.000012610925,0.9940268,0.00024412147,0.005250145,0.00011227247,0.0000072326247],"about_ca_topic_score_codex":0.013369445,"about_ca_topic_score_gemma":0.005237207,"teacher_disagreement_score":0.013369445,"about_ca_system_score_codex":0.0026897832,"about_ca_system_score_gemma":0.0025902227,"threshold_uncertainty_score":0.026583254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028960237,0.00015681912,0.90104187,0.00014451928,0.00012875612,0.00031807844,0.0031369422,0.080272816,0.011904162],"genre_scores_gemma":[0.08529855,0.0011819544,0.8252589,0.0006088385,0.00015575373,0.0019192902,0.016557816,0.02956122,0.039457697],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992422,0.00011063787,0.00010604747,0.00011410168,0.00033298886,0.00009416571],"domain_scores_gemma":[0.9988393,0.0003805169,0.000106325366,0.00024175493,0.00031949743,0.00011266981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010822486,0.001053221,0.0008958222,0.00093862653,0.00069280906,0.0016690714,0.003987827,0.0014026358,0.026051199],"category_scores_gemma":[0.0032080547,0.0011454686,0.0015268618,0.0008279947,0.0004495751,0.0024441003,0.0015799941,0.0020961491,0.009645046],"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.00065831956,0.0009171295,0.009281898,0.0019676823,0.0003919689,0.001037791,0.0008485678,0.23629282,0.034055874,0.11662191,0.28377572,0.31415033],"study_design_scores_gemma":[0.00039366382,0.00012352652,0.00136374,0.00014480329,0.000121412224,0.00070032885,0.00006453402,0.5650584,0.01780601,0.029013142,0.38506347,0.00014690166],"about_ca_topic_score_codex":0.0047915075,"about_ca_topic_score_gemma":0.005530885,"teacher_disagreement_score":0.026051199,"about_ca_system_score_codex":0.00066158647,"about_ca_system_score_gemma":0.0016678681,"threshold_uncertainty_score":0.08714992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047294598,0.0014789152,0.9083389,0.0012755656,0.0004674675,0.00026939996,0.0006848054,0.0005022529,0.039688125],"genre_scores_gemma":[0.79662776,0.0028318216,0.13161188,0.000812798,0.0012954593,0.00050542824,0.0005367724,0.00023406776,0.06554411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983657,0.00041406087,0.000073462244,0.000290433,0.0005379318,0.000318416],"domain_scores_gemma":[0.9990402,0.00032540082,0.00013135363,0.00013759392,0.00026048903,0.000104988045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011993176,0.0012671582,0.0011755761,0.001086232,0.00094490615,0.001999435,0.003607308,0.0021000728,0.0051581375],"category_scores_gemma":[0.0027957936,0.0005075214,0.0011209095,0.0017150121,0.0014960634,0.0025431628,0.0014323716,0.0016527514,0.0016676196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017678455,0.00016700792,0.00067819783,0.0001518051,0.000035136403,0.0005706229,0.00019805947,0.5522001,0.0052545816,0.41754696,0.0056482647,0.017372439],"study_design_scores_gemma":[0.000017863329,0.000037049984,0.00015003757,0.000009751791,0.000011605039,0.0000448354,0.000012985876,0.94701195,0.0002206901,0.049882818,0.0025810825,0.000019332243],"about_ca_topic_score_codex":0.018749753,"about_ca_topic_score_gemma":0.0076142135,"teacher_disagreement_score":0.018749753,"about_ca_system_score_codex":0.0028339282,"about_ca_system_score_gemma":0.0020955936,"threshold_uncertainty_score":0.037281215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5174853,0.0005277309,0.46650994,0.0028663576,0.00061465584,0.00013285209,0.00033026875,0.0005384603,0.010994485],"genre_scores_gemma":[0.9789225,0.00016298148,0.01105801,0.00010017832,0.00013283576,0.000027052467,0.000069324946,0.000041394083,0.009485737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858046,0.00028959292,0.00006086597,0.00021493337,0.00039343754,0.00046077263],"domain_scores_gemma":[0.9963516,0.0017291823,0.0003892631,0.00031404573,0.0004891401,0.0007267774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002732622,0.0005676318,0.0013334849,0.00080136093,0.0012698034,0.0041895187,0.002298664,0.0019913986,0.00757481],"category_scores_gemma":[0.008749634,0.0006694915,0.0007068315,0.0011351736,0.0010249477,0.0030935116,0.001547771,0.0018826034,0.0005568959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010130125,0.0004322085,0.006210998,0.00008651271,0.00011787111,0.0011314747,0.00027648,0.6322933,0.0126584275,0.30399138,0.006540472,0.03524787],"study_design_scores_gemma":[0.000019178411,0.000041298823,0.00031476028,0.0000030023436,0.000011551141,0.000043619966,0.000016884553,0.98707294,0.00027806757,0.011938503,0.0002455307,0.000014678943],"about_ca_topic_score_codex":0.0058284383,"about_ca_topic_score_gemma":0.0059406585,"teacher_disagreement_score":0.00757481,"about_ca_system_score_codex":0.0026524414,"about_ca_system_score_gemma":0.001837988,"threshold_uncertainty_score":0.0253402},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053147017,0.00021275802,0.99165475,0.00033122208,0.000072157134,0.00002248477,0.000032763102,0.000050777988,0.0023084788],"genre_scores_gemma":[0.802737,0.0016698217,0.18407375,0.00043146644,0.00066851405,0.00023060896,0.00012929353,0.0002977672,0.009761824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816775,0.0009659655,0.00006531413,0.00022870759,0.00034746795,0.0002247754],"domain_scores_gemma":[0.9934685,0.004840467,0.0004599827,0.00043045598,0.0005451475,0.00025539804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044264887,0.0022397276,0.0022253988,0.0011788438,0.00091043295,0.0029716145,0.0027460991,0.0018311274,0.0024190869],"category_scores_gemma":[0.011191869,0.0011574891,0.0021219896,0.0012586202,0.0031404197,0.004041477,0.0035611093,0.0036402505,0.00027580216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051979026,0.000058745125,0.00022843243,0.00007733316,0.0000617391,0.000072595634,0.000087930406,0.69460183,0.0010440615,0.29378447,0.0011159646,0.008814862],"study_design_scores_gemma":[0.000003795696,0.000009200766,0.00002351863,0.000004260215,0.0000063302914,0.0000038446788,0.0000046895625,0.95262194,0.00008941426,0.047050007,0.0001777203,0.0000052937285],"about_ca_topic_score_codex":0.0061413157,"about_ca_topic_score_gemma":0.003938036,"teacher_disagreement_score":0.0061413157,"about_ca_system_score_codex":0.0024080996,"about_ca_system_score_gemma":0.0032461686,"threshold_uncertainty_score":0.023409843},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007997982,0.00013063932,0.98998,0.00014799071,0.000028237355,0.00002852096,0.000029600089,0.000098079945,0.0015589852],"genre_scores_gemma":[0.59524596,0.0005522716,0.3990336,0.00020281,0.000099835044,0.00046244467,0.00023400894,0.00019869761,0.003970452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928135,0.00042204885,0.000021703418,0.00006775319,0.00010959528,0.000097598386],"domain_scores_gemma":[0.9967775,0.0023809208,0.00022416135,0.00009774084,0.0003469049,0.00017294347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002352737,0.0010288561,0.0014069076,0.00079443323,0.00058921444,0.0010149818,0.0012642045,0.0016263353,0.0027980756],"category_scores_gemma":[0.0053595225,0.0009627829,0.0014328961,0.0007849838,0.00088983704,0.000965335,0.0013293296,0.0018133888,0.00028562875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013273895,0.00001245801,0.000113474154,0.000013713146,0.000010518425,0.000013312319,0.00001204926,0.99384624,0.00020345233,0.00375238,0.00011433012,0.0018946804],"study_design_scores_gemma":[0.0000018082424,0.0000031658103,0.000009374165,0.000001606921,0.0000012001104,0.000001221388,0.0000015651868,0.9992324,0.000026232918,0.00067239866,0.000047720398,0.0000012598886],"about_ca_topic_score_codex":0.01269359,"about_ca_topic_score_gemma":0.006705435,"teacher_disagreement_score":0.01269359,"about_ca_system_score_codex":0.001569643,"about_ca_system_score_gemma":0.0023426274,"threshold_uncertainty_score":0.025239408},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020519527,0.0022162695,0.94774675,0.0033759496,0.00069319416,0.00003088371,0.00023653804,0.00035380424,0.0248271],"genre_scores_gemma":[0.8099488,0.0041906526,0.10564705,0.0013939121,0.0021695772,0.00014399181,0.0006757181,0.00038212354,0.075448215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974957,0.0010684062,0.00006123827,0.0004151343,0.00058428646,0.00037518854],"domain_scores_gemma":[0.9862069,0.009488509,0.0004939086,0.0019120642,0.0013256466,0.0005729834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006180767,0.000982614,0.0016766256,0.0015019473,0.0011375302,0.0029525526,0.0039980994,0.002078186,0.009326502],"category_scores_gemma":[0.03455837,0.0009528298,0.0013507201,0.0022634023,0.0029850476,0.005678625,0.002253145,0.006254031,0.0016494627],"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.000037506365,0.000033583572,0.0005543491,0.0000439876,0.000024793007,0.000083508356,0.00009358059,0.041875932,0.00020219367,0.94456977,0.0049251164,0.00755567],"study_design_scores_gemma":[0.000014752176,0.00000878226,0.00026196183,0.000017601822,0.000015974516,0.00005807613,0.000029071245,0.55505925,0.00015685969,0.44132978,0.003034041,0.000013784374],"about_ca_topic_score_codex":0.007419486,"about_ca_topic_score_gemma":0.0035166896,"teacher_disagreement_score":0.009326502,"about_ca_system_score_codex":0.0033028084,"about_ca_system_score_gemma":0.0031370672,"threshold_uncertainty_score":0.032687366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36510357,0.00026559478,0.6215373,0.0014587104,0.00007892307,0.00035060704,0.00018613611,0.0003923803,0.010626837],"genre_scores_gemma":[0.9795349,0.000106301224,0.018263884,0.00008988596,0.000016217731,0.00009024421,0.000038567592,0.000018414234,0.0018414578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998351,0.00048438297,0.00006050091,0.00030634724,0.00022858079,0.000569169],"domain_scores_gemma":[0.99890506,0.00033292797,0.000153284,0.00009311386,0.00023007886,0.00028554667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012330601,0.00092058897,0.0011886689,0.00051990146,0.0018609148,0.002225297,0.0017215173,0.0019192254,0.0028730677],"category_scores_gemma":[0.0021413532,0.00070959976,0.00090539566,0.00087822403,0.0011053403,0.0024804308,0.0025556206,0.0010914443,0.00047298064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026806793,0.00026424057,0.0037350012,0.00014730435,0.00010060968,0.00086670823,0.00032153,0.90773404,0.016843747,0.054080006,0.0016443013,0.013994499],"study_design_scores_gemma":[0.00002761084,0.00008627882,0.0003762247,0.000005789909,0.000023684492,0.00009208899,0.00020755088,0.9894956,0.0006300088,0.008332017,0.000701302,0.000021956672],"about_ca_topic_score_codex":0.009081007,"about_ca_topic_score_gemma":0.007018814,"teacher_disagreement_score":0.009081007,"about_ca_system_score_codex":0.0027536573,"about_ca_system_score_gemma":0.003063523,"threshold_uncertainty_score":0.019979298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012474116,0.00035374888,0.98462325,0.0002835943,0.00007814604,0.000045494886,0.00003650698,0.00049700844,0.001608148],"genre_scores_gemma":[0.87597406,0.0003959034,0.119860485,0.00031080458,0.00010303448,0.00016189962,0.00008277308,0.00008297256,0.003027988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994823,0.00016020951,0.000026013786,0.0001121059,0.00013612193,0.000083305975],"domain_scores_gemma":[0.99853957,0.0008902525,0.0001395269,0.00006315692,0.00025792155,0.00010954434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015825093,0.0007942092,0.0009129377,0.00039865292,0.0003047257,0.00071552425,0.0019923674,0.00096899,0.0018111961],"category_scores_gemma":[0.0042148614,0.00031451412,0.0004195697,0.00040103463,0.00093198975,0.00086783466,0.0009335824,0.002062137,0.00026867617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007858898,0.00009527077,0.0006573181,0.000055308494,0.00003836621,0.000031297674,0.00004098115,0.94715637,0.0011162452,0.009774477,0.0010081463,0.03994766],"study_design_scores_gemma":[0.0000063521666,0.000017026052,0.000026993761,0.000001747744,0.0000029786602,0.000002333834,0.0000010816849,0.99809295,0.00012498358,0.0016090375,0.00011249514,0.0000020950001],"about_ca_topic_score_codex":0.009448252,"about_ca_topic_score_gemma":0.0070356005,"teacher_disagreement_score":0.009448252,"about_ca_system_score_codex":0.0014508,"about_ca_system_score_gemma":0.0018312687,"threshold_uncertainty_score":0.01878655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64672434,0.00058737735,0.32127032,0.0027522394,0.00021939137,0.0003535483,0.00030838602,0.00015027872,0.027634017],"genre_scores_gemma":[0.98017347,0.0002179262,0.011648874,0.00015757514,0.00006746379,0.00014379584,0.0000758735,0.000028280885,0.00748676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982863,0.0006236284,0.00006786717,0.00018118635,0.00021604622,0.00062505447],"domain_scores_gemma":[0.9940057,0.0034220533,0.000893436,0.00011517697,0.00037568636,0.0011879422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024594679,0.0012159391,0.0013015685,0.0010458286,0.0016094975,0.002960355,0.0020583577,0.0028514236,0.0057478426],"category_scores_gemma":[0.007185129,0.00058636087,0.0015896079,0.00058930623,0.0023707557,0.002865451,0.0020442302,0.0027303747,0.00025640705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004194461,0.00036141812,0.0036156601,0.00014611924,0.000109053915,0.0008563263,0.00073468324,0.7078634,0.0028164713,0.27437818,0.0030438593,0.005655326],"study_design_scores_gemma":[0.000040986568,0.00008335107,0.00040198455,0.000008106905,0.000019303126,0.000047575915,0.00024541756,0.9804584,0.00014921755,0.018185196,0.00033963186,0.000020879539],"about_ca_topic_score_codex":0.011865475,"about_ca_topic_score_gemma":0.007424046,"teacher_disagreement_score":0.011865475,"about_ca_system_score_codex":0.0029930524,"about_ca_system_score_gemma":0.0020000916,"threshold_uncertainty_score":0.02359283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05464639,0.0005064948,0.93903244,0.0012072469,0.00009460344,0.00008060644,0.00005550672,0.000075327036,0.0043013277],"genre_scores_gemma":[0.9395977,0.000617765,0.052941203,0.00024028338,0.00015781344,0.00015759235,0.000042043164,0.000047681737,0.0061979033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981421,0.00079005584,0.000048397014,0.00029056912,0.00034745075,0.00038142098],"domain_scores_gemma":[0.99602723,0.0025326416,0.0005698058,0.0001404776,0.00036967316,0.00036028068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026324037,0.0011295059,0.0011649977,0.0013621522,0.00092554453,0.0021022793,0.0020543593,0.0018809662,0.0024832285],"category_scores_gemma":[0.01041192,0.00072098605,0.0010591943,0.00095245085,0.00253372,0.002692955,0.0016481268,0.0018591151,0.00022775366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031651383,0.00005605189,0.00094208255,0.000037644775,0.000025098527,0.0000777601,0.00014834401,0.91942424,0.0008725237,0.07102185,0.00044650317,0.0069162883],"study_design_scores_gemma":[0.0000058145524,0.000034647957,0.00016282927,0.000008424762,0.000008526688,0.000016166852,0.000036691534,0.98092437,0.00015270288,0.018244954,0.00039253826,0.00001224904],"about_ca_topic_score_codex":0.009210367,"about_ca_topic_score_gemma":0.004433075,"teacher_disagreement_score":0.009210367,"about_ca_system_score_codex":0.0032265075,"about_ca_system_score_gemma":0.0028633266,"threshold_uncertainty_score":0.023410022},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0961688,0.0018137146,0.87393224,0.0018881389,0.00034094977,0.000050568502,0.0001644269,0.00014742774,0.025493827],"genre_scores_gemma":[0.8922851,0.001350727,0.077175334,0.00026762157,0.00034966884,0.00014258224,0.00015726284,0.00019525106,0.028076457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993962,0.00022998989,0.000022228069,0.000049407303,0.00018654035,0.000115559196],"domain_scores_gemma":[0.9968555,0.0022353781,0.00018385384,0.00018633586,0.00035599928,0.00018293894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029518087,0.00061455776,0.0007897749,0.0010845858,0.00068526017,0.00232632,0.0019084476,0.00076868915,0.0042528985],"category_scores_gemma":[0.010410721,0.00062205765,0.0006703218,0.0011206537,0.0014739732,0.0037715489,0.0014114215,0.0024945082,0.00039070332],"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.00008488038,0.00005188307,0.00039307887,0.000051154107,0.000021552969,0.00006619663,0.00021103397,0.10157879,0.0011916093,0.8876119,0.0014134783,0.007324422],"study_design_scores_gemma":[0.000012386415,0.000005062219,0.00009311622,0.00000893248,0.0000056971285,0.00000977936,0.000016569782,0.86931896,0.0001326079,0.1296882,0.0007010185,0.000007696836],"about_ca_topic_score_codex":0.005045261,"about_ca_topic_score_gemma":0.0037013558,"teacher_disagreement_score":0.005045261,"about_ca_system_score_codex":0.0025863133,"about_ca_system_score_gemma":0.00231691,"threshold_uncertainty_score":0.018765152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9795808,0.00035596086,0.0052162725,0.00055232627,0.000044756394,0.000072022565,0.00042064252,0.00016441758,0.013592765],"genre_scores_gemma":[0.99439394,0.00011696134,0.0017166965,0.000042096442,0.000022446771,0.00003655952,0.00012041761,0.0000367555,0.0035141234],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955225,0.0013752071,0.00024964852,0.00067328167,0.0012878807,0.00089143077],"domain_scores_gemma":[0.95964473,0.02156668,0.006041656,0.002308398,0.0057134544,0.004725138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047461004,0.00033856524,0.0005256089,0.001904992,0.0023266464,0.004971976,0.001261181,0.0012338273,0.011315071],"category_scores_gemma":[0.044155963,0.00033036747,0.00038198355,0.0022280938,0.0007877271,0.0031638038,0.002797179,0.0017280186,0.0011719347],"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.0038182784,0.0013484318,0.5677409,0.00051038887,0.0003521764,0.0012493579,0.059750646,0.00839017,0.013477249,0.037723597,0.009700463,0.2959384],"study_design_scores_gemma":[0.00016808732,0.0013861243,0.8297797,0.00033288787,0.00029524678,0.0011483295,0.0628485,0.028272176,0.01190965,0.0181505,0.045476172,0.00023264396],"about_ca_topic_score_codex":0.013104481,"about_ca_topic_score_gemma":0.013795306,"teacher_disagreement_score":0.013104481,"about_ca_system_score_codex":0.0036139057,"about_ca_system_score_gemma":0.002304522,"threshold_uncertainty_score":0.037852705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015324172,0.0011639568,0.9630747,0.0016067032,0.00044010612,0.000051149767,0.00015456753,0.00013822402,0.018046368],"genre_scores_gemma":[0.7995254,0.004361764,0.16884564,0.00087260193,0.0020081392,0.00025272102,0.00023257607,0.0001821825,0.023719065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983552,0.0004965012,0.0000929262,0.00029071484,0.00054989423,0.00021480191],"domain_scores_gemma":[0.99428755,0.0030262172,0.0010194726,0.00055412384,0.0007744415,0.0003382147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029092014,0.001042467,0.0007126654,0.0013838941,0.0010267299,0.0028227484,0.002354357,0.0015437528,0.005962691],"category_scores_gemma":[0.008439488,0.0005819283,0.00096578023,0.0013695961,0.0028737383,0.00512048,0.0015734304,0.003375586,0.0005767541],"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.0000032014818,0.000011601874,0.00012885821,0.000014969548,0.0000030894207,0.00005037438,0.000042735548,0.0060936124,0.00021639619,0.9917835,0.00023467888,0.0014169917],"study_design_scores_gemma":[0.000009287815,0.000031827138,0.00018771988,0.000021293725,0.000017248625,0.000108117114,0.000040938943,0.16045444,0.0004797773,0.8325542,0.006072391,0.000022795126],"about_ca_topic_score_codex":0.002803536,"about_ca_topic_score_gemma":0.0017772127,"teacher_disagreement_score":0.005962691,"about_ca_system_score_codex":0.0019619088,"about_ca_system_score_gemma":0.0017881333,"threshold_uncertainty_score":0.01994723},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32738698,0.00087325164,0.6553125,0.00254801,0.00013777505,0.00013508124,0.00011343555,0.00021537804,0.013277555],"genre_scores_gemma":[0.98940057,0.00025187831,0.0073785926,0.00008058741,0.00005882668,0.000043166856,0.000022774639,0.000017624474,0.002746046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958049,0.0017355792,0.00017086233,0.00062288507,0.00070004736,0.000965795],"domain_scores_gemma":[0.9921937,0.004932723,0.0012962671,0.00034860702,0.00068933715,0.0005394455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038207504,0.0011761525,0.0013862937,0.0007196653,0.0013693685,0.003958551,0.0019991468,0.0024883896,0.002797368],"category_scores_gemma":[0.014219586,0.0008861379,0.0011534969,0.00093621906,0.0037356154,0.0037719663,0.0019049812,0.0028071029,0.0003053012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016202714,0.00014826575,0.0032019939,0.00010471839,0.000080463535,0.00078908994,0.0006463365,0.5082115,0.0030900002,0.47313753,0.001196989,0.00923106],"study_design_scores_gemma":[0.000024640023,0.00004041108,0.0005284638,0.000008578167,0.000018252991,0.000066092674,0.00012735128,0.9205757,0.00024301537,0.07789789,0.00044661423,0.00002307216],"about_ca_topic_score_codex":0.010359421,"about_ca_topic_score_gemma":0.0043183216,"teacher_disagreement_score":0.010359421,"about_ca_system_score_codex":0.0049100374,"about_ca_system_score_gemma":0.0022862016,"threshold_uncertainty_score":0.03562498},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07399826,0.004342999,0.84563416,0.025960615,0.00042816636,0.00042154914,0.0008598248,0.00037238284,0.047982093],"genre_scores_gemma":[0.9325671,0.0028193423,0.05285637,0.0012267196,0.0007964889,0.00033736625,0.00042635662,0.000074388445,0.008895765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99016774,0.004708187,0.00054171216,0.0018139903,0.0015854961,0.0011829475],"domain_scores_gemma":[0.980179,0.014385111,0.0019362165,0.0017420822,0.0012164189,0.00054119393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063365344,0.00097527605,0.00131424,0.0011150175,0.0026375053,0.0072416957,0.002101412,0.004864215,0.0058888714],"category_scores_gemma":[0.02002829,0.0005808455,0.0013730518,0.0031496584,0.004778561,0.008422163,0.003917988,0.0037873478,0.0008303805],"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.00006306841,0.00010956286,0.0017825665,0.0003501584,0.0000828068,0.0003303362,0.00075072254,0.07422001,0.00056451216,0.89006066,0.005528676,0.026156971],"study_design_scores_gemma":[0.000046321682,0.00007057153,0.00051258365,0.00009292584,0.00003746978,0.00028027053,0.00043695606,0.2237484,0.00052906544,0.7539676,0.020240469,0.000037354966],"about_ca_topic_score_codex":0.0045177415,"about_ca_topic_score_gemma":0.0013052082,"teacher_disagreement_score":0.0072416957,"about_ca_system_score_codex":0.0045602117,"about_ca_system_score_gemma":0.0040165563,"threshold_uncertainty_score":0.03351122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7415298,0.00041066058,0.24747613,0.00087646575,0.000048681835,0.000062643354,0.000088667584,0.0001002622,0.009406625],"genre_scores_gemma":[0.9950073,0.000108917244,0.003348549,0.000016242007,0.0000068891727,0.000019315654,0.000010037023,0.0000044237277,0.001478444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999728,0.00009064795,0.000012312345,0.000059151982,0.000044435055,0.00006543507],"domain_scores_gemma":[0.9990833,0.00042624574,0.00027497474,0.000027995202,0.00011672502,0.00007076085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055282575,0.00043422572,0.00037972577,0.00039669673,0.000670786,0.0009875039,0.0006081539,0.00076012895,0.0014883447],"category_scores_gemma":[0.0018247389,0.00021941004,0.0003088485,0.0003307075,0.001314955,0.00088021066,0.00076940295,0.0004655418,0.00013772369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016139707,0.00006315953,0.0062855696,0.000071593975,0.000032406,0.001099132,0.00059656444,0.836918,0.012100891,0.13648212,0.00057415594,0.0056151072],"study_design_scores_gemma":[0.000007786466,0.000047486203,0.000626528,0.0000070535775,0.000009837328,0.000076118435,0.0001235933,0.9887344,0.0005343464,0.009533763,0.00029027663,0.000008769173],"about_ca_topic_score_codex":0.011507986,"about_ca_topic_score_gemma":0.0034241765,"teacher_disagreement_score":0.011507986,"about_ca_system_score_codex":0.0015949019,"about_ca_system_score_gemma":0.00082237145,"threshold_uncertainty_score":0.022881985},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3620494,0.0023888715,0.60720766,0.0035843514,0.00040497512,0.00043444632,0.00111186,0.0006430823,0.022175364],"genre_scores_gemma":[0.97872114,0.00035354114,0.01717057,0.00008510601,0.000052762145,0.00007610062,0.00015450499,0.00005965606,0.0033267327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988438,0.00037988645,0.000035772948,0.00017646323,0.00014635455,0.00041773645],"domain_scores_gemma":[0.99618137,0.0027639589,0.00029925234,0.00007372131,0.00031552685,0.0003661675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002003051,0.0010424937,0.0018214181,0.0010308307,0.00087070797,0.0025053476,0.0016474993,0.0017169726,0.0045858966],"category_scores_gemma":[0.0058833663,0.0017089734,0.0008329362,0.0017314167,0.0012401248,0.0018603853,0.0011525798,0.0016937299,0.0002896498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051193376,0.00001733506,0.00011171195,0.00002105487,0.000011824776,0.000029151057,0.000012739697,0.99497026,0.00019207396,0.0027505942,0.00041909041,0.0014130201],"study_design_scores_gemma":[0.0000050914387,0.000008342568,0.00006427082,0.0000025569032,0.0000035496682,0.0000032290704,0.000013181387,0.99840397,0.000049753482,0.0013924233,0.000050312847,0.0000034220918],"about_ca_topic_score_codex":0.04264616,"about_ca_topic_score_gemma":0.029337618,"teacher_disagreement_score":0.04264616,"about_ca_system_score_codex":0.0041937623,"about_ca_system_score_gemma":0.003964384,"threshold_uncertainty_score":0.08479589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09276976,0.00046397006,0.83418435,0.00846193,0.0003586911,0.00027041286,0.00093288644,0.00042140376,0.06213668],"genre_scores_gemma":[0.9158765,0.0005230212,0.03203636,0.00038178696,0.00018158926,0.00046048607,0.00034313198,0.00011064099,0.050086554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838567,0.0005304482,0.000056720957,0.00031900106,0.0002679997,0.00044007876],"domain_scores_gemma":[0.9971144,0.0014683274,0.0002426624,0.00015579094,0.0004916344,0.0005272737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024922737,0.00085622,0.0014444104,0.001239348,0.0014212027,0.0043810965,0.0037350955,0.0041705077,0.01616008],"category_scores_gemma":[0.008504875,0.0006959547,0.00096083607,0.0018121289,0.001941037,0.0054752487,0.0026834614,0.0024653277,0.0015158476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009751945,0.00013816955,0.0012723404,0.000071025446,0.000034635013,0.00024413099,0.00038307003,0.6076201,0.0005165021,0.37313864,0.0052681156,0.011215817],"study_design_scores_gemma":[0.000018575412,0.000032324464,0.00016485533,0.000011973509,0.000011066581,0.000028963503,0.00013440824,0.92212945,0.00004579552,0.075669676,0.0017366976,0.000016268601],"about_ca_topic_score_codex":0.015924264,"about_ca_topic_score_gemma":0.010568668,"teacher_disagreement_score":0.01616008,"about_ca_system_score_codex":0.003949597,"about_ca_system_score_gemma":0.0038153077,"threshold_uncertainty_score":0.054060817},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04235926,0.0013955658,0.9167786,0.0018863403,0.0003567837,0.00018427856,0.0007729585,0.00066057604,0.035605617],"genre_scores_gemma":[0.6636554,0.0035361259,0.27408203,0.0015155651,0.000614991,0.0006689066,0.0013863558,0.0018465988,0.0526941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993843,0.00013916206,0.0000330918,0.00007382685,0.00020768674,0.00016198633],"domain_scores_gemma":[0.9959345,0.0025436063,0.0002724885,0.00018976087,0.0008799426,0.00017962155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020783679,0.0012696226,0.0008609897,0.0017359904,0.00094910583,0.0017048636,0.0022480537,0.0013937824,0.020078674],"category_scores_gemma":[0.013147521,0.0004971533,0.0011693437,0.0017065493,0.0014014029,0.00297573,0.0013070841,0.002568431,0.0034247593],"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.00013631936,0.00025526312,0.0018313123,0.00043859796,0.00004774556,0.00054766797,0.0011157194,0.3331473,0.0075261635,0.6028898,0.016875941,0.035188194],"study_design_scores_gemma":[0.000021687474,0.000015559319,0.00033368365,0.00005047021,0.000016085225,0.00015199707,0.00016736543,0.9424404,0.0010835872,0.0523804,0.0033093225,0.00002950439],"about_ca_topic_score_codex":0.008974421,"about_ca_topic_score_gemma":0.0101262145,"teacher_disagreement_score":0.020078674,"about_ca_system_score_codex":0.002801556,"about_ca_system_score_gemma":0.0034061233,"threshold_uncertainty_score":0.067169905},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028432943,0.00010287737,0.9855182,0.00010398112,0.00007438229,0.00010433533,0.0006967145,0.006324171,0.004232131],"genre_scores_gemma":[0.08764057,0.00042143642,0.88157374,0.00020894654,0.00014731174,0.00077007315,0.005520823,0.004863041,0.018854115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994153,0.00008793704,0.000050459766,0.00014545427,0.00021255705,0.00008832585],"domain_scores_gemma":[0.9981154,0.0008182105,0.0001127074,0.0003030363,0.00055922836,0.00009144505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011679222,0.0020856655,0.0010669114,0.002242902,0.0013353219,0.0014734918,0.0015833994,0.0009870778,0.06348666],"category_scores_gemma":[0.008032233,0.00067555986,0.001323642,0.0013410456,0.00059396145,0.0022095658,0.001921664,0.0021785123,0.03141543],"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.00027924764,0.00024153621,0.004144968,0.00080589304,0.00017233146,0.0005891507,0.0006885945,0.20306177,0.019906756,0.09315819,0.06666335,0.61028826],"study_design_scores_gemma":[0.00007223604,0.000063359395,0.0015718255,0.000055929893,0.000045710938,0.000254855,0.00019266988,0.89690626,0.013062327,0.0589488,0.02873275,0.000093354596],"about_ca_topic_score_codex":0.011053046,"about_ca_topic_score_gemma":0.014417473,"teacher_disagreement_score":0.06348666,"about_ca_system_score_codex":0.0011074477,"about_ca_system_score_gemma":0.0037514465,"threshold_uncertainty_score":0.21238405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20076004,0.00036110886,0.79153264,0.0006545163,0.00006705564,0.000116696116,0.000109267734,0.00022832784,0.0061703576],"genre_scores_gemma":[0.9846421,0.00010373186,0.013736671,0.00003667448,0.000010788746,0.00004356972,0.00002200325,0.000009060722,0.0013954535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936026,0.00014631507,0.00002621789,0.00017075289,0.00011836385,0.00017803289],"domain_scores_gemma":[0.9991534,0.0003673333,0.00020319606,0.000028592576,0.00016772847,0.00007979629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012644189,0.00071189046,0.00074373797,0.0004966077,0.00060996064,0.001617385,0.0010052286,0.0010737436,0.0014234924],"category_scores_gemma":[0.0018101791,0.00035491108,0.0005538495,0.00042817334,0.0010966966,0.00079017354,0.00083453866,0.001095609,0.000110877925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110041336,0.00003751019,0.0004124074,0.000048255257,0.000015720187,0.00008219697,0.00006263428,0.98085016,0.002172245,0.011182393,0.00028039355,0.004746067],"study_design_scores_gemma":[0.000008483958,0.00002886132,0.00010023978,0.0000028043694,0.000005138665,0.0000040709115,0.000009798409,0.99818254,0.00020095993,0.0014109563,0.000041995136,0.0000041823814],"about_ca_topic_score_codex":0.02543703,"about_ca_topic_score_gemma":0.012380018,"teacher_disagreement_score":0.02543703,"about_ca_system_score_codex":0.003078974,"about_ca_system_score_gemma":0.002401539,"threshold_uncertainty_score":0.05057794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5747492,0.0013888363,0.39001873,0.004508309,0.00006914942,0.00024015117,0.0001652053,0.0001825725,0.028677868],"genre_scores_gemma":[0.9936534,0.00011346631,0.005397898,0.00009014682,0.000018942837,0.000031426684,0.00001299149,0.000014399728,0.0006672157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99229735,0.0046917973,0.00021769093,0.0005962141,0.0007677174,0.0014293045],"domain_scores_gemma":[0.98595804,0.009844142,0.0017002316,0.0008535647,0.0008125981,0.0008313377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008839321,0.00069673546,0.00088907557,0.0012651194,0.00084352196,0.0028153467,0.0014417225,0.0018820971,0.0037135174],"category_scores_gemma":[0.022501113,0.0006002291,0.000604763,0.0009214849,0.0019393556,0.004901999,0.0019999195,0.0008060283,0.00024083682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034148886,0.0001938427,0.0070233378,0.00014275587,0.00014900883,0.00021473893,0.0003579713,0.7777939,0.0034203823,0.18630023,0.001042371,0.023019964],"study_design_scores_gemma":[0.00011416646,0.00031365923,0.0065466193,0.000065118795,0.00008089293,0.0002177884,0.00073093816,0.8343896,0.0014959951,0.15436396,0.0016378453,0.000043434644],"about_ca_topic_score_codex":0.0030252826,"about_ca_topic_score_gemma":0.0023081484,"teacher_disagreement_score":0.008839321,"about_ca_system_score_codex":0.0040643024,"about_ca_system_score_gemma":0.0021327678,"threshold_uncertainty_score":0.046747386},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07020345,0.0018370576,0.9153141,0.0016732813,0.00036883316,0.00013581521,0.0001561498,0.0003060042,0.010005451],"genre_scores_gemma":[0.9597292,0.000800238,0.029823085,0.00019291356,0.00027215836,0.00008729869,0.00007618409,0.00012343572,0.008895402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963799,0.0017202875,0.0001032906,0.00042136517,0.00058416935,0.0007909176],"domain_scores_gemma":[0.993946,0.004190651,0.00049104437,0.0002334745,0.00054590177,0.0005929422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005072487,0.001610789,0.002967756,0.0010514095,0.0013275045,0.003314777,0.0039891168,0.0018613675,0.005604214],"category_scores_gemma":[0.01484833,0.0014098744,0.0014367398,0.0018865643,0.0031105399,0.0053175697,0.0029470369,0.0035067345,0.00056911324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024224921,0.00011374746,0.00048373474,0.00010422706,0.000057532317,0.0001977254,0.00014927046,0.8059838,0.0011165729,0.18045233,0.0021568686,0.00894192],"study_design_scores_gemma":[0.000015695505,0.000020447207,0.00007093782,0.000005691429,0.000009971789,0.000018176412,0.000019436833,0.9689398,0.00009012546,0.030506242,0.00028929868,0.000014013144],"about_ca_topic_score_codex":0.009234522,"about_ca_topic_score_gemma":0.0053385366,"teacher_disagreement_score":0.009234522,"about_ca_system_score_codex":0.0052170516,"about_ca_system_score_gemma":0.00314711,"threshold_uncertainty_score":0.037852466},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13007437,0.0003720604,0.85932845,0.0008801032,0.00014672037,0.00009312942,0.00008266452,0.00022187905,0.008800608],"genre_scores_gemma":[0.91814953,0.00026051953,0.07783633,0.00023683706,0.000091863985,0.000121040015,0.000057702215,0.00006972041,0.0031764938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868685,0.00036990878,0.00006970414,0.0002420689,0.00041315492,0.00021838298],"domain_scores_gemma":[0.99567777,0.0023333246,0.00064913766,0.00044011473,0.0005046063,0.00039506087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002676625,0.00048819094,0.001003445,0.000513542,0.00068054075,0.0015364689,0.0019518974,0.0011435361,0.001166513],"category_scores_gemma":[0.0067269006,0.00026949943,0.0008505924,0.00046184464,0.001894438,0.0013521172,0.0007895973,0.0017666767,0.0003092554],"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.0002624594,0.0002463822,0.0033264274,0.00013430469,0.00007354771,0.00045113885,0.00033153442,0.45435217,0.015058571,0.49253118,0.003636469,0.029595766],"study_design_scores_gemma":[0.000021904829,0.000054409724,0.00029461403,0.0000079113415,0.0000076278707,0.00004551946,0.000020178039,0.9482315,0.001338215,0.049388304,0.00057690847,0.000012860923],"about_ca_topic_score_codex":0.003571471,"about_ca_topic_score_gemma":0.0013541888,"teacher_disagreement_score":0.003571471,"about_ca_system_score_codex":0.001334218,"about_ca_system_score_gemma":0.0010736423,"threshold_uncertainty_score":0.014155507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5936889,0.0007398225,0.4004017,0.0014098173,0.00045736288,0.000062561485,0.00034327828,0.00067639636,0.002220127],"genre_scores_gemma":[0.98962224,0.00013841123,0.006975596,0.00006999978,0.00017076255,0.000019327385,0.00018583376,0.00002905837,0.0027889144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871075,0.00029679562,0.00005362788,0.0003265857,0.00018622566,0.00042614553],"domain_scores_gemma":[0.9819118,0.014067474,0.0009668872,0.0007881973,0.0011011906,0.0011644714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004527426,0.0010555565,0.0019414767,0.00108109,0.00088638917,0.0018728861,0.0028842087,0.0018730351,0.0030900915],"category_scores_gemma":[0.015223395,0.00093726505,0.0009444913,0.0016239192,0.0010707598,0.0025202683,0.0012406702,0.0030908051,0.0004946028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011392366,0.00037701105,0.01726881,0.00009495808,0.0000851327,0.0003537988,0.00017636843,0.91926366,0.00087193336,0.022958659,0.0026798951,0.03473057],"study_design_scores_gemma":[0.000008180399,0.000021358404,0.00040981008,0.0000022768136,0.0000092676,0.000008095094,0.000008430427,0.99693143,0.000096103344,0.0024636476,0.00003624957,0.0000051083707],"about_ca_topic_score_codex":0.015291865,"about_ca_topic_score_gemma":0.008549507,"teacher_disagreement_score":0.015291865,"about_ca_system_score_codex":0.001183061,"about_ca_system_score_gemma":0.0018818715,"threshold_uncertainty_score":0.0304057},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36604986,0.000759486,0.61951315,0.0013781623,0.00017366355,0.000057091267,0.00012276821,0.00025186437,0.011693908],"genre_scores_gemma":[0.99236345,0.00021606316,0.0052147578,0.00006754943,0.00005646825,0.0000270468,0.000027595514,0.00001650088,0.0020105843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995078,0.00011406181,0.000021533113,0.00008625321,0.00015490645,0.000115433526],"domain_scores_gemma":[0.9973133,0.0012951263,0.00063832634,0.00012688928,0.0003569636,0.0002693734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013465809,0.0007009963,0.0005908216,0.0010698853,0.00060986384,0.0014942816,0.0010273296,0.0009268651,0.001426489],"category_scores_gemma":[0.007369114,0.00028415225,0.00056913326,0.0004690241,0.0023705447,0.0020010276,0.0016827487,0.0011911216,0.00012720413],"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.000076885,0.000042842483,0.0015571344,0.00005817471,0.000035096808,0.00024517498,0.00029523234,0.37127838,0.0076402263,0.61400586,0.0006757845,0.0040891757],"study_design_scores_gemma":[0.000006514929,0.000019693241,0.00014015225,0.0000060689804,0.0000056331705,0.000015275395,0.000025895391,0.93534887,0.00048121114,0.06370524,0.00023644594,0.0000090715175],"about_ca_topic_score_codex":0.00418396,"about_ca_topic_score_gemma":0.0017550263,"teacher_disagreement_score":0.00418396,"about_ca_system_score_codex":0.0013985897,"about_ca_system_score_gemma":0.0010907078,"threshold_uncertainty_score":0.010147572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006434006,0.0071490863,0.95075995,0.001807224,0.003139601,0.00005446233,0.00024027021,0.0009962085,0.02941924],"genre_scores_gemma":[0.39816386,0.019552981,0.43874565,0.0024834368,0.008625874,0.00024798667,0.0005758219,0.0029775305,0.12862694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941444,0.00012187375,0.000029334986,0.00015199854,0.00023400641,0.000048441794],"domain_scores_gemma":[0.9984376,0.0011463205,0.00006156999,0.000111728004,0.00017668644,0.000066219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016311846,0.0013542778,0.0011848345,0.0009799574,0.00094399153,0.0018903915,0.0024334013,0.0010999878,0.00831057],"category_scores_gemma":[0.005789867,0.0007251605,0.0009799266,0.0019078074,0.0019676164,0.0044438043,0.0014174281,0.004037341,0.0021596116],"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.00007910337,0.000046780206,0.0002726773,0.00022649438,0.000027971377,0.00037203252,0.00025574237,0.030813308,0.0047891308,0.90261394,0.02119238,0.03931032],"study_design_scores_gemma":[0.0000156525,0.000052912856,0.00046100368,0.00007193122,0.00002418423,0.00036932016,0.000052560554,0.24994494,0.0017641624,0.71088874,0.036294118,0.00006051431],"about_ca_topic_score_codex":0.0031059077,"about_ca_topic_score_gemma":0.002640157,"teacher_disagreement_score":0.00831057,"about_ca_system_score_codex":0.0022291914,"about_ca_system_score_gemma":0.0010314648,"threshold_uncertainty_score":0.027801573},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013141804,0.0007737937,0.9806231,0.0003435749,0.00010575523,0.000031185195,0.000044598408,0.0002481597,0.0046879863],"genre_scores_gemma":[0.82563883,0.0026214493,0.14733298,0.0004138166,0.00086750515,0.00023457938,0.00032080448,0.00057097216,0.021999056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881196,0.00047990173,0.000050229828,0.00011796251,0.00039501284,0.00014493843],"domain_scores_gemma":[0.99172676,0.0053054676,0.00036357203,0.00062500604,0.001663422,0.0003158335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037409468,0.00084313186,0.0010342884,0.0026149387,0.0006468882,0.0021794008,0.002168376,0.0012103636,0.003753311],"category_scores_gemma":[0.021301946,0.00052321685,0.0010353985,0.0015441873,0.0019458031,0.0045005926,0.002091993,0.003186481,0.00097231223],"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.00005923882,0.00012857323,0.0008981522,0.0001476891,0.0000631528,0.00012629121,0.00028865208,0.11539538,0.0032181586,0.8529091,0.0028453895,0.0239202],"study_design_scores_gemma":[0.000004201329,0.000009403431,0.00022564143,0.000012836894,0.000008176967,0.00004165783,0.000022322469,0.9106044,0.00027517253,0.08794775,0.0008357111,0.000012625252],"about_ca_topic_score_codex":0.003773608,"about_ca_topic_score_gemma":0.0016079725,"teacher_disagreement_score":0.003773608,"about_ca_system_score_codex":0.0021279377,"about_ca_system_score_gemma":0.0020389762,"threshold_uncertainty_score":0.019784272},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017514024,0.00018538603,0.98049533,0.0002793813,0.00003084635,0.000079166704,0.00004174124,0.00034746327,0.0010267914],"genre_scores_gemma":[0.2431665,0.0002732769,0.7538237,0.00022026118,0.000054342545,0.00025447138,0.00019502208,0.00017692476,0.001835544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790704,0.00083325175,0.00015797938,0.0003866223,0.0003787759,0.00033634866],"domain_scores_gemma":[0.98384136,0.012229864,0.0011064003,0.0008610271,0.0014920365,0.00046921556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068169525,0.0011748704,0.0015932287,0.001192036,0.0010556822,0.002802691,0.0043913918,0.0019230072,0.004078028],"category_scores_gemma":[0.01588488,0.00087244104,0.0010864509,0.0010905296,0.0014551654,0.00403575,0.0026728876,0.0029730715,0.00072541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012080236,0.000091682916,0.0013727103,0.00011405826,0.0000467875,0.000045391786,0.00021944019,0.9293279,0.0007285023,0.03603409,0.0007559817,0.031142723],"study_design_scores_gemma":[0.000017281374,0.000010181192,0.00004651012,0.0000063424313,0.000004302946,0.0000070163615,0.0000109160455,0.98962677,0.00019780049,0.009865288,0.00020285301,0.0000047539143],"about_ca_topic_score_codex":0.009446975,"about_ca_topic_score_gemma":0.006587681,"teacher_disagreement_score":0.009446975,"about_ca_system_score_codex":0.0039050276,"about_ca_system_score_gemma":0.0043759355,"threshold_uncertainty_score":0.03605193},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91611236,0.0001262265,0.082487874,0.00023914322,0.000025787447,0.000025152323,0.00006825377,0.0004897069,0.00042557347],"genre_scores_gemma":[0.9946241,0.00002335196,0.005044445,0.000019082521,0.000013440182,0.000006629235,0.000038780905,0.000014325828,0.00021583188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832994,0.00057445746,0.00006325323,0.00032881775,0.0003904733,0.00031310998],"domain_scores_gemma":[0.9848215,0.01150452,0.0012864645,0.0007783211,0.0010817829,0.00052734325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052127,0.0007972099,0.00083669246,0.0010505595,0.0004196075,0.0011319584,0.0014078692,0.0012174068,0.00068113935],"category_scores_gemma":[0.022727557,0.0005234004,0.000338562,0.00085581467,0.00066262385,0.0013412755,0.0006849448,0.0012391537,0.00020260931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072935864,0.00011599557,0.014759946,0.00002992227,0.000041788524,0.00012458723,0.00015391718,0.95986164,0.004623945,0.002782145,0.00040729655,0.01636947],"study_design_scores_gemma":[0.000005685631,0.000023505505,0.0005835124,0.0000015092343,0.0000027092456,0.000008438394,0.000009540037,0.9977592,0.0007267402,0.000855462,0.000018626688,0.0000049825803],"about_ca_topic_score_codex":0.010213219,"about_ca_topic_score_gemma":0.0043611475,"teacher_disagreement_score":0.010213219,"about_ca_system_score_codex":0.001504783,"about_ca_system_score_gemma":0.0012549489,"threshold_uncertainty_score":0.027567685},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48627436,0.0009896816,0.501318,0.00038302553,0.00009196408,0.00015763966,0.000058969268,0.00062290917,0.010103495],"genre_scores_gemma":[0.9796769,0.00012979846,0.018756786,0.000029591927,0.000011607124,0.000042091353,0.00001242418,0.000013168986,0.001327574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994862,0.00014376752,0.000020423598,0.0001242024,0.000102687445,0.00012275553],"domain_scores_gemma":[0.9985197,0.00068088376,0.0003622316,0.00010773325,0.00016782605,0.00016167079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008544156,0.00070700026,0.0006297697,0.0003749645,0.0004360556,0.0011258889,0.0013876692,0.0007996004,0.0011271042],"category_scores_gemma":[0.002877817,0.00039610936,0.00026545444,0.00031644083,0.0010753194,0.0013235902,0.00075050665,0.0005442268,0.00027466434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023122101,0.00013913827,0.0016504684,0.00007526253,0.000020665837,0.00007557353,0.000039410435,0.9605116,0.010459701,0.0069930297,0.00038417964,0.019419767],"study_design_scores_gemma":[0.000020633472,0.00009307967,0.00031383938,0.0000036670688,0.0000074665363,0.000014113421,0.00003278112,0.99604744,0.0017792729,0.0013157075,0.0003632078,0.000008716595],"about_ca_topic_score_codex":0.0040453197,"about_ca_topic_score_gemma":0.0038361754,"teacher_disagreement_score":0.0040453197,"about_ca_system_score_codex":0.0009803529,"about_ca_system_score_gemma":0.00093404687,"threshold_uncertainty_score":0.008043528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0315942,0.00039506287,0.9654208,0.00033437324,0.00017245214,0.00006407915,0.00007110084,0.00030427525,0.0016436256],"genre_scores_gemma":[0.77514416,0.0010300926,0.21974377,0.00023086573,0.0002884369,0.00012225141,0.00017671486,0.00014125802,0.0031224545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911433,0.000213294,0.00006189647,0.000170548,0.00031923086,0.000120631266],"domain_scores_gemma":[0.9986008,0.0006321443,0.0002687911,0.00020766744,0.00017587165,0.000114749615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018035208,0.0006768707,0.0006303287,0.0005121473,0.0007021674,0.0015207474,0.0016114633,0.0005594997,0.0016813651],"category_scores_gemma":[0.0037662224,0.0003471333,0.00070852804,0.0006293815,0.0010762393,0.0015708953,0.000855365,0.001533195,0.00028302506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025202453,0.000100043486,0.0010532305,0.00014002324,0.000060966795,0.00013230334,0.00014097794,0.78071344,0.014132498,0.14937127,0.00261048,0.051292777],"study_design_scores_gemma":[0.000019802446,0.00005092738,0.00007812898,0.0000050274116,0.000012451178,0.000028784538,0.000008224492,0.97726476,0.0011738811,0.01940874,0.0019371497,0.000012249282],"about_ca_topic_score_codex":0.0028639596,"about_ca_topic_score_gemma":0.0025402084,"teacher_disagreement_score":0.0028639596,"about_ca_system_score_codex":0.001861163,"about_ca_system_score_gemma":0.0023738728,"threshold_uncertainty_score":0.01350379},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016163334,0.007945746,0.0065460633,0.03268883,0.083410785,0.00044292604,0.0061315,0.0020896222,0.8591282],"genre_scores_gemma":[0.0057161176,0.003869054,0.0021461973,0.004591011,0.005878545,0.00015594176,0.0037771433,0.0005667031,0.9732992],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984267,0.00018749085,0.000086452106,0.00031597787,0.00076619245,0.00021729789],"domain_scores_gemma":[0.99408275,0.00044840324,0.00012458867,0.0005181124,0.0036980766,0.0011281196],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001476068,0.00088775414,0.000769135,0.0021226814,0.0021193933,0.004788054,0.0018377062,0.0021931317,0.5248372],"category_scores_gemma":[0.008136242,0.0003220236,0.0006329438,0.00202847,0.0005028769,0.003632718,0.002782834,0.0018875595,0.3461895],"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.00002643202,0.000014921579,0.00015284607,0.00007184618,0.000002554912,0.000040471452,0.00004929193,0.00007935291,0.00012025147,0.00684778,0.93171436,0.060879838],"study_design_scores_gemma":[0.0000034900675,0.0000062424965,0.00013027979,0.000056397355,0.0000014460431,0.00004368228,0.000064460466,0.000047679034,0.00006809584,0.0013615623,0.99821305,0.0000035130959],"about_ca_topic_score_codex":0.0025428375,"about_ca_topic_score_gemma":0.0031293924,"teacher_disagreement_score":0.4751628,"about_ca_system_score_codex":0.0023508363,"about_ca_system_score_gemma":0.0027657328,"threshold_uncertainty_score":0.67776203},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01297972,0.00037388614,0.9848608,0.000504287,0.00008980231,0.000030030278,0.0001347807,0.0003017553,0.0007249441],"genre_scores_gemma":[0.7794098,0.0019868957,0.20763667,0.00073220546,0.0011947552,0.0003636119,0.0013394591,0.00031814305,0.007018368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927146,0.004161903,0.00025716706,0.0012189554,0.0011777824,0.0004696875],"domain_scores_gemma":[0.89991903,0.09096097,0.0022174325,0.0036591862,0.0023733831,0.00086994056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01716257,0.0009983549,0.0024171926,0.0035511793,0.0013004453,0.0027836938,0.0043100626,0.0025471468,0.003962069],"category_scores_gemma":[0.087659135,0.0015831068,0.0020470717,0.0024622914,0.0031302185,0.0059064813,0.0021145882,0.0044469205,0.0005059825],"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.00015554855,0.0002514012,0.0029714326,0.0001778507,0.00027244692,0.00010278191,0.00015935091,0.53805393,0.00080706656,0.40961584,0.0033964645,0.044035982],"study_design_scores_gemma":[0.000014224814,0.00001368445,0.00023420132,0.000012834489,0.000014594428,0.000014013712,0.000009541076,0.80351174,0.0001336724,0.19579063,0.000239334,0.000011474673],"about_ca_topic_score_codex":0.010326384,"about_ca_topic_score_gemma":0.006812437,"teacher_disagreement_score":0.01716257,"about_ca_system_score_codex":0.0031200766,"about_ca_system_score_gemma":0.004079552,"threshold_uncertainty_score":0.090765476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8768553,0.00025861236,0.11319644,0.0014106027,0.00005228656,0.0000553962,0.000081311984,0.00008973461,0.008000343],"genre_scores_gemma":[0.9947831,0.00009473249,0.0040827715,0.00006912834,0.000013962318,0.000014607315,0.000011764988,0.000009142934,0.00092066015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991658,0.0003238022,0.000015208113,0.00007668982,0.0001097667,0.000308685],"domain_scores_gemma":[0.9972229,0.0017652282,0.00046523893,0.00009715846,0.00014833825,0.00030102578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014908051,0.00061025604,0.0006180433,0.00056802854,0.0009415581,0.0021063385,0.0011317715,0.0013862349,0.0024443192],"category_scores_gemma":[0.005980262,0.00031660017,0.0005390165,0.00060991186,0.0019069931,0.0020436242,0.0015604411,0.0016186007,0.00010107807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003624781,0.00024806248,0.005283482,0.000065496366,0.000052210882,0.0006974915,0.00035743846,0.765536,0.0051169405,0.21152541,0.0021042763,0.008650779],"study_design_scores_gemma":[0.000042621374,0.00009695498,0.0007946362,0.000008996099,0.000020900763,0.000055933506,0.0002581295,0.948552,0.0006752475,0.049190972,0.00028029367,0.000023300192],"about_ca_topic_score_codex":0.008697041,"about_ca_topic_score_gemma":0.0060126227,"teacher_disagreement_score":0.008697041,"about_ca_system_score_codex":0.0033546968,"about_ca_system_score_gemma":0.0022212195,"threshold_uncertainty_score":0.024340153},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08786608,0.0045293416,0.7526247,0.043428387,0.0012039277,0.00036644135,0.000334581,0.001215255,0.10843133],"genre_scores_gemma":[0.9117545,0.0017712583,0.07734456,0.0036545007,0.0006877247,0.00025024332,0.000097003736,0.00022814986,0.004212208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9877549,0.0051572886,0.00034054276,0.0011834188,0.0038144384,0.001749355],"domain_scores_gemma":[0.9841172,0.007503766,0.0013204876,0.0036464876,0.0022574095,0.0011546764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008241042,0.0013760476,0.0010219724,0.0009261717,0.002396286,0.006805949,0.0063404893,0.004371517,0.006969394],"category_scores_gemma":[0.029338717,0.00067940925,0.0009913944,0.0013337795,0.011232178,0.01463773,0.0067256102,0.009399403,0.0011002802],"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.0002435292,0.00015594075,0.00084788003,0.00020919282,0.000029255361,0.00015973121,0.00029898694,0.018364633,0.0020689028,0.9341098,0.0065605748,0.036951657],"study_design_scores_gemma":[0.0001336471,0.0004337928,0.00066492293,0.00035770374,0.00007289914,0.0006758295,0.0011103635,0.1441585,0.005202988,0.80372906,0.04332678,0.00013344295],"about_ca_topic_score_codex":0.005069559,"about_ca_topic_score_gemma":0.0036477179,"teacher_disagreement_score":0.008241042,"about_ca_system_score_codex":0.0034975489,"about_ca_system_score_gemma":0.0055206167,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6334987,0.0010172718,0.35351497,0.0039763856,0.00023675602,0.000100473626,0.0004829003,0.00041464393,0.006757892],"genre_scores_gemma":[0.9944457,0.00020394307,0.0035200436,0.00006245352,0.00007000362,0.000024264604,0.00010125149,0.00004422262,0.0015280582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997661,0.001033501,0.00008559935,0.00036240017,0.00029214832,0.00056539883],"domain_scores_gemma":[0.9705211,0.025102312,0.002106777,0.0004025192,0.0009534623,0.0009138209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005821894,0.0008043806,0.0019148735,0.0009177711,0.0011713655,0.0034278883,0.0017336715,0.0021693015,0.002591974],"category_scores_gemma":[0.027678303,0.0015925241,0.0008542638,0.0017385482,0.0020811884,0.0033535364,0.001346429,0.0020902695,0.00019222163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065076936,0.000016948688,0.00040887145,0.00001724925,0.000013604621,0.000048408143,0.00002379039,0.98985237,0.00014949814,0.008489666,0.00025499557,0.00065954943],"study_design_scores_gemma":[0.000004772099,0.0000068715144,0.00015422965,0.0000012867458,0.0000030050273,0.0000047902877,0.000012345382,0.99537635,0.000027583192,0.0043761088,0.000028393768,0.0000043173013],"about_ca_topic_score_codex":0.024020223,"about_ca_topic_score_gemma":0.011719826,"teacher_disagreement_score":0.024020223,"about_ca_system_score_codex":0.0055842237,"about_ca_system_score_gemma":0.002730407,"threshold_uncertainty_score":0.047760844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19228815,0.00063373696,0.7988662,0.0008744949,0.00013550553,0.00021711331,0.00033604616,0.00029801793,0.0063506775],"genre_scores_gemma":[0.9286726,0.00035889575,0.06494733,0.00017781816,0.00009566332,0.00018513612,0.0003172976,0.0001304419,0.0051147696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825996,0.00053851126,0.00005818046,0.0003359586,0.00023287126,0.0005744605],"domain_scores_gemma":[0.9974547,0.0012549104,0.0003720471,0.00012623805,0.00033482135,0.00045725517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00208318,0.0015726808,0.0020925177,0.0010795523,0.0012968421,0.0023132798,0.0024407592,0.0018266009,0.003887555],"category_scores_gemma":[0.00522232,0.0008938969,0.0012399837,0.0012034201,0.0016079174,0.0027238077,0.0016282356,0.0015550257,0.00047217228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023947567,0.00010587714,0.001082981,0.000115471055,0.000063295,0.00021842992,0.00016002881,0.94729716,0.0023986234,0.04029058,0.001623334,0.0064048315],"study_design_scores_gemma":[0.000024911653,0.00004848447,0.00020394668,0.0000070594187,0.000013367071,0.0000362627,0.00005902735,0.98615324,0.00027509168,0.01287301,0.00029400355,0.0000115427565],"about_ca_topic_score_codex":0.0069275936,"about_ca_topic_score_gemma":0.004305306,"teacher_disagreement_score":0.0069275936,"about_ca_system_score_codex":0.0032591561,"about_ca_system_score_gemma":0.0020337105,"threshold_uncertainty_score":0.023646891},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09360812,0.00027108236,0.90347147,0.0004266164,0.000076665354,0.0001406468,0.00006339145,0.0005420998,0.0013998329],"genre_scores_gemma":[0.8827651,0.00020262382,0.11506999,0.00010312194,0.00007204862,0.0001540455,0.00007217461,0.00005703936,0.0015038106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775106,0.0010405362,0.000100622,0.0003655048,0.00039403109,0.00034820012],"domain_scores_gemma":[0.9924993,0.0044685383,0.0011668502,0.0010483945,0.0005436722,0.0002732356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040930407,0.0006828139,0.001133102,0.00069389207,0.0012485113,0.0014866706,0.0024165795,0.0011219393,0.001787313],"category_scores_gemma":[0.011428382,0.00057232426,0.0006874724,0.0009679182,0.0017186981,0.0026499322,0.0013752575,0.001132125,0.00025134897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015982329,0.00007149472,0.00038100453,0.000053420474,0.000036372803,0.000080528844,0.00007227017,0.9297481,0.0038621104,0.05127913,0.00064067316,0.013614987],"study_design_scores_gemma":[0.000019594214,0.00004274541,0.00006207001,0.0000023804644,0.000008651514,0.000018729412,0.000011408558,0.98735166,0.0004779962,0.011730615,0.0002644677,0.000009790537],"about_ca_topic_score_codex":0.0019458242,"about_ca_topic_score_gemma":0.0020763306,"teacher_disagreement_score":0.0040930407,"about_ca_system_score_codex":0.0024628371,"about_ca_system_score_gemma":0.0016898481,"threshold_uncertainty_score":0.02164632},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16045558,0.0025194131,0.7952603,0.0025566658,0.00049420376,0.00010505516,0.00025525325,0.00024465667,0.038108826],"genre_scores_gemma":[0.9148066,0.0020725983,0.05754278,0.0005898801,0.0005271516,0.00016953207,0.00027636118,0.00016374342,0.023851262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993926,0.00013618128,0.000046808513,0.00005941602,0.00025147473,0.00011345798],"domain_scores_gemma":[0.998197,0.00075020635,0.00025784952,0.00008994697,0.00046418293,0.00024082263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023603027,0.0006908937,0.0007269658,0.0016129584,0.0009436992,0.0021357494,0.0011997112,0.0012931118,0.0033513312],"category_scores_gemma":[0.006311448,0.00029385823,0.0014559764,0.0011039743,0.0018810476,0.0031286133,0.0015030267,0.0014904396,0.00052865775],"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.000021524098,0.000027918744,0.0005121686,0.000045828085,0.000012203451,0.00023823699,0.00019054233,0.010683024,0.0017925779,0.9792355,0.0012284593,0.0060120877],"study_design_scores_gemma":[0.000018817329,0.000027845983,0.00047158677,0.000021338532,0.000015266593,0.0002344819,0.000082452934,0.28485247,0.0007014939,0.7117901,0.0017485485,0.000035645866],"about_ca_topic_score_codex":0.0021371748,"about_ca_topic_score_gemma":0.0013103473,"teacher_disagreement_score":0.0033513312,"about_ca_system_score_codex":0.0015372802,"about_ca_system_score_gemma":0.0013206651,"threshold_uncertainty_score":0.0124825835},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018332416,0.010634308,0.56140476,0.005707893,0.0023972576,0.00013385079,0.0032989683,0.0014514776,0.3966391],"genre_scores_gemma":[0.4389349,0.012196944,0.05306018,0.0015641997,0.0024161064,0.00043697658,0.003733352,0.0005938876,0.48706356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997602,0.000054078093,0.0000066251196,0.000064034626,0.0000779817,0.000037047437],"domain_scores_gemma":[0.9996637,0.00010287772,0.00002881709,0.000049171173,0.000115216266,0.000040193012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003111354,0.00090125314,0.00119184,0.0007406309,0.00078174035,0.0021462557,0.001659135,0.0020710682,0.01991563],"category_scores_gemma":[0.0017276971,0.00032389964,0.0006942006,0.0011826166,0.00085874676,0.0024873232,0.0008633137,0.0014751443,0.0056435755],"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.000022499551,0.000032715714,0.00027151278,0.000060760554,0.000022998522,0.00013757052,0.00005705368,0.10719651,0.00068123755,0.84317076,0.0344009,0.013945478],"study_design_scores_gemma":[0.000025351479,0.000015181055,0.00028394704,0.00002263727,0.000016693937,0.00012636163,0.000024039271,0.36928335,0.00016892357,0.5783079,0.051695727,0.000029888039],"about_ca_topic_score_codex":0.007478004,"about_ca_topic_score_gemma":0.0029047458,"teacher_disagreement_score":0.01991563,"about_ca_system_score_codex":0.0012650135,"about_ca_system_score_gemma":0.0014372926,"threshold_uncertainty_score":0.06662446},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37705943,0.00034773446,0.6163636,0.00025532636,0.00002664491,0.00015105795,0.00014916687,0.00044346903,0.0052036056],"genre_scores_gemma":[0.9456816,0.000110544905,0.053403266,0.00003841098,0.000010069602,0.000068050795,0.00007002446,0.00004482381,0.00057325035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986355,0.00049392605,0.000067023844,0.00022474007,0.00036288978,0.00021591886],"domain_scores_gemma":[0.9951552,0.0033395614,0.0007444569,0.00027210268,0.00035781213,0.00013092923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033099472,0.0007659493,0.001031232,0.00069709204,0.00038490252,0.0012043684,0.0010869007,0.00065469317,0.0009802637],"category_scores_gemma":[0.008253214,0.00094750716,0.0006247986,0.0012033295,0.0009771191,0.00152882,0.00047633058,0.0007378584,0.0001475011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028386428,0.000017705574,0.00020542383,0.00001077378,0.000010362573,0.000008881281,0.000009388019,0.9945327,0.0006294241,0.0025804935,0.0000655848,0.0019008004],"study_design_scores_gemma":[0.000009251148,0.000024276029,0.00018132235,0.0000015598664,0.0000058072087,0.000004222506,0.000004139442,0.9971957,0.00059434946,0.0019244035,0.000050334264,0.0000046007635],"about_ca_topic_score_codex":0.0068553872,"about_ca_topic_score_gemma":0.006056221,"teacher_disagreement_score":0.0068553872,"about_ca_system_score_codex":0.001955331,"about_ca_system_score_gemma":0.0035127285,"threshold_uncertainty_score":0.01750487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009612184,0.0011013226,0.98511976,0.0007098213,0.00008480898,0.00003264356,0.000047138616,0.00006721616,0.0032250793],"genre_scores_gemma":[0.66065353,0.00600397,0.3136032,0.000585639,0.0007244785,0.0005614461,0.00030517773,0.0001772944,0.017385308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987276,0.0007101588,0.0000623053,0.00013215476,0.00026097614,0.000106842715],"domain_scores_gemma":[0.99033874,0.0074424366,0.0009025287,0.00025632954,0.00074644503,0.00031345588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003816914,0.0011027177,0.00089067343,0.0014909728,0.00089679786,0.0013954398,0.0011470885,0.0017130141,0.0032038868],"category_scores_gemma":[0.016437534,0.0006611169,0.0011552464,0.0013805111,0.0024841228,0.0023580494,0.0020937608,0.0026636866,0.00045229064],"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.00001610782,0.000033568605,0.0005552521,0.00009010005,0.00003975846,0.0001507639,0.00021000394,0.14164351,0.0005481663,0.849279,0.00071743544,0.0067163366],"study_design_scores_gemma":[0.000008040671,0.000011180732,0.00008436815,0.000023324505,0.0000061016144,0.000030198456,0.000035951824,0.67478764,0.00013161973,0.3239561,0.00090933184,0.000016067213],"about_ca_topic_score_codex":0.004893519,"about_ca_topic_score_gemma":0.004095228,"teacher_disagreement_score":0.004893519,"about_ca_system_score_codex":0.0015265747,"about_ca_system_score_gemma":0.0019843113,"threshold_uncertainty_score":0.020186007},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018066502,0.00013081466,0.9972682,0.000047892536,0.000024982372,0.000010022358,0.000012488285,0.00021887849,0.00048006195],"genre_scores_gemma":[0.31995344,0.00089935696,0.6722906,0.00030833718,0.00035105977,0.00038442775,0.00018075197,0.00064864417,0.004983374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763894,0.00087267946,0.00008498966,0.00025686034,0.00095248525,0.00019404132],"domain_scores_gemma":[0.9914341,0.0058319615,0.00051343197,0.0011218952,0.0010001789,0.00009838789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031832973,0.00089368364,0.0009474389,0.001512131,0.00069268426,0.0012594092,0.002139848,0.0011187323,0.0028637403],"category_scores_gemma":[0.019322863,0.00053305656,0.0014472717,0.0012635605,0.0009188758,0.0026116574,0.0025118112,0.00351537,0.0009910067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014975233,0.00005636272,0.0017741985,0.00016693975,0.00014325694,0.000198584,0.00046069638,0.503835,0.012426368,0.2324419,0.0034919304,0.24485497],"study_design_scores_gemma":[0.0000042391293,0.000014716815,0.00014833662,0.0000099868075,0.000008270026,0.0000613458,0.000015806796,0.9632275,0.001139679,0.032877557,0.0024813546,0.00001126744],"about_ca_topic_score_codex":0.0027649913,"about_ca_topic_score_gemma":0.0018605562,"teacher_disagreement_score":0.0031832973,"about_ca_system_score_codex":0.0010499556,"about_ca_system_score_gemma":0.0012733024,"threshold_uncertainty_score":0.016835034},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043404456,0.015153032,0.55443805,0.003454858,0.0030928461,0.000056438093,0.0003049854,0.0007612918,0.41839802],"genre_scores_gemma":[0.15010896,0.0124743385,0.14787348,0.0014919821,0.002283302,0.00021471814,0.00082385016,0.00074497407,0.68398446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994407,0.00014258471,0.000020602269,0.00010773661,0.00024978258,0.000038461265],"domain_scores_gemma":[0.99951994,0.00017456987,0.00002026755,0.00012096693,0.00012852301,0.000035710214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007581566,0.00096266274,0.0010309224,0.0012323832,0.0008398712,0.002041995,0.0010005139,0.0013060464,0.026599765],"category_scores_gemma":[0.0029857615,0.0004881053,0.0006948526,0.0012947379,0.0012793399,0.0027157564,0.0013227497,0.0028026989,0.00939614],"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.000006167233,0.000010815369,0.000035003686,0.000029373776,0.0000052268942,0.000014673607,0.000040186962,0.0021247887,0.00024070549,0.9566554,0.018169329,0.02266821],"study_design_scores_gemma":[0.000006035259,0.000008464157,0.00010619849,0.00003296779,0.0000062938016,0.00006825413,0.000018911382,0.020513032,0.00033828596,0.8466722,0.13222057,0.000008792882],"about_ca_topic_score_codex":0.001713076,"about_ca_topic_score_gemma":0.0013991565,"teacher_disagreement_score":0.026599765,"about_ca_system_score_codex":0.0014721068,"about_ca_system_score_gemma":0.0007851753,"threshold_uncertainty_score":0.088985085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76102597,0.0015013374,0.2276236,0.00035560367,0.000102544924,0.00028973207,0.00032050116,0.00091156084,0.007869237],"genre_scores_gemma":[0.98705196,0.00019991069,0.01211826,0.000023278864,0.000019832478,0.00007182886,0.00015253911,0.000024397157,0.00033793887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939487,0.0024946565,0.0002737539,0.0002656595,0.0027308466,0.00028652526],"domain_scores_gemma":[0.9878792,0.0071029854,0.001095929,0.0008252401,0.0028720694,0.00022466028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060974117,0.000952679,0.00093592564,0.001716421,0.00046350382,0.0007819247,0.0012338674,0.0009488396,0.0007211362],"category_scores_gemma":[0.022321168,0.00021196861,0.00046251563,0.0012200066,0.00054566737,0.0013811048,0.0009254982,0.0007326926,0.00012286786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004911479,0.00024231593,0.0064405636,0.0001636333,0.00012764928,0.0000824234,0.00012966551,0.9158625,0.009758006,0.009814297,0.0008441592,0.056043588],"study_design_scores_gemma":[0.000008352112,0.00016242624,0.0007041563,0.0000043774894,0.000008102953,0.000021148191,0.000022643304,0.9967456,0.0014080332,0.00069812464,0.00021082252,0.0000061760525],"about_ca_topic_score_codex":0.005278194,"about_ca_topic_score_gemma":0.0023123797,"teacher_disagreement_score":0.0060974117,"about_ca_system_score_codex":0.0031100502,"about_ca_system_score_gemma":0.0010537565,"threshold_uncertainty_score":0.03224653},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005581678,0.07099623,0.49256474,0.01315638,0.0064471723,0.00035906886,0.0018952987,0.0023930585,0.40660638],"genre_scores_gemma":[0.30544314,0.07280735,0.17393398,0.0066349944,0.0073043257,0.0009902777,0.0041243434,0.00056035724,0.42820126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984176,0.00043186435,0.00011732098,0.00030917628,0.0005981305,0.00012595195],"domain_scores_gemma":[0.9987507,0.00044180383,0.00008266125,0.0002709655,0.00036099684,0.000092863585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012950068,0.0012614995,0.0011023586,0.0011673477,0.001558872,0.004928398,0.0013493849,0.0019889078,0.024437686],"category_scores_gemma":[0.0039755404,0.00058263756,0.00065446296,0.0020653896,0.001601045,0.0042118086,0.0022442269,0.0025748766,0.011272178],"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.000027571681,0.000042393684,0.00027793986,0.0002452579,0.000028923107,0.00014723328,0.0003206619,0.0049059326,0.0007533255,0.83298284,0.07336969,0.0868982],"study_design_scores_gemma":[0.000019654148,0.00005564033,0.00030158987,0.00015439162,0.00001848872,0.00029807567,0.0001184482,0.016610002,0.00048390764,0.50802475,0.47388572,0.0000293318],"about_ca_topic_score_codex":0.0023305346,"about_ca_topic_score_gemma":0.0019345345,"teacher_disagreement_score":0.024437686,"about_ca_system_score_codex":0.0024237079,"about_ca_system_score_gemma":0.0018900791,"threshold_uncertainty_score":0.08175224},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3492758,0.0011234714,0.6415472,0.00094449054,0.00013673042,0.00009804195,0.00030726363,0.00025151152,0.0063155536],"genre_scores_gemma":[0.9051035,0.00073201134,0.09080659,0.00014838619,0.00027864048,0.00009803623,0.0004676304,0.000039301816,0.0023260743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992337,0.00019456998,0.00004488372,0.00013102824,0.00023301638,0.00016283868],"domain_scores_gemma":[0.9935986,0.0029650233,0.0013063932,0.00040934279,0.0011484808,0.00057222066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017589034,0.00040982975,0.0005482433,0.002364299,0.00088737824,0.0014287838,0.00094416965,0.0014050838,0.0016074512],"category_scores_gemma":[0.008810389,0.00019908932,0.00062148523,0.0018002378,0.0013456938,0.0018381998,0.00063124317,0.0011349849,0.0002384819],"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.0000813687,0.000090982736,0.008618736,0.000111093155,0.000030354991,0.0002287879,0.00036724904,0.08596367,0.0040927553,0.86188394,0.0023405463,0.036190465],"study_design_scores_gemma":[0.000008720022,0.000045288976,0.0019298252,0.00002054827,0.000007077493,0.00014389624,0.0000590803,0.6387965,0.0007060997,0.35711122,0.0011454266,0.000026315847],"about_ca_topic_score_codex":0.0021399437,"about_ca_topic_score_gemma":0.0013428106,"teacher_disagreement_score":0.002364299,"about_ca_system_score_codex":0.0012933478,"about_ca_system_score_gemma":0.0008334911,"threshold_uncertainty_score":0.009383917},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021204257,0.018362803,0.4814669,0.014234671,0.001293233,0.004180428,0.08858034,0.016697085,0.3539803],"genre_scores_gemma":[0.14115103,0.0263657,0.5851226,0.0016587214,0.00039420056,0.008157508,0.1278759,0.0038407831,0.1054335],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964294,0.0008717449,0.0004744911,0.00016295208,0.0018934555,0.00016802119],"domain_scores_gemma":[0.99047905,0.0023651305,0.0009669021,0.00043244334,0.005487416,0.00026899806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062283273,0.0011749353,0.0005997342,0.0047766455,0.000653207,0.0035860739,0.0012237966,0.0015157625,0.013425185],"category_scores_gemma":[0.023521947,0.00082319,0.000957741,0.0063180784,0.00037563246,0.006604563,0.0014767098,0.002659072,0.0109418165],"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.00007294811,0.00015811673,0.009564124,0.0014379933,0.00007912795,0.00009932823,0.0012316993,0.010537196,0.0010124105,0.08797724,0.367678,0.5201518],"study_design_scores_gemma":[0.00006440571,0.00017373744,0.016955703,0.0028927287,0.00012247538,0.00028997898,0.000710283,0.012236548,0.0020226457,0.0897051,0.87469566,0.00013063337],"about_ca_topic_score_codex":0.012828519,"about_ca_topic_score_gemma":0.01110783,"teacher_disagreement_score":0.013425185,"about_ca_system_score_codex":0.0027023235,"about_ca_system_score_gemma":0.009138362,"threshold_uncertainty_score":0.044911683},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08242598,0.00030590332,0.9076943,0.0012250412,0.000040467075,0.0000945191,0.00020608775,0.0001744245,0.007833246],"genre_scores_gemma":[0.70519185,0.00040771603,0.28636086,0.00025925206,0.00011232987,0.0003762359,0.0005319311,0.00009602504,0.006663759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893004,0.0002985549,0.000054912205,0.00020652838,0.0003105996,0.00019945575],"domain_scores_gemma":[0.9948726,0.0034834412,0.0004979683,0.00031282083,0.0005332509,0.0002998687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016977045,0.00057158776,0.00090492,0.0012093005,0.0012599521,0.0020938553,0.0018666364,0.0013671903,0.004706614],"category_scores_gemma":[0.008240859,0.00049457117,0.000893587,0.0012360452,0.0018626314,0.0024675357,0.0024844655,0.002051953,0.00055256556],"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.00010654333,0.00008849869,0.0017495224,0.00016928723,0.000041876883,0.00021490903,0.0002777996,0.41498885,0.0018591583,0.5573395,0.0020383867,0.021125691],"study_design_scores_gemma":[0.000014706664,0.000014590017,0.00019497857,0.000007556493,0.000005547186,0.000035550725,0.00003513534,0.87282366,0.00026379342,0.12607121,0.00052245695,0.000010735477],"about_ca_topic_score_codex":0.0036877773,"about_ca_topic_score_gemma":0.003351218,"teacher_disagreement_score":0.004706614,"about_ca_system_score_codex":0.002382032,"about_ca_system_score_gemma":0.0025618211,"threshold_uncertainty_score":0.017282903},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12451315,0.0040360778,0.8392886,0.0032329366,0.0004995637,0.00012988818,0.00045149704,0.0018041317,0.026044149],"genre_scores_gemma":[0.9557208,0.0021204015,0.022661822,0.00046404477,0.00045032322,0.00016060444,0.0004417551,0.0003096762,0.017670559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983064,0.00043319762,0.00005743242,0.00022291215,0.000634951,0.00034506197],"domain_scores_gemma":[0.9740336,0.018914409,0.0014303381,0.0009541315,0.003575636,0.0010919711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005856645,0.0009144133,0.0013354714,0.0023533425,0.00091073354,0.002542256,0.002646469,0.0014160615,0.007441784],"category_scores_gemma":[0.04154418,0.00077691645,0.00060481194,0.0013695948,0.0021429698,0.003632756,0.0019726802,0.0034828684,0.0011458308],"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.00041259336,0.00020735558,0.0038386073,0.0004737711,0.000096497606,0.0003383309,0.0006018489,0.5943799,0.0060334136,0.35694343,0.007859593,0.0288146],"study_design_scores_gemma":[0.000012059677,0.00002276878,0.0003491261,0.00002264811,0.000012017428,0.000029666366,0.000032275155,0.97680944,0.00018089992,0.022161543,0.00035233246,0.000015266072],"about_ca_topic_score_codex":0.011866052,"about_ca_topic_score_gemma":0.004891086,"teacher_disagreement_score":0.011866052,"about_ca_system_score_codex":0.0041231695,"about_ca_system_score_gemma":0.0028157616,"threshold_uncertainty_score":0.030973315},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33527258,0.001144386,0.6493711,0.002998576,0.00063054694,0.0003005586,0.0011063119,0.0011095155,0.0080665685],"genre_scores_gemma":[0.9816491,0.0003705153,0.007986661,0.0001661774,0.00024714024,0.000115933755,0.00023080644,0.00006356088,0.009170101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99314743,0.0012290133,0.00034644548,0.0015148179,0.0013723999,0.0023899334],"domain_scores_gemma":[0.9762414,0.014640127,0.002850482,0.0015303026,0.0032403164,0.001497303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006615243,0.0017268314,0.0038742167,0.002121834,0.00254195,0.0072633177,0.0056683198,0.0037517832,0.006845129],"category_scores_gemma":[0.020442657,0.0016500595,0.0016070596,0.0035361536,0.003864863,0.0057263356,0.0036246066,0.00472121,0.0012664637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013093895,0.00044293204,0.0060110954,0.0003177247,0.00025179976,0.0016983758,0.0007073432,0.6311626,0.005184209,0.3298835,0.0044053756,0.018625656],"study_design_scores_gemma":[0.00005316683,0.00006331287,0.00050384126,0.000011923543,0.00004569083,0.000107230866,0.000051976243,0.9781294,0.00044855982,0.020143893,0.00040400197,0.00003703175],"about_ca_topic_score_codex":0.011176229,"about_ca_topic_score_gemma":0.0091222795,"teacher_disagreement_score":0.011176229,"about_ca_system_score_codex":0.0068705846,"about_ca_system_score_gemma":0.0028390908,"threshold_uncertainty_score":0.04984981},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024378598,0.0071799355,0.9175106,0.0018211723,0.00034140045,0.00021061352,0.00077527546,0.0009382628,0.046844125],"genre_scores_gemma":[0.72069407,0.019114144,0.23490097,0.0005532715,0.0005037729,0.0008036606,0.0014746129,0.00037270825,0.021582749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878615,0.000490433,0.00009006772,0.0001697826,0.00033155258,0.00013202269],"domain_scores_gemma":[0.9989961,0.00055569096,0.00010362909,0.00009191042,0.00019781665,0.000054939926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013,0.0008818742,0.0010119732,0.000784737,0.00069849193,0.0028351478,0.0023916832,0.0017653485,0.004325992],"category_scores_gemma":[0.0035379755,0.00044758883,0.000859773,0.0013144165,0.0008381655,0.0016524288,0.0012275273,0.0012410507,0.0010328237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000176035,0.000015185169,0.00043612544,0.000090765236,0.000025256306,0.000061262625,0.000072233765,0.9217447,0.0004645164,0.06574359,0.0014186825,0.009910052],"study_design_scores_gemma":[0.00001569141,0.000019258436,0.00029109963,0.00005147469,0.000023270775,0.00004961464,0.00004674218,0.944701,0.00050945807,0.036504947,0.017761916,0.000025544057],"about_ca_topic_score_codex":0.016102897,"about_ca_topic_score_gemma":0.0054972046,"teacher_disagreement_score":0.016102897,"about_ca_system_score_codex":0.0021252474,"about_ca_system_score_gemma":0.0026112662,"threshold_uncertainty_score":0.032018363},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10716817,0.0056657176,0.83579516,0.007949425,0.0011193221,0.00019834773,0.0015716304,0.00066052703,0.03987169],"genre_scores_gemma":[0.9180622,0.0031841197,0.02121705,0.0007116914,0.0007626649,0.0002952747,0.0007712289,0.00025341133,0.05474229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702245,0.0012534607,0.00012047277,0.0004303022,0.00041007833,0.000763223],"domain_scores_gemma":[0.99002844,0.006861929,0.0008707776,0.00039187793,0.00097306696,0.00087389693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048382804,0.0017258542,0.0031849835,0.0019990765,0.0019517655,0.0069631427,0.0065995306,0.0049858,0.013317195],"category_scores_gemma":[0.015904004,0.0021627964,0.0017002102,0.0034254605,0.0036978177,0.008364978,0.0026034256,0.0042412993,0.0017360754],"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.00008768263,0.000095832,0.0007670967,0.00009798435,0.00004868786,0.0001502499,0.00028040583,0.37662867,0.00028491262,0.61291796,0.0050202897,0.0036201994],"study_design_scores_gemma":[0.000026646314,0.00001723922,0.00013352057,0.000015371854,0.000021174876,0.000026923772,0.000070562935,0.8961123,0.000042696214,0.10216555,0.001348258,0.000019695037],"about_ca_topic_score_codex":0.028122338,"about_ca_topic_score_gemma":0.015548933,"teacher_disagreement_score":0.028122338,"about_ca_system_score_codex":0.006625258,"about_ca_system_score_gemma":0.0033068655,"threshold_uncertainty_score":0.055917263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63781464,0.0010341655,0.34782138,0.0009928637,0.00008820132,0.000058631045,0.00014570024,0.0006358943,0.01140848],"genre_scores_gemma":[0.98627037,0.0003870167,0.010597273,0.00012072918,0.00009069359,0.00005425239,0.000121632795,0.000057681573,0.0023004804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993979,0.00014440571,0.000020000536,0.00009364311,0.00017057151,0.00017342044],"domain_scores_gemma":[0.99525744,0.0024739963,0.0006832271,0.00031077876,0.0007457641,0.0005287554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002135705,0.0007029055,0.0007815697,0.0014616193,0.0007110098,0.0018170867,0.0019571856,0.001081726,0.002324029],"category_scores_gemma":[0.014262445,0.00040642798,0.0005611826,0.0009164731,0.0021870045,0.0028412126,0.0011715288,0.0020156347,0.00035465098],"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.00029835047,0.00014332116,0.0044868,0.00017592894,0.00006028693,0.00087580725,0.0005904163,0.15596701,0.013050472,0.81127274,0.0021253396,0.010953529],"study_design_scores_gemma":[0.000026648993,0.0000755218,0.0015933373,0.000027529455,0.000029439938,0.00018011084,0.00009542963,0.8819077,0.0018250289,0.11371829,0.0004828767,0.00003822064],"about_ca_topic_score_codex":0.004928222,"about_ca_topic_score_gemma":0.0020069536,"teacher_disagreement_score":0.004928222,"about_ca_system_score_codex":0.0020995103,"about_ca_system_score_gemma":0.0010904139,"threshold_uncertainty_score":0.015233099},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015611087,0.011002092,0.0077000456,0.045550335,0.11949436,0.0005152951,0.007737267,0.0021537435,0.8042858],"genre_scores_gemma":[0.0053147655,0.005223418,0.0022180902,0.0062438706,0.009041984,0.00018370323,0.0042884136,0.0006663193,0.96681935],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832934,0.00022341251,0.00011197082,0.0003565991,0.0007850063,0.00019371377],"domain_scores_gemma":[0.9933559,0.00065862783,0.0001578709,0.0006647647,0.0040942053,0.0010687016],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016080614,0.0009877961,0.00084452407,0.0021397257,0.0020802428,0.004710679,0.0019987195,0.0022595946,0.53066087],"category_scores_gemma":[0.010962963,0.0003466326,0.00064898096,0.0023188475,0.0005806299,0.0041802945,0.0026832956,0.0020518114,0.3601553],"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.000020429174,0.000013502794,0.00012551689,0.00007119393,0.0000021783285,0.000037093527,0.00004830955,0.000068367684,0.000084750005,0.006770845,0.9379273,0.054830484],"study_design_scores_gemma":[0.000003374627,0.0000054398133,0.00012652921,0.00006390595,0.0000013972234,0.00004430361,0.000054588832,0.000046327303,0.000049581744,0.0016030067,0.9979977,0.0000037026073],"about_ca_topic_score_codex":0.0027191085,"about_ca_topic_score_gemma":0.0031152512,"teacher_disagreement_score":0.46933913,"about_ca_system_score_codex":0.0024161865,"about_ca_system_score_gemma":0.0028719802,"threshold_uncertainty_score":0.6694553},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5020033,0.0007340349,0.49015066,0.0025431106,0.00011166122,0.00009504931,0.000107982865,0.00029537955,0.0039588297],"genre_scores_gemma":[0.99056,0.0002580258,0.007758291,0.00008345582,0.00005660923,0.000047839443,0.00003497139,0.000040821487,0.0011599768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962883,0.0017918424,0.00015847321,0.00040669742,0.0007195803,0.00063511636],"domain_scores_gemma":[0.9459256,0.04146424,0.006350413,0.002658332,0.002035704,0.0015658237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010466552,0.00068184757,0.0011743904,0.0010096346,0.0010626388,0.002417135,0.0022427004,0.0016924273,0.0018214467],"category_scores_gemma":[0.07331793,0.0008029324,0.00076960976,0.0010735124,0.0032026018,0.004155356,0.0016602144,0.0031001389,0.00021076627],"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.00033754212,0.00012620896,0.00419737,0.00008203055,0.00006712438,0.0002545587,0.00045358553,0.3670597,0.0046740402,0.6105082,0.001217006,0.0110226385],"study_design_scores_gemma":[0.000014853527,0.00004425082,0.0009281193,0.000013513138,0.000014286935,0.00006532318,0.00005249636,0.90782183,0.00053444353,0.09028508,0.00019404113,0.000031672113],"about_ca_topic_score_codex":0.0016024358,"about_ca_topic_score_gemma":0.0012290727,"teacher_disagreement_score":0.010466552,"about_ca_system_score_codex":0.0035147485,"about_ca_system_score_gemma":0.0018813915,"threshold_uncertainty_score":0.055353045},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015272874,0.03063607,0.34188786,0.005015791,0.005569892,0.000088127425,0.0005530674,0.0013093697,0.61341256],"genre_scores_gemma":[0.07074324,0.03521864,0.06694504,0.0023224698,0.0059392606,0.0002432817,0.0012197611,0.00081020856,0.8165581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999258,0.00012035798,0.000024919838,0.00014093755,0.00039861634,0.00005718184],"domain_scores_gemma":[0.99946886,0.00016097022,0.000018505158,0.00012222365,0.00019035225,0.00003910334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064228196,0.001394929,0.0010836868,0.0015776587,0.000970361,0.002978643,0.0012249739,0.0013071975,0.03436622],"category_scores_gemma":[0.0019342168,0.00047436796,0.000568519,0.0018064025,0.0014141735,0.0030418441,0.0013728779,0.0031259893,0.023941513],"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.0000072717357,0.000035050238,0.000070690476,0.00012027241,0.000012575738,0.00003553019,0.00010241261,0.0033161913,0.00047139864,0.7545365,0.12622668,0.11506538],"study_design_scores_gemma":[0.0000037611176,0.000010941077,0.00012835083,0.00009728176,0.0000086251775,0.00007562775,0.000030180949,0.008890437,0.00037303433,0.6160532,0.3743148,0.000013792554],"about_ca_topic_score_codex":0.00230691,"about_ca_topic_score_gemma":0.00195737,"teacher_disagreement_score":0.03436622,"about_ca_system_score_codex":0.0026442346,"about_ca_system_score_gemma":0.0018881911,"threshold_uncertainty_score":0.11496645},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06395921,0.009857173,0.8826452,0.0065647303,0.0011167701,0.0001223018,0.00029001158,0.00044150732,0.035003148],"genre_scores_gemma":[0.9013379,0.004985663,0.08377276,0.0020119832,0.0019384949,0.00016959029,0.00016898519,0.00020481461,0.005409938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951924,0.001352618,0.00027629733,0.0007075323,0.0019735896,0.0004975034],"domain_scores_gemma":[0.9809183,0.015329551,0.0009965259,0.0011875422,0.0011536714,0.0004144196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057645217,0.0008520855,0.001275828,0.0012589961,0.0010663383,0.0023580987,0.0012992492,0.0021701625,0.0021683634],"category_scores_gemma":[0.024002606,0.00063837925,0.0010462531,0.0013027715,0.0049729883,0.0053553046,0.0024190685,0.0040898817,0.000291826],"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.00018887274,0.000055641452,0.0013290613,0.00011485816,0.00004876107,0.00011148755,0.00021575006,0.07235237,0.002240323,0.9015959,0.002212269,0.019534698],"study_design_scores_gemma":[0.00005242874,0.00010493084,0.0004772676,0.000049650414,0.000021766542,0.000036162015,0.000015579839,0.15990892,0.0009093101,0.83386886,0.004525497,0.000029527582],"about_ca_topic_score_codex":0.0043799654,"about_ca_topic_score_gemma":0.0014064186,"teacher_disagreement_score":0.0057645217,"about_ca_system_score_codex":0.0030738278,"about_ca_system_score_gemma":0.0018207445,"threshold_uncertainty_score":0.030486107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2821915,0.00040721663,0.7030899,0.0012528218,0.00018372116,0.00035338153,0.00017506588,0.0004948553,0.011851569],"genre_scores_gemma":[0.91970485,0.00030173443,0.06519566,0.00020736798,0.00017520634,0.0004142533,0.00020045062,0.00008575501,0.013714785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927174,0.0029603883,0.00038751308,0.0012303795,0.0018502225,0.0008540322],"domain_scores_gemma":[0.9711807,0.019512767,0.003962764,0.0018882557,0.0018278282,0.0016276541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009955421,0.0008504421,0.0015909745,0.0018633336,0.0020982926,0.00432132,0.0025489307,0.003248771,0.007380847],"category_scores_gemma":[0.02935145,0.0012529447,0.0017941805,0.0015119417,0.00386674,0.0068216287,0.0046552513,0.0031182454,0.001683703],"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.00051111996,0.00020777482,0.006079896,0.00011914301,0.000081847145,0.0019237392,0.0021170871,0.07190415,0.00401096,0.89822793,0.0010773266,0.013739026],"study_design_scores_gemma":[0.00017773142,0.00027310872,0.0012255973,0.000055379278,0.00009562468,0.00070070056,0.0004450512,0.60025656,0.003827841,0.38992313,0.002863815,0.00015540897],"about_ca_topic_score_codex":0.0017089547,"about_ca_topic_score_gemma":0.0011313526,"teacher_disagreement_score":0.009955421,"about_ca_system_score_codex":0.0020619722,"about_ca_system_score_gemma":0.0012371872,"threshold_uncertainty_score":0.052649915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72281826,0.00071113184,0.24776068,0.002984046,0.0004039083,0.0002281427,0.00044461768,0.00070053956,0.023948647],"genre_scores_gemma":[0.9822634,0.00021167005,0.011641688,0.00025277407,0.00022995725,0.00006488092,0.00008223083,0.000026177713,0.0052272016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990181,0.00016839377,0.00003880396,0.00015178505,0.00016039114,0.00046254598],"domain_scores_gemma":[0.99850047,0.00052800565,0.00039977164,0.000112929294,0.00024456132,0.000214181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015286715,0.0011211343,0.0010905426,0.00096067315,0.0013537639,0.002277724,0.0022260384,0.0021539212,0.0022668312],"category_scores_gemma":[0.0035793772,0.0005236429,0.00075963547,0.0012879034,0.0022460576,0.0019677726,0.0014833679,0.001674888,0.00052647205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013473894,0.00069234375,0.010159447,0.00034893685,0.00012382069,0.004891488,0.0008585541,0.46663874,0.0235541,0.46374375,0.007417822,0.020223586],"study_design_scores_gemma":[0.0001290089,0.00020746245,0.0010987037,0.00001669562,0.00005671854,0.0005009312,0.00016776852,0.951999,0.0022788846,0.041947845,0.0015352356,0.00006163612],"about_ca_topic_score_codex":0.008438618,"about_ca_topic_score_gemma":0.004854588,"teacher_disagreement_score":0.008438618,"about_ca_system_score_codex":0.0019565132,"about_ca_system_score_gemma":0.0015097269,"threshold_uncertainty_score":0.016779006},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014780228,0.010454103,0.0043289894,0.049645882,0.097677976,0.00033561423,0.00467068,0.0013425171,0.83006614],"genre_scores_gemma":[0.005860773,0.0057341605,0.0015987135,0.007408167,0.009168477,0.00013108611,0.0032954807,0.00040605696,0.9663971],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859387,0.00018876136,0.00007513923,0.0003003569,0.0006713124,0.00017066686],"domain_scores_gemma":[0.9944766,0.0005096057,0.00012673087,0.00043138865,0.003499015,0.00095661805],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012735424,0.0007852157,0.00064434053,0.0016976908,0.0020732642,0.0043818625,0.0015532419,0.0018713109,0.46529263],"category_scores_gemma":[0.008274912,0.00027331253,0.00049654377,0.0018131221,0.00046217494,0.0037687852,0.00280684,0.0019074415,0.29641065],"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.0000134700085,0.00000953272,0.00011728472,0.00005214036,0.0000017563872,0.000028933378,0.00004610129,0.00003248268,0.00007098043,0.005062995,0.94741964,0.04714479],"study_design_scores_gemma":[0.0000024331391,0.000003965354,0.00012858638,0.000047807247,0.0000012311033,0.00003920302,0.000063799154,0.00002574643,0.0000383508,0.0011905438,0.99845576,0.0000025888212],"about_ca_topic_score_codex":0.0019837448,"about_ca_topic_score_gemma":0.002423542,"teacher_disagreement_score":0.46529263,"about_ca_system_score_codex":0.0018412408,"about_ca_system_score_gemma":0.0026337286,"threshold_uncertainty_score":0.76269513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009655175,0.017226327,0.0055946168,0.01713211,0.059913598,0.00018958788,0.0046168887,0.0010368492,0.8933245],"genre_scores_gemma":[0.004615059,0.006936259,0.0017572549,0.00264859,0.010045563,0.00008644827,0.0033038852,0.00057157327,0.9700354],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994301,0.00006046456,0.000029540444,0.00010807929,0.0003263855,0.000045409768],"domain_scores_gemma":[0.99856406,0.00031517498,0.00006575006,0.00015881521,0.00065758626,0.00023874184],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006153308,0.0007292138,0.0006438985,0.0019453418,0.0018052256,0.0035638344,0.0012014649,0.001276223,0.40462697],"category_scores_gemma":[0.004214491,0.00027545265,0.0004455158,0.0017276923,0.0006391229,0.003378516,0.0018037871,0.0027468097,0.24229454],"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.000015352103,0.000020609988,0.00006673517,0.000114906914,0.000001809485,0.000041021718,0.00010486018,0.00011081401,0.00014184321,0.020648018,0.9169405,0.06179355],"study_design_scores_gemma":[0.0000010082127,0.0000048623256,0.00008289822,0.00006946338,6.2197176e-7,0.000048487465,0.000025030815,0.000020893855,0.000040927807,0.0030856095,0.9966182,0.0000020291545],"about_ca_topic_score_codex":0.0015424981,"about_ca_topic_score_gemma":0.0022010615,"teacher_disagreement_score":0.59537303,"about_ca_system_score_codex":0.0016253128,"about_ca_system_score_gemma":0.0011495304,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066391163,0.0053746,0.0033205205,0.007459332,0.021989707,0.00051728915,0.023519592,0.0019563532,0.9351987],"genre_scores_gemma":[0.003069211,0.0051464923,0.0019100914,0.0035508794,0.006192085,0.00026018036,0.01823557,0.0008324815,0.96080303],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993123,0.00008510065,0.000047897243,0.00012401215,0.00036913544,0.000061532555],"domain_scores_gemma":[0.99619246,0.0006301805,0.00017029607,0.00032158152,0.0021248776,0.00056055887],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00067639217,0.0007423299,0.00093474524,0.0034809557,0.0015769858,0.0044338685,0.0014426152,0.000994712,0.79193413],"category_scores_gemma":[0.008306833,0.00029045145,0.0004419909,0.0032179428,0.00037423725,0.0026884214,0.0017280648,0.0014073558,0.7101666],"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.000013678602,0.000019549456,0.00012406717,0.00017593958,0.000002336215,0.000024482144,0.000024192235,0.00007986206,0.0001493369,0.0025788406,0.948042,0.04876577],"study_design_scores_gemma":[0.0000022537513,0.000009629959,0.00019509859,0.00012676578,0.0000019233266,0.000045155142,0.000029136894,0.000034070556,0.000054995242,0.0008983629,0.9985991,0.000003427435],"about_ca_topic_score_codex":0.0028609203,"about_ca_topic_score_gemma":0.0028137942,"teacher_disagreement_score":0.20806587,"about_ca_system_score_codex":0.0015686174,"about_ca_system_score_gemma":0.0025948924,"threshold_uncertainty_score":0.2967807},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19443412,0.0013737037,0.791158,0.0011639054,0.00017344371,0.00006434338,0.00020508512,0.00028996204,0.01113731],"genre_scores_gemma":[0.9740976,0.0006359568,0.017618638,0.000075848744,0.0001097341,0.000055938028,0.000117593416,0.000049655235,0.0072390013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879575,0.00027698133,0.000042202057,0.00022899361,0.00037487602,0.000281282],"domain_scores_gemma":[0.99660045,0.001797061,0.0006299972,0.00021059973,0.00044043348,0.0003215387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016392308,0.0007026457,0.0009597181,0.0010362403,0.00060406566,0.0016478781,0.0016432812,0.0011298545,0.0043037953],"category_scores_gemma":[0.007102341,0.0004935702,0.0007026537,0.0007981392,0.0021008104,0.0018934566,0.0008912108,0.0014476562,0.00041810758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010620235,0.000054955366,0.0012177995,0.000092603776,0.000034862067,0.0003651317,0.0002163437,0.6508622,0.0049943537,0.3352475,0.00082051597,0.005987486],"study_design_scores_gemma":[0.0000085455895,0.000025233761,0.00023921633,0.0000069365983,0.000008735319,0.000032913536,0.000022292726,0.96818036,0.00036772533,0.030534104,0.0005649925,0.000008975401],"about_ca_topic_score_codex":0.004878035,"about_ca_topic_score_gemma":0.0016315728,"teacher_disagreement_score":0.004878035,"about_ca_system_score_codex":0.002160366,"about_ca_system_score_gemma":0.0010516534,"threshold_uncertainty_score":0.01567465},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13237052,0.0015416654,0.85028636,0.001899883,0.0005220565,0.00022264468,0.00034432157,0.00043063026,0.012381901],"genre_scores_gemma":[0.94792306,0.0011442123,0.031543072,0.00032713302,0.00027195417,0.00032805905,0.00019782691,0.000072030656,0.01819268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981925,0.00048338826,0.00007716242,0.00034685808,0.00043301727,0.0004671623],"domain_scores_gemma":[0.99687153,0.0014776981,0.00046686342,0.00017129087,0.0006616706,0.00035096327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016126143,0.0013044551,0.002161095,0.0012042266,0.0015639323,0.0035061296,0.0025344917,0.0030006089,0.0028112116],"category_scores_gemma":[0.0062282803,0.00089198304,0.001205116,0.0010914936,0.002812815,0.00392465,0.0021038104,0.0017203522,0.00052390853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016807055,0.00009965754,0.0009523143,0.00009964442,0.0000531482,0.0005463473,0.0003368188,0.835717,0.003558835,0.15243657,0.0013546717,0.004676991],"study_design_scores_gemma":[0.000026419948,0.00003476551,0.00006415026,0.000007926022,0.000014212466,0.000034906476,0.000028389131,0.9865522,0.0002780227,0.012142981,0.0007961018,0.00001979176],"about_ca_topic_score_codex":0.011364982,"about_ca_topic_score_gemma":0.0029542502,"teacher_disagreement_score":0.011364982,"about_ca_system_score_codex":0.002265042,"about_ca_system_score_gemma":0.0025085006,"threshold_uncertainty_score":0.02259767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56206024,0.00617446,0.4154486,0.002090912,0.00024233597,0.0002324927,0.0006790474,0.0015559827,0.011515935],"genre_scores_gemma":[0.986121,0.0012274772,0.009385358,0.00020817567,0.00014302535,0.0000909669,0.00015086474,0.000068829715,0.0026041511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962882,0.0007667054,0.00013250038,0.00048826658,0.0010737492,0.0012504817],"domain_scores_gemma":[0.9831603,0.009148404,0.004003134,0.0013401341,0.0014420961,0.0009059909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072639054,0.0015051966,0.0015363371,0.0030459447,0.0013099499,0.0028555875,0.0042873244,0.0024466165,0.0031053734],"category_scores_gemma":[0.028020069,0.0007471655,0.0008572907,0.0023412448,0.0040661558,0.004752364,0.0024109213,0.002290501,0.00061292225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011691495,0.00028422827,0.010060323,0.0003378982,0.00009368331,0.0016207749,0.000791314,0.7179732,0.007289002,0.22851717,0.0057995864,0.026063643],"study_design_scores_gemma":[0.000049775485,0.00013388901,0.0027194459,0.00004858072,0.00004158616,0.00033975882,0.00014968497,0.9540508,0.0014903295,0.04036689,0.00054963265,0.000059704897],"about_ca_topic_score_codex":0.011491866,"about_ca_topic_score_gemma":0.0045451256,"teacher_disagreement_score":0.011491866,"about_ca_system_score_codex":0.005136574,"about_ca_system_score_gemma":0.0017945264,"threshold_uncertainty_score":0.03841561},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07829537,0.0030028627,0.85204095,0.006213673,0.00058008323,0.000040997318,0.00013713047,0.00048372225,0.059205215],"genre_scores_gemma":[0.9544694,0.002827213,0.03136371,0.0008318953,0.0006773214,0.000071090086,0.00015623622,0.00013577961,0.009467382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989967,0.0004410672,0.000028533696,0.00011364863,0.00029907777,0.00012103477],"domain_scores_gemma":[0.98790073,0.008988977,0.0007159103,0.00083673286,0.0011413335,0.0004163826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026586875,0.00075988594,0.00071047264,0.0014404875,0.0011625305,0.0016277249,0.0017389742,0.0015148983,0.0039369925],"category_scores_gemma":[0.02301523,0.0005091417,0.0007490252,0.0016912395,0.0036911762,0.0047321785,0.0016278202,0.0028284814,0.00038448704],"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.000027059992,0.00001868072,0.0007353477,0.000055027664,0.000022124068,0.000118593096,0.00015992254,0.09341144,0.00040466248,0.8900327,0.0072730174,0.007741384],"study_design_scores_gemma":[0.0000077441555,0.000009617741,0.00038115523,0.000019554513,0.000009116773,0.00009445647,0.000043400214,0.3796744,0.0002208556,0.6175962,0.0019322014,0.000011269915],"about_ca_topic_score_codex":0.0038943233,"about_ca_topic_score_gemma":0.0024268725,"teacher_disagreement_score":0.0039369925,"about_ca_system_score_codex":0.0020950513,"about_ca_system_score_gemma":0.0011762421,"threshold_uncertainty_score":0.015200794},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00570378,0.0032163677,0.57448554,0.0019112469,0.00093944464,0.00014084703,0.0008355682,0.0006610068,0.4121062],"genre_scores_gemma":[0.25093663,0.008310886,0.09930334,0.0012572225,0.0009930757,0.00044733906,0.0019327848,0.0003514739,0.63646716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944717,0.00010672115,0.000021833459,0.0001359835,0.0002296102,0.000058689606],"domain_scores_gemma":[0.99933136,0.0002902297,0.000035768877,0.000120648954,0.00017884251,0.000043210854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005119696,0.00083149737,0.000647526,0.0009162796,0.0007543643,0.0020932846,0.00077036436,0.0010759399,0.032559227],"category_scores_gemma":[0.0022151046,0.00039719552,0.00053311395,0.0010796146,0.0010358923,0.002065129,0.00096179324,0.0018164061,0.009448804],"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.0000068346885,0.000017528584,0.00007689649,0.000028659895,0.000005777652,0.00003615957,0.000047208847,0.0042490056,0.00029320738,0.96447796,0.0102989925,0.020461781],"study_design_scores_gemma":[0.000008138395,0.000012643133,0.00016858074,0.000039102095,0.000011679101,0.000121322875,0.000030896008,0.033952706,0.00058269646,0.8783109,0.08674661,0.000014573518],"about_ca_topic_score_codex":0.0026712243,"about_ca_topic_score_gemma":0.0020477634,"teacher_disagreement_score":0.032559227,"about_ca_system_score_codex":0.0015208262,"about_ca_system_score_gemma":0.0013543507,"threshold_uncertainty_score":0.10892141},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4002238,0.00073750154,0.5858732,0.0006653006,0.00016681981,0.000085080945,0.0001715885,0.00025095695,0.011825696],"genre_scores_gemma":[0.97993547,0.00024432852,0.011793354,0.00011642236,0.000075094125,0.000045628276,0.000054022083,0.000026194819,0.0077094752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915075,0.00016051556,0.000035689573,0.00016545886,0.00020897435,0.00027864377],"domain_scores_gemma":[0.9976726,0.0010607408,0.000469353,0.0001093278,0.0003357965,0.0003522969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013509626,0.000731981,0.0011548767,0.000935462,0.0009531584,0.0018394891,0.0019054118,0.0013418166,0.0027294464],"category_scores_gemma":[0.00385197,0.00056016806,0.00075697474,0.0009932327,0.002041683,0.0024479541,0.0013939509,0.0013292036,0.00031262595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017058155,0.00015257197,0.0014352931,0.00009267426,0.000063696694,0.0007072297,0.0001392805,0.87580645,0.0043437374,0.11077056,0.00073094125,0.0055868765],"study_design_scores_gemma":[0.000015903317,0.000048123118,0.00018431457,0.0000050178783,0.000016364434,0.000054807897,0.00006474192,0.97976637,0.00040664125,0.019180257,0.00024107865,0.000016319877],"about_ca_topic_score_codex":0.005534763,"about_ca_topic_score_gemma":0.0038805394,"teacher_disagreement_score":0.005534763,"about_ca_system_score_codex":0.0022956992,"about_ca_system_score_gemma":0.001476151,"threshold_uncertainty_score":0.016656578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038350953,0.0029793545,0.011756441,0.0025741046,0.00493579,0.00016101784,0.002072475,0.0011597553,0.9739775],"genre_scores_gemma":[0.001486944,0.001912101,0.002912738,0.0009379833,0.0007763594,0.000090415495,0.0015800248,0.0003137371,0.98998964],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939215,0.00005659142,0.000021635205,0.00012961493,0.00033612692,0.00006386752],"domain_scores_gemma":[0.99923766,0.000109978515,0.000025325106,0.00012108647,0.000376183,0.00012976283],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006509794,0.0008508158,0.0005244581,0.0015811914,0.0011609447,0.0034101396,0.0014756352,0.00142984,0.503621],"category_scores_gemma":[0.002426172,0.00032438544,0.00049039605,0.0015118719,0.00055680994,0.002980585,0.0021671515,0.0017341073,0.43512067],"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.000020770556,0.000036335245,0.00007989247,0.0001636725,0.0000023127375,0.000038873735,0.00010805564,0.00022047998,0.0005012643,0.056514576,0.7285568,0.21375704],"study_design_scores_gemma":[0.000001436191,0.000005310136,0.000056640536,0.000059054262,8.953355e-7,0.000026134889,0.000024431332,0.00003972152,0.00010515309,0.0065119597,0.9931666,0.0000027287667],"about_ca_topic_score_codex":0.0024017377,"about_ca_topic_score_gemma":0.0033854013,"teacher_disagreement_score":0.49637902,"about_ca_system_score_codex":0.0012490429,"about_ca_system_score_gemma":0.0020219686,"threshold_uncertainty_score":0.7080244},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040206943,0.0024261943,0.93117195,0.0032609303,0.00057756214,0.00010787616,0.00019169792,0.0003654199,0.021691443],"genre_scores_gemma":[0.8244443,0.0063926717,0.12193665,0.001845243,0.001814387,0.000712135,0.00057646306,0.00080357253,0.04147452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984524,0.0008845953,0.00004937948,0.00013272681,0.00032952367,0.00015121911],"domain_scores_gemma":[0.9892697,0.007402104,0.0007550822,0.00043364693,0.0014886108,0.0006508309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004964207,0.0016921794,0.0013558303,0.0031176675,0.0011267569,0.0026530253,0.0022706524,0.0021631997,0.0051216413],"category_scores_gemma":[0.024789292,0.0007479182,0.0016017685,0.0017842208,0.00346203,0.0043904707,0.0026691395,0.004573465,0.0009403461],"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.00006595246,0.00006292952,0.000297447,0.0001251682,0.00004995646,0.00010081997,0.00017782711,0.067380525,0.0021712433,0.9217416,0.0028844995,0.0049419412],"study_design_scores_gemma":[0.000013835407,0.00001702706,0.00023041392,0.000030560797,0.000020691885,0.00006633051,0.00004438397,0.66489875,0.00032416038,0.33342698,0.00089570065,0.000031096133],"about_ca_topic_score_codex":0.0035716593,"about_ca_topic_score_gemma":0.0012237063,"teacher_disagreement_score":0.0051216413,"about_ca_system_score_codex":0.0032754831,"about_ca_system_score_gemma":0.0019665912,"threshold_uncertainty_score":0.026253521},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043337118,0.00016351638,0.95489585,0.0001672522,0.000028909213,0.00003473538,0.000015053043,0.00025253484,0.0011051154],"genre_scores_gemma":[0.7951743,0.00016081613,0.20361923,0.000068841924,0.000058253077,0.0000650647,0.000030882467,0.0000392772,0.0007832752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890935,0.00063465314,0.000033238353,0.00009244154,0.00025109126,0.00007919335],"domain_scores_gemma":[0.99494755,0.0038686136,0.00027330112,0.00029783376,0.00046972066,0.00014296804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024263866,0.00051824,0.00084067427,0.00068622996,0.00030905264,0.0006108671,0.0007572421,0.00071635086,0.0007446972],"category_scores_gemma":[0.010987985,0.00044904742,0.00042025239,0.0004606445,0.0009530608,0.0010161633,0.0010220215,0.0008993779,0.00009054559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008340864,0.000037247908,0.0007906138,0.000033564942,0.000031369054,0.0000846828,0.00004822012,0.92867345,0.0021285173,0.03381119,0.00028088124,0.033996876],"study_design_scores_gemma":[0.0000022936845,0.000011069254,0.000044363493,6.16117e-7,0.0000012566748,0.0000065933655,0.0000014971307,0.99791235,0.00020971397,0.0017702456,0.00003784939,0.0000022150734],"about_ca_topic_score_codex":0.003973049,"about_ca_topic_score_gemma":0.0014078886,"teacher_disagreement_score":0.003973049,"about_ca_system_score_codex":0.00074095244,"about_ca_system_score_gemma":0.0010830072,"threshold_uncertainty_score":0.012832105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052387625,0.00034005404,0.9422164,0.00036134702,0.00007116442,0.00008924315,0.00037800107,0.0005622639,0.0035939515],"genre_scores_gemma":[0.92838013,0.00079433393,0.062464993,0.00007954088,0.00010614329,0.0003586315,0.00083548296,0.00011761794,0.0068631726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901736,0.0003278983,0.00005745315,0.0002457166,0.00025536623,0.00009628183],"domain_scores_gemma":[0.9985781,0.0008490567,0.00020142742,0.00007315248,0.00024848143,0.000049818238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012586359,0.0011950333,0.0011838665,0.0013814488,0.0005031768,0.0017507485,0.001932442,0.0013796568,0.001956044],"category_scores_gemma":[0.0047208196,0.0007124093,0.0012014237,0.0011833502,0.00058974815,0.00236222,0.0010007899,0.0014670492,0.0006981422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029003708,0.000030200645,0.0012577274,0.000025594363,0.000043352527,0.000048246595,0.000070882874,0.9763609,0.0005104529,0.0152163915,0.00035333162,0.006053881],"study_design_scores_gemma":[0.0000021934106,0.000005000296,0.00013227863,0.0000015390475,0.0000042115344,0.000005482446,0.000003364822,0.99760276,0.000047092093,0.0020418258,0.00015001775,0.000004229426],"about_ca_topic_score_codex":0.010864117,"about_ca_topic_score_gemma":0.0059221946,"teacher_disagreement_score":0.010864117,"about_ca_system_score_codex":0.0012288942,"about_ca_system_score_gemma":0.00063527114,"threshold_uncertainty_score":0.021601737},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001237255,0.0037996734,0.015462462,0.046294793,0.008820959,0.00007607057,0.00037319085,0.00031755253,0.923618],"genre_scores_gemma":[0.03723321,0.006003214,0.009681926,0.019886399,0.008314643,0.00028289712,0.000777256,0.00054145965,0.91727906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967253,0.00073525205,0.00016174218,0.0006575758,0.0013939306,0.00032609815],"domain_scores_gemma":[0.9961908,0.000815086,0.00017275334,0.0009563945,0.0016376069,0.00022733198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033633183,0.0009348436,0.0007262231,0.0017965519,0.0038755825,0.007895031,0.002101706,0.0034210603,0.16563499],"category_scores_gemma":[0.010369419,0.00047487626,0.0006378742,0.0013647428,0.0041238097,0.01152098,0.004070567,0.0046718097,0.077768855],"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.000012795499,0.000017581131,0.00008663265,0.00007725473,0.0000024632436,0.0000365141,0.0002486463,0.000073638774,0.00022340119,0.85396504,0.124370426,0.020885566],"study_design_scores_gemma":[0.0000046530863,0.000007949678,0.0001368455,0.000079086356,0.000004563975,0.00012259395,0.00022061988,0.000126014,0.00025219357,0.26749673,0.7315424,0.000006283113],"about_ca_topic_score_codex":0.0021635878,"about_ca_topic_score_gemma":0.0025404608,"teacher_disagreement_score":0.16563499,"about_ca_system_score_codex":0.0028031562,"about_ca_system_score_gemma":0.0030635754,"threshold_uncertainty_score":0.5541042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004271455,0.0006368602,0.9886296,0.00031393179,0.0003147823,0.00024981823,0.00021094258,0.0012111398,0.004161426],"genre_scores_gemma":[0.17804849,0.0009839183,0.8088361,0.00029727913,0.00022295394,0.00052993436,0.0006335553,0.00020489862,0.010242876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993765,0.000154371,0.000046970217,0.000069466754,0.00026976006,0.00008303249],"domain_scores_gemma":[0.9994729,0.00011533388,0.000049826183,0.00007129829,0.00023950827,0.000051139727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012499444,0.0005946763,0.00029853568,0.00047460746,0.0007139698,0.001237796,0.0018236275,0.0007245201,0.006773764],"category_scores_gemma":[0.0025573825,0.00030595766,0.0005038696,0.0007206914,0.00033630632,0.0011451876,0.00046742137,0.00086997193,0.0013489126],"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.00061334635,0.00022760275,0.001892222,0.00050529337,0.000087070264,0.00037540225,0.00033241656,0.27645227,0.018644376,0.20360743,0.033849135,0.46341348],"study_design_scores_gemma":[0.0001457712,0.00024478923,0.00038395493,0.00005960366,0.00007948454,0.00019250462,0.00003614503,0.8740467,0.0042383084,0.03503666,0.085496,0.000040104944],"about_ca_topic_score_codex":0.009964698,"about_ca_topic_score_gemma":0.01246227,"teacher_disagreement_score":0.009964698,"about_ca_system_score_codex":0.0016013668,"about_ca_system_score_gemma":0.002750604,"threshold_uncertainty_score":0.022660494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6157598,0.0032808273,0.34345663,0.0014118981,0.00021458822,0.00007628122,0.00039886616,0.00040174712,0.034999277],"genre_scores_gemma":[0.98400104,0.00037901735,0.008562252,0.00009846053,0.000042870313,0.000034735287,0.000074409996,0.000029566992,0.0067776404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994205,0.00011098672,0.000029486288,0.00013138761,0.00014922937,0.00015846088],"domain_scores_gemma":[0.9985821,0.0005390263,0.00019775826,0.0003182488,0.00021210093,0.00015075275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005672313,0.0002670435,0.0005993062,0.00046605707,0.00084449997,0.0017122062,0.0013821628,0.00075705413,0.0046347706],"category_scores_gemma":[0.004271302,0.0002527059,0.0004746896,0.0005583918,0.0017303795,0.00256182,0.0018597505,0.00059236883,0.00041769407],"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.00032699795,0.000106358704,0.0034477531,0.00021313278,0.00003274253,0.00042372005,0.0006107174,0.1662516,0.016437074,0.77379024,0.0024751176,0.03588455],"study_design_scores_gemma":[0.00003535445,0.00013358583,0.0017029108,0.00003321652,0.000022754128,0.00067181716,0.00028541172,0.6841957,0.0069096563,0.2961253,0.009844752,0.000039589326],"about_ca_topic_score_codex":0.0019857425,"about_ca_topic_score_gemma":0.0010417968,"teacher_disagreement_score":0.0046347706,"about_ca_system_score_codex":0.0010838856,"about_ca_system_score_gemma":0.00082383736,"threshold_uncertainty_score":0.015504837},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14151607,0.00746723,0.8165308,0.0017001309,0.00029821155,0.000049151397,0.00023789959,0.00044924248,0.03175124],"genre_scores_gemma":[0.9689488,0.0022691614,0.024907464,0.0002230607,0.00031889047,0.00004479123,0.0001321446,0.00012656504,0.00302902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972867,0.0011054906,0.00009496863,0.00037525265,0.0006542052,0.00048331934],"domain_scores_gemma":[0.9864646,0.009962791,0.0013711889,0.0006901214,0.0011210123,0.00039023947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044846386,0.0011269393,0.00087411574,0.0015963286,0.0008504802,0.003262397,0.0015587728,0.0013520792,0.0031529432],"category_scores_gemma":[0.022370469,0.00060235726,0.00052830233,0.0013684154,0.0023939314,0.0035780477,0.0013101976,0.0020770205,0.0005159124],"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.000312508,0.0001472664,0.0019341295,0.00021655667,0.000097682416,0.00030374445,0.00031452352,0.4460629,0.003928776,0.5171135,0.004518114,0.025050303],"study_design_scores_gemma":[0.000009382229,0.00007508945,0.0005740293,0.000041413397,0.000026572781,0.0001879091,0.00008716911,0.83489686,0.0011538916,0.1617074,0.0012097368,0.00003052567],"about_ca_topic_score_codex":0.0011177043,"about_ca_topic_score_gemma":0.0006381494,"teacher_disagreement_score":0.0044846386,"about_ca_system_score_codex":0.0030138816,"about_ca_system_score_gemma":0.0009644299,"threshold_uncertainty_score":0.023717344},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086294994,0.000419121,0.90998054,0.00025034617,0.0000611646,0.000097326745,0.00013151002,0.0002909028,0.0024741834],"genre_scores_gemma":[0.84010863,0.00087807456,0.15033336,0.00016175394,0.00009311612,0.0004018556,0.00038743627,0.00014548562,0.0074903476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984384,0.0004888836,0.00009374719,0.00032339527,0.00048097927,0.00017449228],"domain_scores_gemma":[0.984688,0.010780858,0.0014698582,0.0017867151,0.0009317544,0.00034276216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006236999,0.0005257384,0.0010640363,0.0013410227,0.0005696722,0.0016891693,0.002653505,0.0011922307,0.00300506],"category_scores_gemma":[0.033429053,0.00067798916,0.00084668957,0.0014239841,0.0021728363,0.0047704433,0.0013269389,0.001826953,0.0006175519],"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.00013895494,0.000053438518,0.0029055404,0.000071109105,0.000031635198,0.0001544189,0.0001998571,0.8420445,0.0008319656,0.1369683,0.00056378817,0.01603645],"study_design_scores_gemma":[0.0000055918877,0.000009335865,0.00023458333,0.000010266347,0.0000040469017,0.000026006217,0.000016178315,0.98000175,0.00025509304,0.01923826,0.00019068416,0.000008135768],"about_ca_topic_score_codex":0.004606694,"about_ca_topic_score_gemma":0.0047023073,"teacher_disagreement_score":0.006236999,"about_ca_system_score_codex":0.0021778315,"about_ca_system_score_gemma":0.0014260196,"threshold_uncertainty_score":0.032984793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044164397,0.00077896327,0.9419621,0.0007443297,0.00011823956,0.000041505005,0.000114207636,0.000173755,0.011902468],"genre_scores_gemma":[0.94446194,0.000816813,0.043057535,0.000109292945,0.00018417393,0.00008713511,0.00007762191,0.00008867423,0.0111168325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907744,0.0003693311,0.000025197205,0.00012662334,0.00023150753,0.00016978839],"domain_scores_gemma":[0.99771106,0.0015759883,0.00022456716,0.000105983876,0.00025636886,0.0001260121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001630458,0.0006916493,0.0010021523,0.00063294714,0.0005097152,0.0019074243,0.0015509172,0.0009401668,0.004046471],"category_scores_gemma":[0.004291426,0.0006303516,0.00053836545,0.0012784274,0.0011999598,0.0019888226,0.00073696143,0.0011397472,0.00032125702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025969377,0.000043705983,0.000281923,0.000023859742,0.0000122544825,0.000028330496,0.00002550388,0.9126449,0.00048063404,0.0803578,0.0008297755,0.0052452604],"study_design_scores_gemma":[0.0000019581187,0.0000033204751,0.000043206364,0.0000011986439,0.0000029538803,0.0000036343572,0.000004401622,0.9917427,0.000060108698,0.007974783,0.00015996977,0.0000017095862],"about_ca_topic_score_codex":0.013063178,"about_ca_topic_score_gemma":0.011944006,"teacher_disagreement_score":0.013063178,"about_ca_system_score_codex":0.0025041634,"about_ca_system_score_gemma":0.0026544265,"threshold_uncertainty_score":0.025974333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072061524,0.00032879342,0.9208095,0.0009361394,0.000077668396,0.00010976841,0.00010568534,0.00014373766,0.0054270844],"genre_scores_gemma":[0.887428,0.0005086666,0.09674976,0.00031893078,0.00011386923,0.00038683906,0.00021216417,0.00014843191,0.014133376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984004,0.0007332463,0.0000625503,0.00024500975,0.0002956456,0.0002630996],"domain_scores_gemma":[0.9867749,0.010012261,0.0010670067,0.0002897594,0.0011404672,0.0007155873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046687373,0.00089615124,0.00132872,0.0014905107,0.0010772804,0.0017736938,0.001638431,0.002257234,0.0058047855],"category_scores_gemma":[0.01872033,0.0006271462,0.001040665,0.0009854274,0.0027017903,0.0027289016,0.00185092,0.0018813582,0.00036757765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011078598,0.00006583901,0.0008225495,0.00007374407,0.000037000555,0.00007873077,0.000120012664,0.72152,0.0014382785,0.2674514,0.001097767,0.0071838526],"study_design_scores_gemma":[0.000016081436,0.000022305005,0.00007151174,0.00000614455,0.0000043993687,0.000010899616,0.00001107559,0.96505105,0.00010535059,0.034472033,0.00022241483,0.0000067006904],"about_ca_topic_score_codex":0.004648804,"about_ca_topic_score_gemma":0.0023648108,"teacher_disagreement_score":0.0058047855,"about_ca_system_score_codex":0.0034780258,"about_ca_system_score_gemma":0.0025616896,"threshold_uncertainty_score":0.025234938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8668673,0.0005780164,0.11518721,0.004926699,0.00010536253,0.000128204,0.0002959266,0.00014165428,0.011769694],"genre_scores_gemma":[0.99668,0.000091882925,0.0024987017,0.00011516031,0.000028598413,0.000018485525,0.00001574452,0.000009725668,0.00054162426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99505025,0.0021628719,0.00018526534,0.0006418399,0.00040726186,0.0015525477],"domain_scores_gemma":[0.9624809,0.025959585,0.0058858837,0.0024332413,0.0008632531,0.0023771871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007358741,0.0008851667,0.0017620678,0.00066460815,0.0019540184,0.0034624708,0.0022230165,0.0026114066,0.0046914937],"category_scores_gemma":[0.03161077,0.0007451014,0.0011329526,0.0006638479,0.0030221285,0.006675774,0.0023094302,0.002528238,0.00033703956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022780458,0.0005428106,0.021667944,0.00024225075,0.00036528136,0.001442884,0.0013412895,0.74918514,0.006797269,0.17342904,0.0027286878,0.03997929],"study_design_scores_gemma":[0.00016656991,0.0005922067,0.010975492,0.000074565454,0.00014779669,0.000346274,0.0019199515,0.82192415,0.001858319,0.16077256,0.0010530042,0.0001692214],"about_ca_topic_score_codex":0.00836548,"about_ca_topic_score_gemma":0.0067359037,"teacher_disagreement_score":0.00836548,"about_ca_system_score_codex":0.0027675407,"about_ca_system_score_gemma":0.0018446337,"threshold_uncertainty_score":0.038917243},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016080672,0.00039461325,0.20042744,0.0056220433,0.001869672,0.0021612912,0.11981397,0.20652059,0.46158233],"genre_scores_gemma":[0.017505797,0.0023644343,0.10625447,0.0069578304,0.0007356977,0.00253365,0.18095027,0.07757415,0.60512376],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850875,0.0002807344,0.0001823917,0.00025953838,0.0005644746,0.00020414029],"domain_scores_gemma":[0.9970696,0.00068790436,0.00015175882,0.0010623658,0.00075990317,0.0002685016],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022235466,0.0029370862,0.0014471766,0.0020255395,0.0017875554,0.008403146,0.003935028,0.0042541022,0.60142744],"category_scores_gemma":[0.006716096,0.002318361,0.0027782326,0.0028864515,0.0010907743,0.0059469296,0.0044799,0.0035740717,0.6151161],"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.00023176441,0.00015776796,0.00022168158,0.0003488399,0.000029418732,0.00014992131,0.00014741426,0.0013226807,0.0034546875,0.013082365,0.9192431,0.061610486],"study_design_scores_gemma":[0.00007983517,0.000024936457,0.00033306857,0.00009139287,0.000010053029,0.000101568796,0.000053298365,0.0028010714,0.0016501297,0.0046963035,0.99012756,0.000030738687],"about_ca_topic_score_codex":0.034255333,"about_ca_topic_score_gemma":0.023959365,"teacher_disagreement_score":0.60142744,"about_ca_system_score_codex":0.0038997375,"about_ca_system_score_gemma":0.002498284,"threshold_uncertainty_score":0.56851536},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3852778,0.0013692054,0.6046792,0.0006271179,0.00008911904,0.0000778578,0.00013707529,0.0005630193,0.0071796365],"genre_scores_gemma":[0.9792726,0.0006299092,0.016147967,0.00011904391,0.00008819577,0.00006299822,0.00013650546,0.000093968374,0.0034489462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990435,0.00026675602,0.000031387943,0.00012943186,0.0003246227,0.00020418341],"domain_scores_gemma":[0.99189717,0.004855357,0.0012151162,0.00047086735,0.001113914,0.00044763164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035557125,0.0006448372,0.0009113659,0.0016004988,0.0006436709,0.00095074996,0.0014120344,0.00080259395,0.0028096347],"category_scores_gemma":[0.019707058,0.00045081225,0.0006564248,0.0008790043,0.0018520621,0.002368196,0.0011872319,0.0019015599,0.00038326473],"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.00043153658,0.00015772831,0.008716992,0.00026658966,0.000088017216,0.00096160447,0.00079656695,0.549462,0.017826887,0.40005237,0.0022118883,0.019027825],"study_design_scores_gemma":[0.000011405178,0.000054243043,0.0013510315,0.000015917705,0.000015482356,0.0001309334,0.000056870347,0.97003406,0.0009754334,0.027050557,0.00027841795,0.000025652453],"about_ca_topic_score_codex":0.004215154,"about_ca_topic_score_gemma":0.0022533122,"teacher_disagreement_score":0.004215154,"about_ca_system_score_codex":0.0015375218,"about_ca_system_score_gemma":0.0011816887,"threshold_uncertainty_score":0.01880467},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98647213,0.00027410494,0.010426691,0.0005458448,0.00004468137,0.00002178321,0.000060574213,0.00010018021,0.0020539283],"genre_scores_gemma":[0.9991328,0.000050383005,0.0004932718,0.000020977857,0.000014359361,0.000003611673,0.000010222309,0.000009866512,0.00026456144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968489,0.001189506,0.00018019363,0.00027909974,0.00049206906,0.0010103191],"domain_scores_gemma":[0.7634752,0.20988895,0.011008173,0.0055421977,0.003660707,0.0064247777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009514349,0.00041641036,0.0011922313,0.0013478448,0.0012834504,0.004006549,0.0016467873,0.0013983779,0.0046448563],"category_scores_gemma":[0.08501033,0.000845467,0.00055407075,0.001372891,0.0028836809,0.004483608,0.001695059,0.0026815976,0.00020658177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012689615,0.0025786958,0.074151486,0.0004451068,0.0003074661,0.0016695351,0.0043327203,0.6485751,0.029939318,0.15738632,0.0030203161,0.06490422],"study_design_scores_gemma":[0.00043132706,0.0011849166,0.037622273,0.00006837666,0.00029700776,0.00029086965,0.0015245349,0.877409,0.006271515,0.074318685,0.00041291345,0.0001686688],"about_ca_topic_score_codex":0.006427433,"about_ca_topic_score_gemma":0.0046639624,"teacher_disagreement_score":0.009514349,"about_ca_system_score_codex":0.0034658932,"about_ca_system_score_gemma":0.0020908117,"threshold_uncertainty_score":0.050317287},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14751631,0.0033895853,0.82577765,0.0030071316,0.00043216426,0.00005114247,0.00021200856,0.00030030246,0.019313632],"genre_scores_gemma":[0.94576687,0.00094903243,0.046661764,0.00040129377,0.00019904129,0.000033698238,0.000055906447,0.000049150447,0.0058831703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953425,0.00010028071,0.000019376703,0.000098916935,0.00015620311,0.00009094206],"domain_scores_gemma":[0.99949956,0.00019227271,0.00008826492,0.00005551355,0.000110417255,0.000053877415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009318512,0.00030121912,0.00039153997,0.0005858107,0.00056887267,0.0014565797,0.001483466,0.0010725545,0.0018954293],"category_scores_gemma":[0.0022932214,0.00023227386,0.0004632779,0.0007752499,0.0014047681,0.0022794032,0.0007213366,0.001534964,0.00027849575],"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.000040298604,0.000029313582,0.00061405805,0.000046302976,0.000012554367,0.0002145979,0.00009403338,0.0765725,0.004371449,0.9103979,0.0015116641,0.00609538],"study_design_scores_gemma":[0.000024592437,0.000041185365,0.00047473016,0.000017895814,0.000010371853,0.00022508879,0.00005112386,0.782618,0.0013422458,0.2124175,0.0027500938,0.00002714601],"about_ca_topic_score_codex":0.0056222514,"about_ca_topic_score_gemma":0.0031280273,"teacher_disagreement_score":0.0056222514,"about_ca_system_score_codex":0.0019550342,"about_ca_system_score_gemma":0.0016322752,"threshold_uncertainty_score":0.014184833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2627161,0.0009900014,0.711705,0.0028729397,0.00027597847,0.0002669811,0.0012929788,0.001014117,0.018865854],"genre_scores_gemma":[0.97283226,0.00060675736,0.0112432735,0.00015184043,0.00012321663,0.00019173443,0.00039668859,0.000082217935,0.014371974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998645,0.00032118565,0.000056198634,0.0003299344,0.0003078144,0.00033980532],"domain_scores_gemma":[0.99337935,0.0044928496,0.0006954784,0.00037257816,0.0006512093,0.00040857564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020520254,0.00079925754,0.0016485866,0.0014859713,0.001239064,0.0030076113,0.0029394876,0.002977901,0.008982763],"category_scores_gemma":[0.0072790505,0.0010640236,0.0010486495,0.0018592001,0.0022295106,0.0030737533,0.0013044924,0.0023320066,0.0011034365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020012642,0.00009621595,0.0019261017,0.000086549146,0.000056834255,0.00056598376,0.00029136584,0.82251817,0.0025405383,0.16477862,0.0016272963,0.0053121434],"study_design_scores_gemma":[0.000023743934,0.00002102854,0.00023417558,0.000010874541,0.000018745795,0.000051967872,0.000018912813,0.98522955,0.00017936826,0.013900947,0.0002920898,0.000018652067],"about_ca_topic_score_codex":0.017078064,"about_ca_topic_score_gemma":0.00765013,"teacher_disagreement_score":0.017078064,"about_ca_system_score_codex":0.0028050682,"about_ca_system_score_gemma":0.0022669556,"threshold_uncertainty_score":0.033957362},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1086876,0.0018528565,0.865108,0.0015029451,0.00010569442,0.00010098637,0.0003127028,0.00035239672,0.02197686],"genre_scores_gemma":[0.91227585,0.0012457379,0.07982339,0.00017979414,0.00015836874,0.00016433667,0.00030317888,0.000067053894,0.0057823346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996387,0.000101283884,0.00001271795,0.000040946827,0.00013229702,0.00007403087],"domain_scores_gemma":[0.9982856,0.0011679385,0.00014165175,0.00007249318,0.00026913534,0.00006318773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010924449,0.00059695914,0.0005855246,0.0010750608,0.0006879875,0.0009585242,0.0008626892,0.00059066986,0.0023575826],"category_scores_gemma":[0.0049258564,0.00020587034,0.00051636505,0.0007909453,0.0008508166,0.0013314354,0.0007376897,0.0011798099,0.0002558871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030471454,0.00004662895,0.0012450982,0.00008038632,0.000016854678,0.00012682425,0.00010006968,0.83588564,0.0012682112,0.14743274,0.0021459414,0.01162108],"study_design_scores_gemma":[9.779413e-7,0.0000022119902,0.00008525031,0.000002058226,0.0000010275063,0.000006512304,0.0000069030657,0.9903481,0.000046961126,0.009358996,0.00013907702,0.000001936021],"about_ca_topic_score_codex":0.013400419,"about_ca_topic_score_gemma":0.0060523474,"teacher_disagreement_score":0.013400419,"about_ca_system_score_codex":0.0019139843,"about_ca_system_score_gemma":0.0018811022,"threshold_uncertainty_score":0.026644826},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027443198,0.026144262,0.92443836,0.0046776324,0.0013870489,0.000033892687,0.00055553054,0.00064949464,0.039369375],"genre_scores_gemma":[0.36804903,0.05627837,0.28542486,0.003176035,0.009379795,0.0007227698,0.0029275122,0.0012581573,0.2727835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931324,0.0002283024,0.000028177457,0.00013763887,0.00023199098,0.000060621343],"domain_scores_gemma":[0.99876225,0.0007463459,0.00007824077,0.00014911259,0.00021030952,0.00005380641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001497394,0.0015985218,0.0014166428,0.00090444414,0.00050169264,0.0024359005,0.0014385991,0.0017084009,0.012779961],"category_scores_gemma":[0.004586844,0.0005352066,0.00066316465,0.0015002069,0.0013000959,0.0035646323,0.0011081452,0.004713016,0.0037613304],"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.000024566685,0.00004343382,0.0002195108,0.00013441044,0.000044720426,0.000041644962,0.000062975996,0.061966818,0.00042033457,0.807044,0.058223847,0.07177377],"study_design_scores_gemma":[0.0000072777866,0.000013586429,0.0001385661,0.000040472485,0.000010865899,0.000037118567,0.000014285952,0.13779648,0.0001083418,0.8297877,0.032033972,0.000011483202],"about_ca_topic_score_codex":0.0029688103,"about_ca_topic_score_gemma":0.0024174454,"teacher_disagreement_score":0.012779961,"about_ca_system_score_codex":0.0019429724,"about_ca_system_score_gemma":0.0007260193,"threshold_uncertainty_score":0.04275322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.700839,0.00090082875,0.29074138,0.0012556113,0.00014376892,0.00018652568,0.00015605328,0.00045938973,0.0053174524],"genre_scores_gemma":[0.9932105,0.00012855523,0.005448874,0.00004155285,0.000027878004,0.00002849568,0.000022139695,0.000015282443,0.0010768727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888533,0.00040148947,0.000038249844,0.00014525434,0.00015660957,0.0003730837],"domain_scores_gemma":[0.99619895,0.0017989017,0.0007990545,0.00015007921,0.00035511295,0.00069787155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002832725,0.00086215214,0.00087041635,0.00060811214,0.0009304264,0.0019184365,0.0019631512,0.0011508074,0.0021003035],"category_scores_gemma":[0.0048760953,0.00048909313,0.00045379717,0.00062448037,0.0011424839,0.0010732561,0.000815472,0.0011277454,0.00024516814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023686509,0.00014004593,0.00087396335,0.000031520896,0.000028982748,0.00012136297,0.000118392294,0.9793338,0.0016856008,0.01165114,0.00060777593,0.005170504],"study_design_scores_gemma":[0.000020290672,0.000046922585,0.0002158933,0.0000022878962,0.000010073696,0.000015000234,0.000034704262,0.9974704,0.00021148668,0.0018343861,0.00012976663,0.000008819848],"about_ca_topic_score_codex":0.014724933,"about_ca_topic_score_gemma":0.006701095,"teacher_disagreement_score":0.014724933,"about_ca_system_score_codex":0.0034306995,"about_ca_system_score_gemma":0.0019750567,"threshold_uncertainty_score":0.029278457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024290131,0.04671379,0.4707975,0.021845778,0.0033758788,0.000031429623,0.00041794934,0.0004259184,0.43210152],"genre_scores_gemma":[0.7651465,0.035022363,0.03662883,0.0029520507,0.004874418,0.0001735234,0.00031533692,0.00028181804,0.15460509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999376,0.0001590722,0.000022952958,0.0001363556,0.00024532076,0.00006028062],"domain_scores_gemma":[0.99886644,0.00077909976,0.0000738752,0.00009810646,0.000116173454,0.00006630035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093656435,0.00088325585,0.0008173784,0.00079737435,0.00060929713,0.0021878185,0.0007007829,0.0008802166,0.007272548],"category_scores_gemma":[0.0036156545,0.00042669408,0.00050222443,0.00079842407,0.0032550693,0.0025001883,0.0011587059,0.003122075,0.0010401302],"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.0000050362146,0.00000809623,0.00005730494,0.000028104138,0.000009222759,0.000013546937,0.000030435238,0.008148443,0.00018846277,0.97683,0.00557685,0.009104413],"study_design_scores_gemma":[0.000001400712,0.0000032092291,0.00006414261,0.000014469414,0.000002597704,0.0000119295455,0.0000075479093,0.006431409,0.00007129094,0.9830452,0.010343226,0.0000035670362],"about_ca_topic_score_codex":0.0018288419,"about_ca_topic_score_gemma":0.0014827923,"teacher_disagreement_score":0.007272548,"about_ca_system_score_codex":0.00214966,"about_ca_system_score_gemma":0.00077856623,"threshold_uncertainty_score":0.024329066},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1656267,0.00088125357,0.821192,0.00027306238,0.000034157558,0.00007433127,0.00022247457,0.00019142436,0.011504526],"genre_scores_gemma":[0.9716232,0.0004417365,0.025582142,0.00004123813,0.000045682507,0.00008298899,0.0001881901,0.000040655978,0.001954279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943835,0.00010608286,0.00002508152,0.00010881936,0.00017281296,0.00014880172],"domain_scores_gemma":[0.9978078,0.0012046807,0.00035398873,0.00009028068,0.00045176735,0.00009154974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007738021,0.0006666804,0.0005746211,0.0007862565,0.00048309303,0.0013828218,0.000843293,0.00048017802,0.0033194167],"category_scores_gemma":[0.0032291494,0.00022438898,0.00060130184,0.00045669472,0.00091627706,0.0014266159,0.0008194076,0.0013223687,0.00034086162],"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.00019291422,0.00011544498,0.0041730218,0.000286158,0.00006458933,0.00043247733,0.0006356111,0.69132864,0.037482314,0.24163233,0.0014642188,0.022192338],"study_design_scores_gemma":[0.0000052675136,0.0000330785,0.0005158242,0.0000150011565,0.000006893924,0.000045848366,0.000055260825,0.9748923,0.0030134248,0.020899946,0.0005050254,0.000012028527],"about_ca_topic_score_codex":0.0028664214,"about_ca_topic_score_gemma":0.0012299599,"teacher_disagreement_score":0.0033194167,"about_ca_system_score_codex":0.001174773,"about_ca_system_score_gemma":0.00086478615,"threshold_uncertainty_score":0.011104524},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022352068,0.00004751082,0.9941565,0.00015784346,0.000040315605,0.000025030451,0.000046685727,0.0001515442,0.0031393694],"genre_scores_gemma":[0.37158722,0.00061425386,0.61048335,0.00039827835,0.0004032653,0.00038854725,0.00022086517,0.00022633077,0.015677912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766326,0.00065042096,0.00013649397,0.00035272405,0.0009439043,0.00025310816],"domain_scores_gemma":[0.9979619,0.0010673368,0.0001630353,0.00029935184,0.00036304953,0.00014541985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044305734,0.00090599235,0.000770407,0.00085924845,0.0014633622,0.0032200376,0.002341322,0.0013914296,0.003276757],"category_scores_gemma":[0.0054645147,0.00063315075,0.0013768767,0.001109521,0.002386444,0.0046893856,0.00257324,0.0035200063,0.0008881218],"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.000018812445,0.000016628228,0.000072951276,0.0000147454975,0.0000075821995,0.00006423038,0.0000671468,0.03886767,0.0008151843,0.9539592,0.000743761,0.005352073],"study_design_scores_gemma":[0.000012848673,0.00003396865,0.00006172623,0.000011171735,0.000019535873,0.00007582796,0.000017186341,0.5687155,0.001275845,0.42292112,0.0068332334,0.000022055916],"about_ca_topic_score_codex":0.0024571093,"about_ca_topic_score_gemma":0.002362771,"teacher_disagreement_score":0.0044305734,"about_ca_system_score_codex":0.002368586,"about_ca_system_score_gemma":0.0024456182,"threshold_uncertainty_score":0.02343142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8443485,0.00076812063,0.13409945,0.0027861714,0.0003433062,0.00041067,0.0017960428,0.0015231331,0.013924602],"genre_scores_gemma":[0.9884162,0.00009932635,0.0044997274,0.00009614269,0.00008718649,0.00005745225,0.00015258862,0.00003201434,0.006559333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670666,0.00077580987,0.00016878241,0.0007482431,0.00053583155,0.0010646551],"domain_scores_gemma":[0.98618823,0.0074003655,0.0016719914,0.00060528464,0.0024168638,0.0017172243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030549297,0.0011789802,0.002765141,0.001651864,0.0027923165,0.004555058,0.004170795,0.005192557,0.0071996823],"category_scores_gemma":[0.009854865,0.0013096662,0.0013945271,0.0024493516,0.00243731,0.0020154333,0.001994819,0.0016946726,0.0013923642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042844424,0.000966161,0.015719296,0.0004992427,0.00033709005,0.010061438,0.0005365581,0.8720968,0.021664506,0.034265276,0.011512445,0.028056791],"study_design_scores_gemma":[0.0001928017,0.0005156033,0.0036014072,0.000017026516,0.00010531797,0.000721304,0.00012926466,0.9882714,0.0011800572,0.004506203,0.0006534631,0.00010618084],"about_ca_topic_score_codex":0.02942823,"about_ca_topic_score_gemma":0.01925376,"teacher_disagreement_score":0.02942823,"about_ca_system_score_codex":0.0035659098,"about_ca_system_score_gemma":0.0038619672,"threshold_uncertainty_score":0.05851388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021477874,0.00029532303,0.9749111,0.0004774727,0.00003085709,0.00004189322,0.000043175925,0.000119929704,0.002602291],"genre_scores_gemma":[0.6192721,0.00071944686,0.36845818,0.00040457194,0.00020233044,0.00043375188,0.00019316046,0.00021491491,0.010101459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856913,0.00084292796,0.000030946085,0.00018538597,0.00018012078,0.00019149196],"domain_scores_gemma":[0.99636745,0.0027806386,0.00029959955,0.0000744212,0.00031457646,0.00016338761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002565059,0.0011562251,0.0014239983,0.0011758001,0.0008102279,0.0011692363,0.0023524405,0.0022408585,0.004040157],"category_scores_gemma":[0.00804826,0.0008608736,0.0011935134,0.0016360016,0.0010834427,0.0015066025,0.0016707225,0.002568111,0.00042998634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016954047,0.00002169043,0.00023056348,0.000016928245,0.000012362288,0.000030872947,0.000015690612,0.9898981,0.00013131299,0.0046445564,0.00020936881,0.004771726],"study_design_scores_gemma":[0.0000040971704,0.00000940397,0.000036213114,0.0000017842593,0.0000021113065,0.000005165299,0.0000049827827,0.9973603,0.000046101562,0.0024148526,0.00011236626,0.00000259629],"about_ca_topic_score_codex":0.009982043,"about_ca_topic_score_gemma":0.00574675,"teacher_disagreement_score":0.009982043,"about_ca_system_score_codex":0.0016600799,"about_ca_system_score_gemma":0.0017260737,"threshold_uncertainty_score":0.01984787},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028453814,0.000015015385,0.99607915,0.00003716556,0.000020095524,0.000029904717,0.000027990644,0.00019042626,0.00075482513],"genre_scores_gemma":[0.14810364,0.000109560046,0.84606814,0.00013983506,0.00010491657,0.00039820586,0.00027517427,0.0005092144,0.004291305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995937,0.000086456304,0.000026203737,0.00007362124,0.00016506588,0.000054990727],"domain_scores_gemma":[0.99809307,0.0011880622,0.000092989554,0.0001430946,0.00040740287,0.00007529158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018644407,0.0006218028,0.00083957956,0.0011098608,0.0011034774,0.000999077,0.0025403255,0.0010393427,0.008531265],"category_scores_gemma":[0.006300276,0.0004018655,0.0012421826,0.0010845162,0.00064313895,0.0017598289,0.0010740085,0.0016849571,0.0012575848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007548839,0.00015378703,0.0012184161,0.00015544571,0.00005686903,0.00027637166,0.00020756766,0.7361339,0.0052182106,0.19343098,0.00201621,0.061056755],"study_design_scores_gemma":[0.0000059134595,0.000004358449,0.000035599012,0.0000033263877,0.0000031501356,0.000014758919,0.000007197376,0.99054176,0.00029376135,0.008681665,0.0004041307,0.000004437741],"about_ca_topic_score_codex":0.009298466,"about_ca_topic_score_gemma":0.007629141,"teacher_disagreement_score":0.009298466,"about_ca_system_score_codex":0.0012657401,"about_ca_system_score_gemma":0.0033737493,"threshold_uncertainty_score":0.028539956},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16389532,0.0029659898,0.7980457,0.0035442994,0.00045580606,0.00018142545,0.0008162366,0.0015009675,0.028594255],"genre_scores_gemma":[0.9344577,0.001654382,0.042267032,0.0009796366,0.0007647698,0.00023185794,0.0006532714,0.00057761994,0.018413754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808854,0.0005491691,0.00006715363,0.00030095797,0.0005193407,0.00047488065],"domain_scores_gemma":[0.9827071,0.01050814,0.0012508573,0.0017250655,0.0027277418,0.001080975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006834761,0.0016582119,0.0016779972,0.0034097102,0.0013415375,0.003599804,0.004296449,0.0017262313,0.00924564],"category_scores_gemma":[0.037322175,0.00083790155,0.0010959848,0.0019194175,0.0031158733,0.005947719,0.0036883522,0.0049955966,0.0016419135],"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.00043185113,0.00018850336,0.003139472,0.00020412068,0.00006636492,0.00040535713,0.0006913201,0.08275546,0.009191876,0.8731796,0.010354474,0.01939153],"study_design_scores_gemma":[0.00003802551,0.00006836327,0.0013286476,0.00005289086,0.00004029642,0.00015243897,0.0001002766,0.7518241,0.0016717924,0.24293269,0.0017304083,0.00006013817],"about_ca_topic_score_codex":0.00938984,"about_ca_topic_score_gemma":0.005496607,"teacher_disagreement_score":0.00938984,"about_ca_system_score_codex":0.0047883885,"about_ca_system_score_gemma":0.0032697902,"threshold_uncertainty_score":0.036146104},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054330017,0.08056793,0.7595376,0.08533781,0.0027978793,0.00012446052,0.0004371036,0.0006123889,0.0162548],"genre_scores_gemma":[0.7523434,0.06881546,0.151884,0.002853847,0.011625388,0.00019250493,0.0004470635,0.00045756865,0.011380767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960323,0.002038724,0.00017852975,0.00049718324,0.0007607222,0.0004924398],"domain_scores_gemma":[0.98216355,0.013594484,0.00082894106,0.00081170484,0.0017672223,0.0008340431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009651807,0.001130858,0.0026895402,0.0010315694,0.0010801706,0.0072933817,0.0033890456,0.0034190025,0.00356635],"category_scores_gemma":[0.027497634,0.0011264188,0.0009309035,0.0024899526,0.004298737,0.0123147955,0.0018799647,0.0053761597,0.000709453],"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.00029620543,0.00046780033,0.001809107,0.00058001676,0.000115637515,0.00004772555,0.0002325971,0.5290906,0.0007461069,0.33756855,0.015795281,0.11325043],"study_design_scores_gemma":[0.000024013107,0.000034647037,0.00030248618,0.000054651675,0.0000148187855,0.000010305947,0.0002033459,0.7457202,0.00016547031,0.24849954,0.0049408814,0.000029714987],"about_ca_topic_score_codex":0.015449105,"about_ca_topic_score_gemma":0.0096264845,"teacher_disagreement_score":0.015449105,"about_ca_system_score_codex":0.0042552254,"about_ca_system_score_gemma":0.00769094,"threshold_uncertainty_score":0.051044285},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001877753,0.014138599,0.002742906,0.08954703,0.8803313,0.0000582047,0.00031365623,0.00016059389,0.012519912],"genre_scores_gemma":[0.0023501199,0.01254598,0.0011820272,0.023557046,0.91580087,0.0001020479,0.00053822465,0.00030162037,0.04362209],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961559,0.0006398204,0.0003936552,0.0006396392,0.0018466885,0.00032432683],"domain_scores_gemma":[0.967229,0.010767931,0.00148589,0.0014709071,0.015435673,0.0036105528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057106568,0.0022119894,0.002485806,0.003788966,0.0029911604,0.009267938,0.0022596496,0.006188376,0.06302288],"category_scores_gemma":[0.026855946,0.0008115422,0.0024223076,0.0028999078,0.0019179354,0.0061994563,0.0027098143,0.013615507,0.033086818],"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.000010680572,0.0000135729,0.000050190407,0.000069761474,0.0000063724137,0.000019508943,0.000012350066,0.00006424914,0.000039116072,0.001858009,0.99127054,0.0065856124],"study_design_scores_gemma":[0.000015544687,0.00003205178,0.0006898687,0.00035993507,0.000017228766,0.00009339995,0.000062193154,0.0004014895,0.00007697362,0.0116783185,0.98654455,0.000028487495],"about_ca_topic_score_codex":0.0026401193,"about_ca_topic_score_gemma":0.0025845068,"teacher_disagreement_score":0.06302288,"about_ca_system_score_codex":0.0044519203,"about_ca_system_score_gemma":0.004142711,"threshold_uncertainty_score":0.21083254},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015083103,0.004259179,0.9462759,0.0036997632,0.00088025077,0.000087868524,0.00050381426,0.00031608169,0.028894108],"genre_scores_gemma":[0.64916295,0.009553676,0.31294677,0.0025769833,0.004649106,0.0006129187,0.00076852017,0.0007267111,0.019002354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959086,0.0013989079,0.00035548312,0.0005728614,0.0013994776,0.00036464617],"domain_scores_gemma":[0.97157943,0.021806069,0.0014626272,0.0018464547,0.0026872854,0.000618213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00978243,0.0014645961,0.001594249,0.0022650904,0.0016590789,0.005007734,0.003007095,0.002635751,0.005785079],"category_scores_gemma":[0.05072736,0.0011938853,0.00203821,0.0046906187,0.0041713496,0.008402125,0.002141815,0.00836166,0.0012323363],"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.00004246801,0.000058797148,0.0003339403,0.000074118034,0.000016003061,0.000095674855,0.00022883847,0.010580207,0.0005916801,0.9725423,0.003719764,0.011716238],"study_design_scores_gemma":[0.000013421328,0.000019637764,0.00030585163,0.000041471303,0.000018009527,0.00008690574,0.00004253586,0.103682764,0.00034665826,0.8918805,0.0035336774,0.000028532344],"about_ca_topic_score_codex":0.003953837,"about_ca_topic_score_gemma":0.001886734,"teacher_disagreement_score":0.00978243,"about_ca_system_score_codex":0.0035615615,"about_ca_system_score_gemma":0.0026793708,"threshold_uncertainty_score":0.051735044},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06463223,0.00072423095,0.9207986,0.0009776105,0.00033105808,0.00009687874,0.00014120773,0.00033320833,0.011965074],"genre_scores_gemma":[0.834539,0.0006111072,0.15724844,0.0008867558,0.00023859678,0.00014006504,0.00011619443,0.00010104345,0.006118834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858886,0.00033014215,0.00010146024,0.00029983514,0.00044052675,0.00023915681],"domain_scores_gemma":[0.997787,0.0008312365,0.00021049024,0.00038488235,0.00057988224,0.00020649597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018747306,0.00044043182,0.00073287485,0.00045557224,0.00052016735,0.0014234843,0.0019293405,0.0007689507,0.0013249883],"category_scores_gemma":[0.0045837094,0.00025054984,0.0006442696,0.00066032034,0.0012947028,0.0014827846,0.00074916333,0.0017972351,0.00027101944],"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.00017650542,0.000101421,0.0016417094,0.00014098568,0.00006979058,0.00045345738,0.00021896775,0.27989808,0.011048952,0.62749296,0.009439279,0.06931779],"study_design_scores_gemma":[0.00005968415,0.00008150251,0.00051115226,0.000029010409,0.000029212468,0.00018788253,0.0000466813,0.80956155,0.0042376034,0.17774531,0.007448742,0.0000617319],"about_ca_topic_score_codex":0.0058881426,"about_ca_topic_score_gemma":0.0037662368,"teacher_disagreement_score":0.0058881426,"about_ca_system_score_codex":0.0015311759,"about_ca_system_score_gemma":0.0018444994,"threshold_uncertainty_score":0.011707723},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21581078,0.0026110157,0.72734505,0.012727108,0.0013175339,0.00031000798,0.0025471102,0.0011596349,0.0361718],"genre_scores_gemma":[0.95134896,0.0032777006,0.023404485,0.0012547295,0.00044552117,0.00029564914,0.0012345728,0.00035024926,0.018388204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984804,0.00059800694,0.000077111035,0.00025177622,0.0002543093,0.00033837828],"domain_scores_gemma":[0.99216366,0.004730899,0.0010540189,0.0008196586,0.00096405327,0.00026764817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044736243,0.0009986855,0.0009342062,0.0014262383,0.00049095374,0.002647729,0.003004036,0.0030497971,0.006465315],"category_scores_gemma":[0.036836334,0.0011284287,0.0014823102,0.0019541774,0.0010852665,0.004500817,0.000978482,0.0022398352,0.0031230205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030009742,0.00017674723,0.032748926,0.00033067085,0.00017590862,0.0007983678,0.0013576044,0.6047351,0.001506255,0.2765607,0.017969532,0.06334019],"study_design_scores_gemma":[0.000027686981,0.00004054858,0.003331792,0.000060517606,0.000030739924,0.0002634163,0.00026700954,0.9111512,0.00020256065,0.079670824,0.004915999,0.000037761383],"about_ca_topic_score_codex":0.018052218,"about_ca_topic_score_gemma":0.0067036855,"teacher_disagreement_score":0.018052218,"about_ca_system_score_codex":0.0014686722,"about_ca_system_score_gemma":0.0010384925,"threshold_uncertainty_score":0.035894275},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049096785,0.0016773262,0.9263982,0.004385035,0.0004672627,0.00010838398,0.00019409407,0.00023746183,0.017435335],"genre_scores_gemma":[0.908064,0.0016126592,0.07953491,0.0012014144,0.0005272853,0.00016712493,0.00010097832,0.00010992824,0.008681618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962747,0.0017674855,0.000094420684,0.00064377615,0.0005165147,0.00070310076],"domain_scores_gemma":[0.9926341,0.0046705105,0.00065784843,0.0006498653,0.0005626143,0.00082504534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00418009,0.0021936074,0.0021458473,0.00096960505,0.0020967259,0.0053674895,0.0057553193,0.004010394,0.0053405045],"category_scores_gemma":[0.011798896,0.0015563774,0.001827401,0.0011837854,0.0058142873,0.009504602,0.0033553168,0.0053806086,0.0005376603],"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.00011747414,0.000122018944,0.0006576778,0.00005930745,0.00005834601,0.00021887694,0.00021771903,0.14192659,0.0010848455,0.85029244,0.001935619,0.0033090953],"study_design_scores_gemma":[0.000032784374,0.00003561953,0.00012490276,0.000017328757,0.000022018512,0.000052900174,0.00006767971,0.6601503,0.00024429528,0.33806977,0.0011409494,0.000041484574],"about_ca_topic_score_codex":0.008833679,"about_ca_topic_score_gemma":0.006655126,"teacher_disagreement_score":0.008833679,"about_ca_system_score_codex":0.0047129663,"about_ca_system_score_gemma":0.003657453,"threshold_uncertainty_score":0.034195125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92835474,0.00015242118,0.06771119,0.0006317015,0.000031900385,0.00006359389,0.00010574796,0.0000996572,0.0028490901],"genre_scores_gemma":[0.9983821,0.000041711133,0.0011827473,0.000026823205,0.000007010356,0.000008315196,0.000014820571,0.0000037880118,0.00033259948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827814,0.0006797359,0.00007115019,0.00017823846,0.00024766425,0.00054503366],"domain_scores_gemma":[0.9793099,0.015130485,0.0028021915,0.0004828005,0.00083667436,0.0014379862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028260523,0.00073020614,0.0009877444,0.000724175,0.0010293351,0.001710313,0.001310248,0.0013336024,0.0017971395],"category_scores_gemma":[0.012511573,0.00045298354,0.00063124974,0.00046801366,0.001739265,0.001687827,0.0010962778,0.0012523916,0.0000995701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059976935,0.0002813641,0.008115019,0.000116732954,0.00011413481,0.0012263196,0.0006819309,0.9093272,0.008120724,0.06356392,0.0010158455,0.0068369824],"study_design_scores_gemma":[0.000029127492,0.00015585197,0.0016725038,0.0000064290193,0.000026076543,0.00006915797,0.00014099402,0.9891489,0.00048552285,0.008145825,0.00008951225,0.000030095693],"about_ca_topic_score_codex":0.009395719,"about_ca_topic_score_gemma":0.00670736,"teacher_disagreement_score":0.009395719,"about_ca_system_score_codex":0.001831402,"about_ca_system_score_gemma":0.0014952652,"threshold_uncertainty_score":0.018682063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47548747,0.0013114004,0.5179199,0.0014113707,0.00009860904,0.00007080772,0.00006604973,0.00042683992,0.0032075092],"genre_scores_gemma":[0.99105084,0.00021305511,0.007555708,0.0001051956,0.0000352513,0.000038597715,0.000027769465,0.000036131514,0.00093753776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991191,0.00038520622,0.00003018662,0.00012809808,0.00018811303,0.00014939549],"domain_scores_gemma":[0.9914231,0.0059217536,0.0011523564,0.0004079089,0.000638083,0.00045687356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003994548,0.0006437381,0.0009501722,0.0011978614,0.0007972756,0.0011817017,0.0013079615,0.0011742937,0.0007210613],"category_scores_gemma":[0.016331846,0.0005551944,0.00060090306,0.0006218517,0.0028001561,0.0029654938,0.0010297744,0.0013388137,0.00008731445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014109103,0.00009079105,0.0024672942,0.00007727148,0.000052507257,0.00022355322,0.00023585345,0.8151151,0.0061997967,0.17042321,0.0007242226,0.0042491434],"study_design_scores_gemma":[0.0000048792467,0.000014338345,0.00026943677,0.000004174316,0.000004219013,0.000017015484,0.000017159788,0.9835998,0.000217485,0.015773017,0.00006979223,0.000008751382],"about_ca_topic_score_codex":0.0054998877,"about_ca_topic_score_gemma":0.0027082902,"teacher_disagreement_score":0.0054998877,"about_ca_system_score_codex":0.0030676718,"about_ca_system_score_gemma":0.0011153027,"threshold_uncertainty_score":0.022257626},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09559214,0.0029137528,0.8848888,0.0017325897,0.00019587117,0.00006195418,0.00025660102,0.00028139865,0.014076745],"genre_scores_gemma":[0.92955744,0.0017883586,0.03168688,0.00019766415,0.00025453878,0.00009914979,0.00027287565,0.00010851914,0.0360345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985209,0.0005904955,0.00006517395,0.00024518097,0.0003371393,0.00024106808],"domain_scores_gemma":[0.99790883,0.0011568731,0.00025638155,0.00014450387,0.00035770953,0.00017574008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033594829,0.0011255296,0.0022251615,0.0013705532,0.0011235339,0.0038228654,0.003286333,0.0034573376,0.0058295936],"category_scores_gemma":[0.007543356,0.0007220973,0.0019770872,0.0018409798,0.00205013,0.005725771,0.0017053548,0.0030446055,0.00058046886],"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.000071982744,0.0000698708,0.00086762954,0.00006387556,0.000054941742,0.00022385777,0.00015564192,0.22985765,0.0010508972,0.75961256,0.0013721243,0.006598985],"study_design_scores_gemma":[0.000014973538,0.000018558483,0.00021685864,0.000005936016,0.00002006859,0.000036907913,0.00001581059,0.87560606,0.00010224069,0.123534694,0.0004034463,0.000024532876],"about_ca_topic_score_codex":0.011618294,"about_ca_topic_score_gemma":0.00455956,"teacher_disagreement_score":0.011618294,"about_ca_system_score_codex":0.0024278827,"about_ca_system_score_gemma":0.0018755498,"threshold_uncertainty_score":0.02310133},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0099497475,0.00011044941,0.9871999,0.0003424438,0.000066203924,0.000037304006,0.00007523144,0.0002309259,0.001987769],"genre_scores_gemma":[0.6505077,0.0005659202,0.34354693,0.00034450463,0.0001719819,0.0002735077,0.00039467265,0.000119392585,0.0040754587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900573,0.00042401793,0.00005977208,0.00010712124,0.00033591717,0.000067467416],"domain_scores_gemma":[0.99558973,0.003074368,0.00026880714,0.0003443073,0.00053416484,0.00018856842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018054603,0.00055546773,0.0007498776,0.0007766074,0.000574075,0.00087160984,0.0014312194,0.0013368572,0.0022122576],"category_scores_gemma":[0.008428816,0.0004178187,0.00087767735,0.0008921335,0.0009561081,0.0010673271,0.0017943933,0.00163229,0.00035892715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033744145,0.00003717918,0.0007519001,0.00002105863,0.000021744885,0.000068670066,0.00003559585,0.90829,0.0008562032,0.07880462,0.000689252,0.010390001],"study_design_scores_gemma":[0.000002162082,0.000004326257,0.00001756504,0.0000011343001,0.0000014917034,0.000008564585,0.0000010820233,0.995363,0.000086421154,0.0042774603,0.00023424256,0.000002494348],"about_ca_topic_score_codex":0.0073524807,"about_ca_topic_score_gemma":0.0040632375,"teacher_disagreement_score":0.0073524807,"about_ca_system_score_codex":0.0008595535,"about_ca_system_score_gemma":0.0015606047,"threshold_uncertainty_score":0.01461935},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43071193,0.0005492452,0.56099147,0.0017367717,0.00007902831,0.00009754599,0.00027378774,0.00035383794,0.005206416],"genre_scores_gemma":[0.9914527,0.00012240493,0.007805554,0.00005180944,0.000024834793,0.00002453989,0.00007226072,0.000016038308,0.00042983476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772805,0.0010057254,0.00007326705,0.00037490894,0.0004359567,0.0003821371],"domain_scores_gemma":[0.98648083,0.010919654,0.0012852477,0.00046025633,0.0005149927,0.0003390856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004022874,0.000834444,0.0010427133,0.00045774487,0.0008863625,0.00171763,0.0010672682,0.0011644263,0.0007747421],"category_scores_gemma":[0.016096454,0.00063777965,0.00060729694,0.0007575647,0.0016627176,0.0020706316,0.0012899142,0.0018550891,0.00008066823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023050801,0.000008157451,0.00033274564,0.000006817437,0.000007464782,0.00002355995,0.00001993652,0.995481,0.00008592472,0.0032605731,0.000077583296,0.00067315507],"study_design_scores_gemma":[0.0000035380567,0.0000076014894,0.00015063769,9.4741245e-7,0.0000018284823,0.000004307986,0.000013245898,0.99590045,0.000049335675,0.003815694,0.00004877978,0.0000036288707],"about_ca_topic_score_codex":0.027988153,"about_ca_topic_score_gemma":0.011727406,"teacher_disagreement_score":0.027988153,"about_ca_system_score_codex":0.0029618684,"about_ca_system_score_gemma":0.0018756444,"threshold_uncertainty_score":0.055650532},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35687163,0.00087413506,0.4628885,0.012643664,0.00088625995,0.00046983585,0.00032775925,0.0028952234,0.16214313],"genre_scores_gemma":[0.9819244,0.000072405724,0.009463589,0.00041597852,0.000097637,0.000059746948,0.000019926678,0.000048437832,0.007897839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969695,0.0010319438,0.00013560489,0.00050274906,0.00060458836,0.0007556645],"domain_scores_gemma":[0.9855167,0.008801918,0.0011711846,0.0021614865,0.0007606985,0.0015879347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048590726,0.000841679,0.0009437878,0.00070697535,0.0009545425,0.0032110552,0.0016988565,0.0022168644,0.017172443],"category_scores_gemma":[0.021744007,0.0004888773,0.00050111266,0.000863721,0.0011394992,0.0032890802,0.0039053962,0.0021609953,0.001300244],"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.001326754,0.00083247357,0.004134445,0.00032215167,0.00021201844,0.00056181574,0.0005884708,0.14170061,0.021365322,0.6707956,0.015999982,0.14216033],"study_design_scores_gemma":[0.000114360904,0.00032554724,0.0019796856,0.000050129147,0.000086568994,0.00017614556,0.0002934623,0.38253963,0.0043158494,0.59587103,0.014202348,0.000045246466],"about_ca_topic_score_codex":0.0012313718,"about_ca_topic_score_gemma":0.0014568634,"teacher_disagreement_score":0.017172443,"about_ca_system_score_codex":0.0015173221,"about_ca_system_score_gemma":0.0029410014,"threshold_uncertainty_score":0.057447612},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18107511,0.00097330404,0.79484963,0.001801785,0.00015357608,0.00013833618,0.00036723755,0.00021489877,0.020426126],"genre_scores_gemma":[0.93577206,0.00059672893,0.052980255,0.00009606711,0.000070979884,0.0001185013,0.00011556054,0.000057973324,0.010191899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902666,0.0003689242,0.00003471388,0.00016149684,0.00021483858,0.00019340462],"domain_scores_gemma":[0.9979463,0.0013146577,0.00030485733,0.00013331344,0.0001533944,0.00014741994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016482569,0.0010595693,0.0013009686,0.0008053024,0.0007087043,0.0022395805,0.0021577699,0.0012795165,0.003517881],"category_scores_gemma":[0.00464507,0.00094487565,0.0009787299,0.0013878159,0.002322441,0.0018832638,0.0013109304,0.0016404917,0.0003617935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057485828,0.000051528536,0.00035852677,0.000042637457,0.00001681524,0.00012239888,0.000023856282,0.9575196,0.00034384054,0.03771998,0.0004052612,0.0033380496],"study_design_scores_gemma":[0.000019745203,0.000018786119,0.000110172856,0.0000040822642,0.000006450232,0.000014921199,0.000013730488,0.9864406,0.00016189125,0.012906532,0.00029441583,0.000008654756],"about_ca_topic_score_codex":0.012330373,"about_ca_topic_score_gemma":0.007527287,"teacher_disagreement_score":0.012330373,"about_ca_system_score_codex":0.002758139,"about_ca_system_score_gemma":0.001998693,"threshold_uncertainty_score":0.024517238},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27847666,0.0006677802,0.7092006,0.0008794765,0.00021332873,0.00014984478,0.00012002202,0.0010375106,0.00925469],"genre_scores_gemma":[0.95059615,0.00014354501,0.045382597,0.00013666967,0.000043400676,0.000058437534,0.0000635924,0.0001531235,0.0034224703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989723,0.00022717372,0.00003668325,0.00019902622,0.00019236401,0.00037250074],"domain_scores_gemma":[0.99831307,0.0008626312,0.00017590434,0.00016811711,0.0002812866,0.00019900397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011462785,0.0008789825,0.0014265908,0.0003922083,0.00058951526,0.00144327,0.0015424328,0.0010293876,0.004235833],"category_scores_gemma":[0.0041371537,0.0004763903,0.00042587178,0.0005797526,0.0009000063,0.0015344584,0.00085930823,0.0014080596,0.00043878655],"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.0006510505,0.00023993813,0.00040411617,0.00014673112,0.000036780406,0.00011196641,0.000100473866,0.91970116,0.028490465,0.010437576,0.0023125084,0.037367277],"study_design_scores_gemma":[0.000028095928,0.00019237582,0.00016383968,0.000008767126,0.00001625303,0.000023854118,0.000033086566,0.9924775,0.003216539,0.0032954449,0.000533047,0.000011212501],"about_ca_topic_score_codex":0.004668631,"about_ca_topic_score_gemma":0.0034223155,"teacher_disagreement_score":0.004668631,"about_ca_system_score_codex":0.001895846,"about_ca_system_score_gemma":0.0030643095,"threshold_uncertainty_score":0.014170289},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44347098,0.0021686684,0.54292315,0.0014786107,0.00019286053,0.00013457761,0.00021896395,0.00027587503,0.00913638],"genre_scores_gemma":[0.9853468,0.00045468923,0.010361764,0.00011282562,0.00007647426,0.000048610644,0.00007558684,0.000043317745,0.0034799965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993143,0.00016948514,0.000023036648,0.00009903107,0.00017032171,0.00022379316],"domain_scores_gemma":[0.9983177,0.0006311962,0.00044370006,0.00004598209,0.00036142135,0.00020000472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012138642,0.0007459294,0.0008942586,0.0011155758,0.00083523226,0.0012192954,0.0014814445,0.0009826799,0.0014839033],"category_scores_gemma":[0.0032683006,0.00035859385,0.0007663486,0.00076021836,0.0011325992,0.0014798696,0.0010031908,0.00077413366,0.00012944345],"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.000115237424,0.00007119193,0.0052740597,0.00011748897,0.000059167156,0.0009294648,0.00020459882,0.86918783,0.0062992517,0.111542284,0.0014203857,0.0047790552],"study_design_scores_gemma":[0.0000030350916,0.000014657673,0.00033598096,0.0000032958021,0.0000049978635,0.00003300925,0.0000204009,0.9964026,0.0001347802,0.0029203496,0.00011984741,0.0000070539804],"about_ca_topic_score_codex":0.00974367,"about_ca_topic_score_gemma":0.003761166,"teacher_disagreement_score":0.00974367,"about_ca_system_score_codex":0.0016691294,"about_ca_system_score_gemma":0.0014740181,"threshold_uncertainty_score":0.019373894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015942056,0.0100514805,0.46760032,0.0049266913,0.002181889,0.000058242662,0.00027947334,0.00095203664,0.49800786],"genre_scores_gemma":[0.45076984,0.008428699,0.039389256,0.00084988296,0.0017069199,0.00025535023,0.00035064208,0.0006073599,0.49764207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996667,0.000056515477,0.000010757178,0.000058823996,0.0001587026,0.00004846581],"domain_scores_gemma":[0.9995185,0.00024053785,0.000031153882,0.000111596884,0.00006395294,0.000034330405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045616785,0.00058764213,0.0005404287,0.00043289055,0.00044533302,0.0018743023,0.00072247686,0.0007301905,0.01794719],"category_scores_gemma":[0.0015587081,0.00033787615,0.0003264009,0.00067496195,0.0014711869,0.003045363,0.0010906766,0.0017238714,0.0025218332],"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.00001090308,0.0000146778275,0.00001874512,0.00002466654,0.000004115833,0.00001048208,0.000029209252,0.004540068,0.0005810879,0.9633565,0.009324231,0.0220853],"study_design_scores_gemma":[0.000007192574,0.0000093068875,0.00007038764,0.000011381081,0.0000027833196,0.000017591441,0.000012188559,0.023479255,0.0005578153,0.9506019,0.025224166,0.0000062068702],"about_ca_topic_score_codex":0.0007389509,"about_ca_topic_score_gemma":0.00047141494,"teacher_disagreement_score":0.01794719,"about_ca_system_score_codex":0.0008896951,"about_ca_system_score_gemma":0.0005118796,"threshold_uncertainty_score":0.06003934},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45724162,0.0010006115,0.5181408,0.0046344795,0.00067962805,0.00039005393,0.0028284842,0.0021477554,0.012936532],"genre_scores_gemma":[0.96913254,0.00035632317,0.019507105,0.00032112558,0.00022456479,0.00016435828,0.00091756874,0.00019598269,0.009180371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987778,0.00024444828,0.000043616845,0.00021120583,0.00028726622,0.00043568516],"domain_scores_gemma":[0.99472094,0.0029272279,0.00046644325,0.0002905169,0.0010840881,0.00051079126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00324224,0.00082824484,0.0008775155,0.0012934579,0.0011622992,0.0022787394,0.002872909,0.0014440687,0.0075122304],"category_scores_gemma":[0.008606377,0.00041542883,0.00049576984,0.0010591041,0.0013762894,0.0018493651,0.0010086822,0.0015890236,0.000790143],"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.0025252253,0.00033097362,0.0067400443,0.00024996107,0.00007519306,0.00044954603,0.0005259128,0.2768928,0.021322176,0.644306,0.024492076,0.022090044],"study_design_scores_gemma":[0.00004476184,0.0000643886,0.0009584579,0.000015597341,0.000014884522,0.000055113793,0.00007524949,0.9649648,0.0013612311,0.031695,0.000719246,0.000031243766],"about_ca_topic_score_codex":0.0133684315,"about_ca_topic_score_gemma":0.009537411,"teacher_disagreement_score":0.0133684315,"about_ca_system_score_codex":0.004330153,"about_ca_system_score_gemma":0.003454103,"threshold_uncertainty_score":0.031417668},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08152233,0.00060787064,0.90938497,0.0015095547,0.00013218744,0.0001295898,0.0005760472,0.0033775712,0.0027597942],"genre_scores_gemma":[0.6348358,0.00022783151,0.35640827,0.0007607639,0.00034491115,0.00032429633,0.0016561262,0.0003155577,0.0051265587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992799,0.0002117013,0.000042586355,0.00025284372,0.00011336094,0.00009967024],"domain_scores_gemma":[0.9947307,0.0036438827,0.00045921537,0.00041093022,0.00057161174,0.00018364612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018568999,0.0009977225,0.0010965546,0.0006727005,0.00062437507,0.001007472,0.0027771113,0.0017160805,0.0020041277],"category_scores_gemma":[0.0070689176,0.0006412055,0.0008856855,0.00070623256,0.0008735708,0.001466066,0.0011882546,0.003199819,0.00048753354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015795919,0.00023295415,0.0032641832,0.00016600841,0.00008521966,0.00008066958,0.00008300203,0.8711274,0.0010500143,0.007660647,0.006237504,0.109854296],"study_design_scores_gemma":[0.000005345804,0.000007945559,0.00007591137,0.0000024175433,0.000001708545,0.0000030729036,0.0000037820148,0.99737394,0.00015937637,0.002282418,0.00008244857,0.0000015664308],"about_ca_topic_score_codex":0.012247284,"about_ca_topic_score_gemma":0.015921304,"teacher_disagreement_score":0.012247284,"about_ca_system_score_codex":0.0020206326,"about_ca_system_score_gemma":0.0029345066,"threshold_uncertainty_score":0.024352014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55248255,0.00080036256,0.43752202,0.0021387674,0.00012235041,0.0001570715,0.000275652,0.00033824117,0.006163046],"genre_scores_gemma":[0.98747617,0.00015937092,0.011770023,0.000036159367,0.00004398142,0.00002481642,0.000053635733,0.000013855692,0.00042187487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985436,0.000675217,0.00004510533,0.00031180313,0.00018700151,0.0002372528],"domain_scores_gemma":[0.9913741,0.0061612073,0.0010470715,0.0003883333,0.00052321237,0.0005061065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022148064,0.00095077534,0.000805591,0.0008367534,0.00073898426,0.0029717544,0.0015515743,0.0015230204,0.0036939639],"category_scores_gemma":[0.012604446,0.00036544033,0.0007169402,0.0011767396,0.0016687368,0.0043192874,0.0017302955,0.0014030066,0.00025912834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042631602,0.0005816564,0.015647572,0.00022300475,0.00006798505,0.00027227937,0.0007528701,0.8903623,0.0030061777,0.034274496,0.0014114215,0.05297386],"study_design_scores_gemma":[0.00001592367,0.00024505125,0.0024981843,0.000016523449,0.000024505858,0.000051484065,0.00035085168,0.9798308,0.00057160674,0.01583712,0.0005352505,0.000022604745],"about_ca_topic_score_codex":0.005499337,"about_ca_topic_score_gemma":0.0020499562,"teacher_disagreement_score":0.005499337,"about_ca_system_score_codex":0.0017387244,"about_ca_system_score_gemma":0.0012101537,"threshold_uncertainty_score":0.012615383},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3836606,0.0019531532,0.60507894,0.0012070962,0.00034352927,0.00019247418,0.00033473276,0.00062479865,0.006604622],"genre_scores_gemma":[0.98500466,0.00044931495,0.010404277,0.000064739776,0.0001035659,0.000052551255,0.000069302136,0.000016974085,0.0038346841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762636,0.00065586006,0.00014043528,0.00050157914,0.00047363812,0.000602068],"domain_scores_gemma":[0.9975452,0.0010487929,0.0005355911,0.00015640125,0.0004672914,0.00024670127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024893058,0.0011736791,0.0016242053,0.0009315357,0.0018531723,0.0021901806,0.0036108096,0.0015196298,0.002118998],"category_scores_gemma":[0.0033971628,0.0006337575,0.00086027215,0.0015018437,0.0015699601,0.002268539,0.0015604857,0.0013445029,0.0003215665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056348764,0.00019194733,0.0054765223,0.00023106305,0.00009319974,0.00290896,0.00050671515,0.90911347,0.008698355,0.05736282,0.00151244,0.013341046],"study_design_scores_gemma":[0.000019774634,0.00007520684,0.00032025255,0.0000045194647,0.000022703105,0.00013201578,0.000070951835,0.99528813,0.00041419265,0.0033364051,0.00029767927,0.000018118504],"about_ca_topic_score_codex":0.014805529,"about_ca_topic_score_gemma":0.0077355495,"teacher_disagreement_score":0.014805529,"about_ca_system_score_codex":0.002611455,"about_ca_system_score_gemma":0.002013017,"threshold_uncertainty_score":0.029438674},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019031639,0.00018495145,0.99259925,0.00023515765,0.0001373084,0.00005916034,0.000051068164,0.00007086024,0.0047591147],"genre_scores_gemma":[0.4441095,0.0012646819,0.5230387,0.00059119624,0.0005964252,0.00075029256,0.00032408617,0.00047611215,0.028849015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934727,0.00027048454,0.000020998295,0.00009124306,0.00021016979,0.000059856015],"domain_scores_gemma":[0.9988458,0.0007557647,0.000061493614,0.000050362098,0.00021295236,0.00007365433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015725902,0.0013442758,0.0011261742,0.0006440231,0.000563199,0.0017152686,0.0022591506,0.0016800298,0.008773982],"category_scores_gemma":[0.0034285919,0.001001407,0.0011195531,0.0012053979,0.001069998,0.0013472621,0.0012402756,0.0021323469,0.0007861789],"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.00001407711,0.000021509908,0.000041402716,0.000041703654,0.000011267273,0.000027331069,0.00002035292,0.96281385,0.0003002139,0.028633187,0.0012681525,0.00680698],"study_design_scores_gemma":[0.000004275089,0.000007584728,0.000010560664,0.0000035139235,0.0000030310064,0.0000030371752,0.0000035815283,0.9907539,0.000039074406,0.008625247,0.0005444619,0.0000018271857],"about_ca_topic_score_codex":0.008176687,"about_ca_topic_score_gemma":0.009081963,"teacher_disagreement_score":0.008773982,"about_ca_system_score_codex":0.001984721,"about_ca_system_score_gemma":0.0025380936,"threshold_uncertainty_score":0.02935189},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052235577,0.0015566185,0.0075072967,0.0034408835,0.00026504212,0.00025087484,0.926464,0.0032185118,0.0050612357],"genre_scores_gemma":[0.09459969,0.0007660134,0.009908173,0.000460607,0.00006636691,0.00046874137,0.89114016,0.00013996502,0.0024502415],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865735,0.00040358113,0.00016952805,0.00034340218,0.00023960856,0.0001864517],"domain_scores_gemma":[0.9955539,0.0023016597,0.0003710978,0.0009426931,0.00064508343,0.00018544999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023903057,0.0012224935,0.0009548058,0.0017070002,0.0008268129,0.001806019,0.00356825,0.0023313288,0.008600804],"category_scores_gemma":[0.012598893,0.0006002777,0.0011930236,0.0029089097,0.0003992789,0.0019379882,0.0011745269,0.0018399644,0.0042888615],"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.0005755454,0.00050324784,0.024445849,0.0016714373,0.00027015537,0.00023057355,0.00022526305,0.16454022,0.00066082674,0.011421766,0.76206356,0.033391614],"study_design_scores_gemma":[0.001558516,0.00018271685,0.031783603,0.0005136643,0.00015760688,0.0003923847,0.00051665504,0.6181713,0.0016747377,0.048755486,0.29612124,0.00017208963],"about_ca_topic_score_codex":0.07077199,"about_ca_topic_score_gemma":0.08784275,"teacher_disagreement_score":0.07077199,"about_ca_system_score_codex":0.0029126008,"about_ca_system_score_gemma":0.0020098295,"threshold_uncertainty_score":0.14072013},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2437465,0.009763708,0.64143974,0.0066913203,0.00065685913,0.00015179336,0.00046784946,0.0011876563,0.0958946],"genre_scores_gemma":[0.9598042,0.0031126358,0.024770774,0.00062139065,0.0010671386,0.00015230839,0.00024884997,0.00035788823,0.0098648835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980215,0.0008300145,0.0000961644,0.00021365503,0.00054528716,0.0002934839],"domain_scores_gemma":[0.97438127,0.019603536,0.0013713686,0.0012872064,0.0025950659,0.00076162664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00707472,0.001200635,0.0016473542,0.0038282096,0.0016395272,0.0039624567,0.0027309721,0.0019276161,0.004449826],"category_scores_gemma":[0.057855934,0.0008688378,0.0015941081,0.003003412,0.004066241,0.006163536,0.0024272418,0.005299285,0.0007658661],"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.000151063,0.00016425074,0.002341838,0.00017167378,0.000050089493,0.00038053512,0.0005101715,0.04173887,0.0020411562,0.9341866,0.0042422437,0.014021539],"study_design_scores_gemma":[0.000023449944,0.000026336176,0.0012957132,0.00008491376,0.000039400158,0.00024716012,0.00014426172,0.5528512,0.00059670064,0.44335592,0.0012778545,0.00005719589],"about_ca_topic_score_codex":0.0042594806,"about_ca_topic_score_gemma":0.0023756656,"teacher_disagreement_score":0.00707472,"about_ca_system_score_codex":0.0037444546,"about_ca_system_score_gemma":0.0019124318,"threshold_uncertainty_score":0.037415087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027679438,0.00033611644,0.98992157,0.00028733187,0.000059141013,0.000021657397,0.000025258032,0.0001266102,0.0064544054],"genre_scores_gemma":[0.54217607,0.0027938946,0.4215041,0.0014297798,0.0009101373,0.00046099658,0.00024099823,0.0003589422,0.030125093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985989,0.00046231443,0.000051655457,0.00024778003,0.00048610548,0.00015336406],"domain_scores_gemma":[0.998251,0.0008590041,0.00021080756,0.00017807407,0.00038045368,0.0001206784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020809765,0.0006920155,0.00066835986,0.0015425486,0.00073806866,0.0018847057,0.0017964869,0.0011937239,0.0057435036],"category_scores_gemma":[0.005483059,0.00045868027,0.0010410656,0.0009877387,0.0012728664,0.00373113,0.0020559123,0.0034250892,0.001329284],"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.000021964725,0.0000503337,0.0002015071,0.0000740091,0.000021883183,0.00007719324,0.00014605209,0.0696889,0.001565327,0.90205896,0.0016895137,0.024404345],"study_design_scores_gemma":[0.0000068660856,0.00003090757,0.00010265333,0.000021568547,0.000010271733,0.000064126616,0.000037149086,0.6802907,0.0003841716,0.3122163,0.006818566,0.00001673856],"about_ca_topic_score_codex":0.002604,"about_ca_topic_score_gemma":0.0017376099,"teacher_disagreement_score":0.0057435036,"about_ca_system_score_codex":0.0016114701,"about_ca_system_score_gemma":0.0012092977,"threshold_uncertainty_score":0.019213915},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09572584,0.0007329692,0.87240094,0.0046380293,0.00038299742,0.00014958839,0.00050235714,0.0004031021,0.025064295],"genre_scores_gemma":[0.91881084,0.0009092175,0.037216373,0.00038246866,0.00028854847,0.00017600202,0.00022386361,0.000113775335,0.041878887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861586,0.0004856166,0.000059984774,0.00031382122,0.00026403271,0.00026061392],"domain_scores_gemma":[0.99574214,0.0025562528,0.00031879122,0.00024527052,0.00071570114,0.0004218113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033386853,0.0008666827,0.0015460594,0.001324616,0.0013509908,0.0038587695,0.0035366206,0.0033941758,0.009402303],"category_scores_gemma":[0.010988891,0.0009313182,0.0010487085,0.00159673,0.0024601782,0.006123292,0.0018935881,0.0026153552,0.0010652564],"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.0000766812,0.00009249801,0.00090060476,0.00005100456,0.000030819927,0.00019656614,0.00030248382,0.2289123,0.001363858,0.75876087,0.0030572445,0.0062549966],"study_design_scores_gemma":[0.00002879749,0.000018669247,0.00014140221,0.000008941404,0.000013872788,0.000035376786,0.000043986878,0.8972777,0.00012407264,0.10125274,0.0010313792,0.000023078257],"about_ca_topic_score_codex":0.01784991,"about_ca_topic_score_gemma":0.007151739,"teacher_disagreement_score":0.01784991,"about_ca_system_score_codex":0.004222046,"about_ca_system_score_gemma":0.003410459,"threshold_uncertainty_score":0.035492063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2041853,0.0016241772,0.74053055,0.003631362,0.0005966498,0.00055491284,0.0011734808,0.00035506327,0.047348477],"genre_scores_gemma":[0.93836,0.0006440829,0.03357889,0.00027188333,0.00018067843,0.00038303118,0.00027680057,0.00003051488,0.026274215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766976,0.0008381082,0.00011438469,0.00044222476,0.00048164916,0.00045377036],"domain_scores_gemma":[0.99754226,0.001329562,0.00031468557,0.000075563294,0.00029290857,0.0004450807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019570235,0.001432903,0.0017179749,0.0008583239,0.0012330015,0.0035532198,0.00376832,0.003147101,0.0062845456],"category_scores_gemma":[0.0035514457,0.000977925,0.0009569957,0.0012778565,0.002210992,0.0023097137,0.001741346,0.00214704,0.0006584583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027112474,0.00025610483,0.000865948,0.00017304711,0.000082157436,0.00092648895,0.00040337545,0.67549306,0.002856071,0.3134571,0.0014716911,0.0037437484],"study_design_scores_gemma":[0.00011082961,0.000084993844,0.00013360547,0.000008929856,0.000023117684,0.000043543867,0.000057376426,0.9788286,0.0001467887,0.019556278,0.0009825334,0.000023360628],"about_ca_topic_score_codex":0.028622683,"about_ca_topic_score_gemma":0.014177691,"teacher_disagreement_score":0.028622683,"about_ca_system_score_codex":0.0038598182,"about_ca_system_score_gemma":0.0029135991,"threshold_uncertainty_score":0.056912184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1578656,0.0028728996,0.79826987,0.006092622,0.0010338848,0.00029266343,0.0013550159,0.00069608266,0.031521346],"genre_scores_gemma":[0.9231593,0.0018796406,0.04158715,0.0008157544,0.0006461992,0.00029969346,0.00032650612,0.00007588147,0.031209892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998187,0.00048181706,0.000103251805,0.00049300736,0.00039298183,0.00034186218],"domain_scores_gemma":[0.99797624,0.0008296536,0.00031636225,0.00016061933,0.00040078224,0.00031632694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015597267,0.0012081147,0.0011949805,0.0008317104,0.0013225941,0.0037957483,0.0033984175,0.0037845243,0.0037834009],"category_scores_gemma":[0.0043602036,0.0007243172,0.0008979783,0.0018523734,0.002251317,0.0039074523,0.0018803566,0.002748286,0.0010501752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023282527,0.0001834765,0.0015346294,0.0001753268,0.00006355038,0.00083176483,0.0008156253,0.5209308,0.006268628,0.45461464,0.004126598,0.010222086],"study_design_scores_gemma":[0.00007091972,0.00010162084,0.0002594049,0.00001581796,0.000032250795,0.00011995292,0.00009468744,0.95532733,0.0003157377,0.0402911,0.0033274102,0.000043753622],"about_ca_topic_score_codex":0.020627309,"about_ca_topic_score_gemma":0.0073563103,"teacher_disagreement_score":0.020627309,"about_ca_system_score_codex":0.0028873933,"about_ca_system_score_gemma":0.0028324907,"threshold_uncertainty_score":0.041014493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0818019,0.0011842567,0.90518135,0.0029321746,0.00033103788,0.00016028485,0.00043039443,0.00021159236,0.0077669006],"genre_scores_gemma":[0.81769675,0.0013515716,0.15483022,0.00046382737,0.00039727948,0.0004765038,0.0008704829,0.00022386294,0.02368944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984824,0.0006231641,0.00006181863,0.00032510413,0.0002277476,0.00027991537],"domain_scores_gemma":[0.98562616,0.012231917,0.0006108652,0.00024424784,0.0005985914,0.00068819494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006075135,0.001434924,0.0025043706,0.0015392371,0.0016406572,0.002961808,0.0032392407,0.004158974,0.007839226],"category_scores_gemma":[0.018830385,0.0011221007,0.002295983,0.000992441,0.0038622643,0.003323783,0.0020073692,0.003190247,0.0005092611],"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.00014563029,0.000087918525,0.00095395173,0.00019314639,0.00009293038,0.0004972504,0.0002690969,0.6583131,0.0008134039,0.3339592,0.0013875568,0.0032868348],"study_design_scores_gemma":[0.000030210105,0.000023992154,0.00009378332,0.000017017348,0.000016209613,0.000033504017,0.000033559725,0.94505554,0.00015832737,0.05415855,0.00036417725,0.000015217941],"about_ca_topic_score_codex":0.018374046,"about_ca_topic_score_gemma":0.007813526,"teacher_disagreement_score":0.018374046,"about_ca_system_score_codex":0.0042020283,"about_ca_system_score_gemma":0.0041440115,"threshold_uncertainty_score":0.03653419},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13969359,0.0013305277,0.81902725,0.0023142162,0.00035029152,0.00014779666,0.00038424038,0.0016131739,0.03513901],"genre_scores_gemma":[0.89052856,0.00043635102,0.0910653,0.00034889308,0.00025674465,0.00006341285,0.00027233202,0.00020945199,0.016819054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810374,0.0006302965,0.00008989449,0.0002586746,0.00048601092,0.00043123233],"domain_scores_gemma":[0.9930401,0.003153929,0.00077503966,0.0016361855,0.0008685067,0.000526213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028123602,0.00047272485,0.00097399275,0.0012850343,0.0015900491,0.0036270975,0.0015264018,0.001969701,0.016803458],"category_scores_gemma":[0.010453799,0.00041428808,0.00085185654,0.0020012134,0.001120151,0.0053516966,0.0023929875,0.0025208618,0.0017888807],"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.00026304374,0.00016922833,0.0032569119,0.00013463279,0.00003473994,0.00049702835,0.00024412725,0.05735064,0.0027164351,0.82721317,0.005978412,0.10214165],"study_design_scores_gemma":[0.000025625683,0.000084797706,0.0013328401,0.000050060145,0.000027657306,0.00026765585,0.000114332506,0.54931843,0.0014145127,0.4423136,0.0050171628,0.000033389726],"about_ca_topic_score_codex":0.004274247,"about_ca_topic_score_gemma":0.004496881,"teacher_disagreement_score":0.016803458,"about_ca_system_score_codex":0.002145353,"about_ca_system_score_gemma":0.0018390127,"threshold_uncertainty_score":0.0562132},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42368758,0.0010493824,0.5638411,0.0010309273,0.00035687306,0.00019325352,0.000773454,0.0005752653,0.00849211],"genre_scores_gemma":[0.985444,0.00035029498,0.009024057,0.00008077911,0.00011284407,0.000087311804,0.00020507489,0.00002305722,0.0046724803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844366,0.00032999247,0.00007438584,0.00028479597,0.0003225413,0.00054462755],"domain_scores_gemma":[0.9983364,0.0006208036,0.00033463057,0.0000902634,0.00037827558,0.00023976309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012544582,0.00091326097,0.0016385862,0.00073166826,0.00097129936,0.0019261817,0.002703276,0.0015153923,0.0027742959],"category_scores_gemma":[0.0022258856,0.00064318307,0.0009498146,0.0013709227,0.0011277405,0.002212842,0.0008249152,0.0013144129,0.0003454104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036538308,0.00019663418,0.003207433,0.00014536861,0.00008970551,0.0012678138,0.00024433975,0.89636856,0.0054169483,0.0868385,0.0014917008,0.004367609],"study_design_scores_gemma":[0.00004629255,0.00005381308,0.00034062396,0.0000032713779,0.00002026364,0.00007405313,0.000034143854,0.992753,0.00020961832,0.006155173,0.00029158156,0.000018102386],"about_ca_topic_score_codex":0.01601297,"about_ca_topic_score_gemma":0.009411447,"teacher_disagreement_score":0.01601297,"about_ca_system_score_codex":0.0019611323,"about_ca_system_score_gemma":0.002232763,"threshold_uncertainty_score":0.03183955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8190212,0.0017727986,0.1664872,0.0015989476,0.00013058918,0.00011309618,0.00016707614,0.00034817826,0.010360859],"genre_scores_gemma":[0.9949536,0.00034324024,0.0041216966,0.00006991344,0.000044386532,0.000020415398,0.000022542297,0.000033541255,0.00039065906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965449,0.0012483145,0.0001368503,0.0004137352,0.0006123468,0.001043759],"domain_scores_gemma":[0.93836313,0.046644386,0.008606815,0.0027671717,0.0025189766,0.0010994428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007472103,0.0012014203,0.0011398342,0.0016342344,0.0009531003,0.0020034963,0.0013007121,0.0017042235,0.0007099011],"category_scores_gemma":[0.053110003,0.0006789937,0.0006369766,0.0015596717,0.001993533,0.0021365443,0.0014666364,0.0023000927,0.00018483303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006827397,0.0004250623,0.03194828,0.00024741818,0.0001580287,0.0034438048,0.00043058413,0.8115112,0.018430796,0.110668145,0.0019325345,0.020121409],"study_design_scores_gemma":[0.000029358875,0.00015366498,0.004913145,0.000046625868,0.00006790082,0.0005018369,0.00009636103,0.9781171,0.0058898088,0.009767481,0.00034103187,0.0000756941],"about_ca_topic_score_codex":0.007876196,"about_ca_topic_score_gemma":0.003545819,"teacher_disagreement_score":0.007876196,"about_ca_system_score_codex":0.0023358872,"about_ca_system_score_gemma":0.0022556118,"threshold_uncertainty_score":0.039516687},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074682176,0.00042387735,0.91893035,0.0012255306,0.00008476464,0.00012507047,0.000037592235,0.00018553626,0.00430522],"genre_scores_gemma":[0.9775203,0.0003113546,0.020459987,0.00009382296,0.000043418993,0.00009193659,0.000018372315,0.000021528607,0.001439258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889296,0.00040788358,0.00004436264,0.00017796492,0.00021109928,0.00026563092],"domain_scores_gemma":[0.99588495,0.002845756,0.00043087342,0.000091673304,0.00052277854,0.00022396192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023228277,0.0010061312,0.0010598031,0.0005729232,0.00059049705,0.0011969643,0.0011297787,0.0013442066,0.001952652],"category_scores_gemma":[0.006588392,0.00056823,0.0008945598,0.0004601596,0.0013490256,0.000832196,0.0013761229,0.0014796582,0.000100292506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004699228,0.000045044366,0.00028855802,0.000028698314,0.000014075532,0.000040818493,0.000038922724,0.9832274,0.00066889165,0.0108678695,0.00017668662,0.004556095],"study_design_scores_gemma":[0.000012787762,0.00003577753,0.00006403559,0.0000023187101,0.0000050430567,0.0000031199927,0.000011769273,0.99623555,0.00013713633,0.0033824712,0.000106420215,0.00000362941],"about_ca_topic_score_codex":0.013649003,"about_ca_topic_score_gemma":0.0048904642,"teacher_disagreement_score":0.013649003,"about_ca_system_score_codex":0.0021166399,"about_ca_system_score_gemma":0.0021802639,"threshold_uncertainty_score":0.027139127},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059284223,0.00020744844,0.9929188,0.000036244695,0.000050317896,0.00005054712,0.00004230808,0.00012811659,0.0006378549],"genre_scores_gemma":[0.4417375,0.0012419176,0.54625887,0.00042082882,0.0006695357,0.0006183005,0.0005210045,0.0003760382,0.0081559615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959055,0.0015012481,0.00030806827,0.00073216186,0.0010407488,0.00051219895],"domain_scores_gemma":[0.99173063,0.0035983257,0.00064255216,0.0014663643,0.0021027788,0.0004594509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007854336,0.0015895503,0.001970619,0.0034399242,0.0012885334,0.0025810332,0.004178141,0.0012672378,0.002437042],"category_scores_gemma":[0.021042347,0.0011972077,0.0023447012,0.003055245,0.0019539674,0.003790197,0.003512241,0.0022284512,0.00063697476],"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.000287454,0.00035154368,0.0048890933,0.00022059157,0.0003873471,0.0005151133,0.0002404562,0.47186136,0.0112867635,0.4469164,0.0029791621,0.060064685],"study_design_scores_gemma":[0.00000879689,0.00004743515,0.00035093562,0.0000075811527,0.000037061025,0.000045808883,0.000016712425,0.9751403,0.0006061036,0.023318699,0.000403433,0.000017131017],"about_ca_topic_score_codex":0.005171684,"about_ca_topic_score_gemma":0.0039894977,"teacher_disagreement_score":0.007854336,"about_ca_system_score_codex":0.0021162552,"about_ca_system_score_gemma":0.0035211358,"threshold_uncertainty_score":0.04153824},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28599945,0.0016621464,0.7024943,0.0011076175,0.0000923198,0.0000992407,0.0004426707,0.0004129004,0.0076892357],"genre_scores_gemma":[0.9523623,0.0010337256,0.04333719,0.00015109604,0.00013906378,0.00009821539,0.00019599768,0.00010769223,0.002574757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992576,0.00017903784,0.000048595437,0.00018710241,0.0001921974,0.00013551295],"domain_scores_gemma":[0.9821436,0.013667901,0.0021242285,0.00050185755,0.0012204226,0.00034201797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031929533,0.00073952397,0.00052194815,0.0017493413,0.00065596006,0.0022907068,0.0018365784,0.0008039706,0.0022924684],"category_scores_gemma":[0.023555746,0.0004952751,0.00066901883,0.0014279064,0.0014905873,0.0040921546,0.000868352,0.0021856064,0.0003450964],"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.000248593,0.00018816932,0.01869037,0.00028065743,0.0001280614,0.0005834895,0.0015495599,0.3321364,0.014685759,0.6077811,0.0026322755,0.02109564],"study_design_scores_gemma":[0.000019405643,0.000035838424,0.0056917905,0.000027784314,0.000036161076,0.00016523215,0.00011957563,0.8725204,0.0014815744,0.11909421,0.00074503035,0.00006297799],"about_ca_topic_score_codex":0.0047156294,"about_ca_topic_score_gemma":0.0048971334,"teacher_disagreement_score":0.0047156294,"about_ca_system_score_codex":0.0022541056,"about_ca_system_score_gemma":0.001727078,"threshold_uncertainty_score":0.016886115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06348877,0.0013450038,0.92862207,0.0009211404,0.00048390686,0.00006764359,0.00012608858,0.00018179453,0.0047636614],"genre_scores_gemma":[0.9345922,0.0011179262,0.0566176,0.0002896171,0.00036847085,0.000111158835,0.00011578682,0.00004989018,0.006737439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987325,0.0003594855,0.00008910823,0.00020339,0.00034590432,0.00026966672],"domain_scores_gemma":[0.9958021,0.0021535729,0.00073040486,0.00025342553,0.0007021448,0.00035832307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002786984,0.00092690485,0.0010555775,0.0011912057,0.00095552707,0.002138661,0.0018824993,0.001715035,0.002568937],"category_scores_gemma":[0.005283982,0.00068754866,0.0011977843,0.0010934008,0.001485303,0.002202523,0.0017522583,0.0019935227,0.0002952641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009742243,0.000114023125,0.0017017004,0.000082217426,0.000055008142,0.00045928344,0.00014589832,0.653187,0.0030684404,0.33282968,0.0012349793,0.007024313],"study_design_scores_gemma":[0.0000072393655,0.000018316774,0.00007150798,0.0000059630092,0.000006807308,0.000031036943,0.000013106746,0.9797633,0.00018334802,0.01950914,0.0003812163,0.00000915784],"about_ca_topic_score_codex":0.007206284,"about_ca_topic_score_gemma":0.0039847866,"teacher_disagreement_score":0.007206284,"about_ca_system_score_codex":0.0019526706,"about_ca_system_score_gemma":0.001993478,"threshold_uncertainty_score":0.014739156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49639317,0.00077616144,0.4730733,0.004752591,0.00013231771,0.00017108698,0.00097500836,0.0007342083,0.022992069],"genre_scores_gemma":[0.9663422,0.00026985107,0.028396333,0.00017237247,0.000071855124,0.00008123211,0.00016461186,0.00007773393,0.0044237874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987721,0.00039566742,0.00003862672,0.00018452172,0.00026360326,0.00034554873],"domain_scores_gemma":[0.9972089,0.0014953245,0.00034170153,0.000110018365,0.00045345785,0.00039064273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028364018,0.0005171273,0.0007305148,0.0010794691,0.00074189465,0.0020921046,0.0015726374,0.0015068945,0.0049671633],"category_scores_gemma":[0.0070548006,0.00044073624,0.00042647612,0.00074311375,0.0015947281,0.0019415469,0.0009099195,0.0015727752,0.00068794814],"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.00059722504,0.00020259999,0.0018849643,0.00009741299,0.00002144394,0.000346368,0.00028031043,0.3579073,0.0071577257,0.61581856,0.0052000782,0.0104861045],"study_design_scores_gemma":[0.00008701834,0.00007068344,0.0006916667,0.00001911831,0.000009527152,0.00004905315,0.000094622694,0.9171498,0.0008709191,0.08026706,0.0006488733,0.000041649495],"about_ca_topic_score_codex":0.0078729065,"about_ca_topic_score_gemma":0.004643459,"teacher_disagreement_score":0.0078729065,"about_ca_system_score_codex":0.004878715,"about_ca_system_score_gemma":0.0024919596,"threshold_uncertainty_score":0.03539771},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95115674,0.0001249597,0.04601036,0.00043839784,0.00003087329,0.000032223565,0.00009195384,0.0001553675,0.0019591067],"genre_scores_gemma":[0.9986444,0.000024584364,0.0008544049,0.000014821934,0.0000058533205,0.0000067119336,0.000017930815,0.000007994088,0.00042322758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993248,0.00020624284,0.000028716364,0.00011466101,0.000115816045,0.0002097984],"domain_scores_gemma":[0.9957425,0.0023633097,0.000786024,0.00019605151,0.00039073397,0.00052125816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015441256,0.00047317886,0.00065927836,0.0005124146,0.0007609849,0.0009962256,0.00093796675,0.0011721725,0.0013795393],"category_scores_gemma":[0.0065777497,0.0003645037,0.0004196065,0.00044428508,0.001224579,0.0010826307,0.00078994007,0.001024401,0.00016341484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041406375,0.00016165267,0.011192448,0.000060008268,0.00007508441,0.0017928252,0.00059409265,0.93832713,0.01642487,0.026292112,0.00096025853,0.0037054154],"study_design_scores_gemma":[0.000008539281,0.000040099163,0.0013213324,0.0000024506737,0.0000071520726,0.00007365278,0.00008078969,0.9962781,0.0003845201,0.0017350178,0.000057512356,0.000010745547],"about_ca_topic_score_codex":0.009492059,"about_ca_topic_score_gemma":0.003974206,"teacher_disagreement_score":0.009492059,"about_ca_system_score_codex":0.0013497511,"about_ca_system_score_gemma":0.00077515864,"threshold_uncertainty_score":0.018873632},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98849803,0.0007494968,0.0046423045,0.00046017425,0.000020431944,0.00001321888,0.00007482551,0.000015760239,0.0055257445],"genre_scores_gemma":[0.9981488,0.00021617432,0.0005553614,0.00007108001,0.000026970543,0.000003288537,0.000043630756,0.000007480348,0.0009271899],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944335,0.00023623755,0.00003164029,0.00010978222,0.00009633668,0.00008250759],"domain_scores_gemma":[0.93248665,0.058143023,0.0049282173,0.001071253,0.0016513246,0.0017195623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030418048,0.00025513483,0.0004741103,0.0006071893,0.00055060507,0.0017476862,0.0008741324,0.0008308174,0.0072945864],"category_scores_gemma":[0.030365445,0.00022185869,0.00025159065,0.0005579258,0.00085203676,0.0019069449,0.00043021142,0.0015486446,0.00053582573],"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.0053046923,0.00149031,0.73326266,0.0006123013,0.0005871722,0.0007371535,0.004175148,0.02441987,0.009841592,0.120717086,0.003329861,0.095522076],"study_design_scores_gemma":[0.00019772099,0.0009782253,0.83058536,0.00012883914,0.0003975673,0.0006993512,0.0046076784,0.090212755,0.0025645788,0.06607508,0.0034737322,0.000079157624],"about_ca_topic_score_codex":0.006095219,"about_ca_topic_score_gemma":0.005300555,"teacher_disagreement_score":0.0072945864,"about_ca_system_score_codex":0.0006184095,"about_ca_system_score_gemma":0.00047837888,"threshold_uncertainty_score":0.024402857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13137603,0.0022137407,0.8411273,0.0033019464,0.0005129448,0.00013820535,0.000103367885,0.00025533343,0.020971162],"genre_scores_gemma":[0.9319491,0.002093033,0.038926497,0.00067050685,0.0004206241,0.00009456017,0.00014349252,0.00022761036,0.025474532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982845,0.0007900262,0.00004801826,0.00022075554,0.0003055117,0.0003512664],"domain_scores_gemma":[0.9914289,0.0048430623,0.00077632704,0.000693862,0.0014655141,0.0007922468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005128795,0.0013125639,0.0013401143,0.0019750954,0.0015670573,0.002983158,0.0032944258,0.0021906046,0.0039231307],"category_scores_gemma":[0.015974458,0.0010372372,0.0015611055,0.0014376623,0.0028490967,0.007406855,0.002104244,0.0049272054,0.0008069993],"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.00025252427,0.0002061785,0.0027108623,0.000089822664,0.000070712515,0.0003178801,0.00039702552,0.40927824,0.002247198,0.5575468,0.0047614127,0.02212136],"study_design_scores_gemma":[0.000012159947,0.000027533659,0.00031348492,0.000012563571,0.000018182867,0.000049351693,0.000108168744,0.92603576,0.00030181024,0.07223751,0.00085933914,0.000024044595],"about_ca_topic_score_codex":0.008981871,"about_ca_topic_score_gemma":0.0055405637,"teacher_disagreement_score":0.008981871,"about_ca_system_score_codex":0.002904464,"about_ca_system_score_gemma":0.0024797525,"threshold_uncertainty_score":0.027123988},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22693355,0.002350247,0.7445261,0.0014188362,0.00014148332,0.00018609803,0.0002519018,0.00034051907,0.023851298],"genre_scores_gemma":[0.9873931,0.0006024391,0.010326447,0.00006400991,0.000051709172,0.000035070156,0.00004126867,0.000020724648,0.0014653748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938786,0.00021764943,0.0000195358,0.000056954035,0.00014835522,0.0001696875],"domain_scores_gemma":[0.9991073,0.00045322493,0.00011902906,0.00004196307,0.00021614738,0.00006234283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010544292,0.00084531505,0.00075350143,0.00092135544,0.00067625486,0.0013946049,0.0011084081,0.00093699445,0.00092933007],"category_scores_gemma":[0.0027945044,0.00028756796,0.00058933295,0.0008830555,0.0006093523,0.001034454,0.0008985834,0.0007088032,0.0001632857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027804675,0.0000353437,0.00088469114,0.00003252752,0.000013621506,0.00007810363,0.00004747739,0.9736734,0.0013743761,0.019727321,0.0004898821,0.003615424],"study_design_scores_gemma":[7.6576373e-7,0.00000785774,0.00006307826,0.000002280591,0.0000019373185,0.0000055849414,0.000013402205,0.9987073,0.0000875562,0.001014375,0.00009382889,0.000002003627],"about_ca_topic_score_codex":0.019601082,"about_ca_topic_score_gemma":0.0074321283,"teacher_disagreement_score":0.019601082,"about_ca_system_score_codex":0.002578421,"about_ca_system_score_gemma":0.002120175,"threshold_uncertainty_score":0.038973987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12793307,0.0010892921,0.8471383,0.0015982251,0.00021604142,0.000112959984,0.0001777739,0.00030987733,0.021424456],"genre_scores_gemma":[0.9819797,0.0003176205,0.013091225,0.000082908744,0.00006919065,0.00006616028,0.000043788536,0.000018911362,0.0043305466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906677,0.0003421619,0.00002927845,0.00021524403,0.00014041719,0.00020608009],"domain_scores_gemma":[0.9991173,0.0004744713,0.00012598433,0.000032489894,0.00015844106,0.00009135666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011788836,0.0012103451,0.001127538,0.00046322265,0.0006116579,0.001874718,0.0010525981,0.0012797175,0.0021096868],"category_scores_gemma":[0.0023358925,0.00041984295,0.00046351354,0.0004380193,0.0018233218,0.0008982089,0.0012817095,0.0010968049,0.0001910615],"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.000072354655,0.00005388933,0.00021127965,0.000051686315,0.000020279893,0.00006567992,0.00004665971,0.96087015,0.0017783286,0.03242014,0.00050063134,0.003908879],"study_design_scores_gemma":[0.000017301858,0.000033538607,0.00005780501,0.0000032160801,0.0000050194876,0.0000028443912,0.000007358311,0.99506,0.00011315016,0.004517723,0.00017713029,0.000004794752],"about_ca_topic_score_codex":0.020062314,"about_ca_topic_score_gemma":0.0062285014,"teacher_disagreement_score":0.020062314,"about_ca_system_score_codex":0.0027712001,"about_ca_system_score_gemma":0.0021914335,"threshold_uncertainty_score":0.039891124},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09996305,0.0011605493,0.87765735,0.00228113,0.00014145492,0.00021163613,0.00038065563,0.0002603474,0.017943742],"genre_scores_gemma":[0.94728225,0.00096327375,0.04308357,0.00028672273,0.00017618579,0.00013675612,0.00019572978,0.0001135943,0.0077618654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692553,0.0013364791,0.00011835711,0.00033431896,0.00056215306,0.0007231462],"domain_scores_gemma":[0.99220276,0.0055303765,0.000577296,0.00020304926,0.0011146939,0.0003717796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052651335,0.0010115944,0.0017068798,0.0013964063,0.0010392601,0.0022097626,0.0017254385,0.0012587095,0.0041882116],"category_scores_gemma":[0.009650144,0.00082444446,0.00086469104,0.00088345614,0.001965692,0.0026275245,0.0016641635,0.0021561075,0.00048573007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014889616,0.00008997911,0.00087709026,0.00011301203,0.000035033805,0.00010911921,0.00013907744,0.78033996,0.0019223442,0.20973343,0.002052828,0.0044391775],"study_design_scores_gemma":[0.000015004499,0.000028151122,0.00019099106,0.000006814365,0.000010811912,0.000013340467,0.000023314855,0.98002636,0.0001513764,0.01921237,0.0003110711,0.000010341198],"about_ca_topic_score_codex":0.0123655675,"about_ca_topic_score_gemma":0.004993447,"teacher_disagreement_score":0.0123655675,"about_ca_system_score_codex":0.005616861,"about_ca_system_score_gemma":0.004608914,"threshold_uncertainty_score":0.040753365},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4337182,0.0024026912,0.53835064,0.0034119617,0.00041841742,0.00040330226,0.001024295,0.000634975,0.019635454],"genre_scores_gemma":[0.98191905,0.0002695917,0.014885841,0.00007401585,0.0000425995,0.00005694748,0.00013478086,0.00004852162,0.0025687662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989629,0.00032509747,0.00003286836,0.00015569336,0.00013436077,0.00038916938],"domain_scores_gemma":[0.9968098,0.002256203,0.0002606651,0.00006223305,0.0002852441,0.00032583758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017720162,0.0010062783,0.0017484066,0.00094000297,0.00083457795,0.0023913588,0.0014898408,0.0015633457,0.0039952314],"category_scores_gemma":[0.005043016,0.0015945315,0.0008112059,0.0015145347,0.001121012,0.001601459,0.0010308542,0.0015138541,0.0002536335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050457493,0.000016324866,0.000114916926,0.000018490982,0.00001148554,0.00002671961,0.000011984854,0.99592894,0.00019665866,0.001857903,0.00037220676,0.0013939397],"study_design_scores_gemma":[0.0000047121716,0.000007688915,0.00006392375,0.0000021468873,0.0000032033615,0.0000028225602,0.000012291948,0.9988984,0.000047212652,0.0009136792,0.000040950737,0.0000029193375],"about_ca_topic_score_codex":0.045688342,"about_ca_topic_score_gemma":0.030397253,"teacher_disagreement_score":0.045688342,"about_ca_system_score_codex":0.0038579265,"about_ca_system_score_gemma":0.0039878855,"threshold_uncertainty_score":0.09084481},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057761054,0.0021702647,0.838687,0.0010524904,0.0003368425,0.00025715877,0.002741293,0.0022626834,0.09473109],"genre_scores_gemma":[0.79566383,0.004345063,0.086708196,0.0005305763,0.00044155988,0.0006403775,0.0031577232,0.00096082,0.10755186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896634,0.00011025409,0.00007211578,0.00028559388,0.0004176001,0.0001480386],"domain_scores_gemma":[0.99628496,0.0016427526,0.0003605532,0.0004710784,0.001096243,0.00014443365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014789728,0.0005481251,0.00054690556,0.0017221385,0.00065579696,0.0025156813,0.0022644706,0.0012086412,0.018700225],"category_scores_gemma":[0.008049714,0.00045603956,0.00059352146,0.0021486497,0.00092164736,0.0030955488,0.0006613034,0.0011383271,0.0058894935],"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.00015500782,0.0000917427,0.0024196827,0.0003143781,0.000033892207,0.00031560913,0.0005240352,0.06496707,0.01340984,0.82511973,0.01207198,0.08057693],"study_design_scores_gemma":[0.00004981569,0.00017619778,0.0053828536,0.0001285844,0.000057344398,0.0015734432,0.00036433936,0.42606294,0.010609267,0.46506464,0.09040349,0.00012715727],"about_ca_topic_score_codex":0.0022220733,"about_ca_topic_score_gemma":0.0010631897,"teacher_disagreement_score":0.018700225,"about_ca_system_score_codex":0.0018354135,"about_ca_system_score_gemma":0.0012049088,"threshold_uncertainty_score":0.06255841},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12135258,0.00014758721,0.8714959,0.00089683617,0.00007446233,0.00009130166,0.00041799096,0.0004177598,0.0051056417],"genre_scores_gemma":[0.9151442,0.00033863803,0.08185056,0.00015095658,0.000057802463,0.00020466775,0.00036122472,0.00009069042,0.0018012223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979334,0.0010943593,0.00012373585,0.00029406283,0.00039526843,0.00015916691],"domain_scores_gemma":[0.98020387,0.014968089,0.0016278952,0.0016932307,0.0012938115,0.00021312038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045529725,0.0007061128,0.00044703984,0.0010012701,0.00038666508,0.0016730003,0.0014113609,0.00080371666,0.0019756218],"category_scores_gemma":[0.054892883,0.00050816085,0.0006769474,0.0012357997,0.0011265079,0.0030335202,0.0009357669,0.0017817366,0.00026206585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040187304,0.00012467096,0.006668753,0.00008044742,0.000037551177,0.00008884148,0.00050728145,0.6516789,0.001334458,0.32445985,0.0011902926,0.013788726],"study_design_scores_gemma":[0.000004220046,0.000012206775,0.00085329014,0.000009586893,0.000004995843,0.000009671764,0.000052864867,0.9371306,0.00032973685,0.06116913,0.00041464187,0.0000091157945],"about_ca_topic_score_codex":0.009388948,"about_ca_topic_score_gemma":0.005555444,"teacher_disagreement_score":0.009388948,"about_ca_system_score_codex":0.0031336364,"about_ca_system_score_gemma":0.0019307947,"threshold_uncertainty_score":0.024078727},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021324992,0.00071894366,0.9116526,0.002896959,0.00085070304,0.000116084964,0.008763096,0.014584255,0.03909226],"genre_scores_gemma":[0.36022142,0.00086154573,0.516323,0.0011000679,0.00027794266,0.0003012088,0.02704829,0.0054009976,0.088465564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942774,0.000091003596,0.00003051019,0.00012868934,0.00021401241,0.00010805348],"domain_scores_gemma":[0.9985216,0.00054373126,0.00006622824,0.00028937793,0.0004713208,0.00010777313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010104924,0.001065466,0.00048580233,0.0012536616,0.0005744586,0.0021962079,0.001655129,0.001361197,0.059709053],"category_scores_gemma":[0.008433493,0.00048605216,0.0009844421,0.0015167984,0.00051007024,0.0022842644,0.0013471363,0.0021996903,0.018973585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035165294,0.00025292512,0.0037268784,0.00042693186,0.000073787436,0.00014084709,0.000093322335,0.33689475,0.003040435,0.0736179,0.25932992,0.32205066],"study_design_scores_gemma":[0.000027730368,0.000013267355,0.00039066092,0.000028151377,0.0000072511534,0.000020356929,0.000022073058,0.95011735,0.0019787436,0.030803666,0.016581737,0.000008982905],"about_ca_topic_score_codex":0.024040144,"about_ca_topic_score_gemma":0.040757902,"teacher_disagreement_score":0.059709053,"about_ca_system_score_codex":0.002265556,"about_ca_system_score_gemma":0.0024456924,"threshold_uncertainty_score":0.19974667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9709445,0.000089329085,0.026599284,0.00044740556,0.000010629576,0.000033666707,0.0000646308,0.000028608965,0.0017819296],"genre_scores_gemma":[0.9977622,0.000038798295,0.00125056,0.0000408224,0.000008661017,0.000008300394,0.000034961464,0.0000066724742,0.00084898743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821883,0.0005707574,0.0000680574,0.0002863502,0.00017224347,0.00068374194],"domain_scores_gemma":[0.98797995,0.0075741285,0.002041115,0.0003165795,0.00055117306,0.001537107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035584862,0.00041575666,0.00091173075,0.0006612852,0.0009440181,0.0027637742,0.0013862982,0.0014421641,0.0034744479],"category_scores_gemma":[0.011995759,0.00056881085,0.00064040825,0.0005823028,0.0012147328,0.0022353875,0.0010660702,0.0015378189,0.00037956925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026828602,0.0016040569,0.15621775,0.00016887346,0.00033071294,0.0022157887,0.0027908257,0.62426376,0.015992114,0.16043837,0.002867609,0.030427208],"study_design_scores_gemma":[0.00009027993,0.00029260968,0.014954821,0.000013663523,0.000057147412,0.00015731667,0.0011073984,0.9607172,0.0012135832,0.020935107,0.00038857016,0.00007226915],"about_ca_topic_score_codex":0.00853963,"about_ca_topic_score_gemma":0.007387025,"teacher_disagreement_score":0.00853963,"about_ca_system_score_codex":0.0020654083,"about_ca_system_score_gemma":0.0012013247,"threshold_uncertainty_score":0.018819273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037773105,0.0003668931,0.00078834285,0.00036417475,0.00021932606,0.000090898626,0.0007254957,0.00089194364,0.99617505],"genre_scores_gemma":[0.0006050281,0.0001597193,0.00032162806,0.00017283481,0.000043879474,0.000046729507,0.0003400403,0.00013030926,0.9981797],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992793,0.00006070786,0.0000601324,0.000250163,0.00020822058,0.00014143769],"domain_scores_gemma":[0.9978356,0.00056784856,0.00015994282,0.00030353956,0.0004474765,0.0006855132],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011793497,0.0025880593,0.0016354931,0.0029008053,0.0024770657,0.0044599837,0.003286827,0.006631786,0.9895092],"category_scores_gemma":[0.0019867935,0.00094499445,0.0012243569,0.0030747545,0.0018903275,0.006427219,0.0030518016,0.0025070987,0.99265313],"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.00024108592,0.00019968233,0.0008367017,0.0005556638,0.00003085174,0.00023003262,0.00012859098,0.000496892,0.0016128,0.0083757145,0.3756165,0.6116755],"study_design_scores_gemma":[0.000034020097,0.00008410255,0.0005840943,0.00027320758,0.000011551729,0.00022989936,0.00011965325,0.00024407677,0.00031573535,0.00082538463,0.99725705,0.000021319871],"about_ca_topic_score_codex":0.0048702494,"about_ca_topic_score_gemma":0.0038476854,"teacher_disagreement_score":0.010490775,"about_ca_system_score_codex":0.0014802373,"about_ca_system_score_gemma":0.0014014676,"threshold_uncertainty_score":0.014963746},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016348302,0.00024673852,0.97963756,0.00039543692,0.000053538897,0.00002317506,0.00004117532,0.00016362555,0.0030904782],"genre_scores_gemma":[0.8400069,0.00040168033,0.15081915,0.0003810079,0.00009028335,0.00013658419,0.00017846211,0.00023260845,0.0077532744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994747,0.00020798143,0.000016938087,0.00007935032,0.00012491002,0.000096234646],"domain_scores_gemma":[0.99896884,0.00069720764,0.00006835743,0.0000649926,0.00012702079,0.00007353789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012374116,0.0006502499,0.0011097768,0.000379621,0.00061371224,0.0010871787,0.0013731682,0.0012546035,0.0026962417],"category_scores_gemma":[0.0028378156,0.0005702062,0.0006829938,0.0006114472,0.001424629,0.0013196114,0.0016757636,0.0018584561,0.00034301847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024420116,0.000017987215,0.00022110784,0.000020144475,0.000016839253,0.000030066834,0.000026340585,0.964971,0.00043842988,0.025996223,0.00074465724,0.0074928617],"study_design_scores_gemma":[0.0000012729021,0.0000021574488,0.000011400371,0.0000010874228,7.143841e-7,0.0000019427105,0.0000028113275,0.99549073,0.00004233886,0.0043652607,0.00007895748,0.0000013138657],"about_ca_topic_score_codex":0.008454269,"about_ca_topic_score_gemma":0.007979426,"teacher_disagreement_score":0.008454269,"about_ca_system_score_codex":0.001261482,"about_ca_system_score_gemma":0.0019442295,"threshold_uncertainty_score":0.01681012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040852646,0.00019880364,0.99247956,0.00014673013,0.00003246612,0.00003757196,0.0001458558,0.0020037184,0.0008700341],"genre_scores_gemma":[0.26565555,0.0005621031,0.7290439,0.00022249522,0.00015937498,0.00049129914,0.0010286956,0.00025669855,0.002579874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900585,0.00029110082,0.00008239522,0.00018659788,0.0003711558,0.00006291223],"domain_scores_gemma":[0.9940455,0.0045668017,0.00035624654,0.00032689556,0.0006178104,0.00008669068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016417244,0.0010817761,0.0009814126,0.0016796283,0.0005203112,0.00093914755,0.001415138,0.0011326596,0.003354547],"category_scores_gemma":[0.010937921,0.0003397927,0.0009137017,0.0011281854,0.0005638022,0.0012906215,0.00093311816,0.0023916797,0.0012820764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006274097,0.00015580698,0.0021125248,0.00019960178,0.00008853213,0.0001702243,0.00008198775,0.8198684,0.0022763892,0.038296662,0.004905916,0.13178127],"study_design_scores_gemma":[0.000002140873,0.000007102134,0.000081170634,0.000005727531,0.0000021089488,0.000013146383,0.0000032905157,0.9897058,0.00037465635,0.009221983,0.0005799978,0.000002860456],"about_ca_topic_score_codex":0.0020976628,"about_ca_topic_score_gemma":0.0013036446,"teacher_disagreement_score":0.003354547,"about_ca_system_score_codex":0.00087346626,"about_ca_system_score_gemma":0.0011702051,"threshold_uncertainty_score":0.0112220645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9586087,0.0002127342,0.006930558,0.0027354273,0.000021184875,0.00004006943,0.000076720644,0.00008820291,0.031286564],"genre_scores_gemma":[0.9969414,0.000037174894,0.0002904153,0.00007482255,0.000009833528,0.0000050695667,0.000007814934,0.000008469427,0.0026250363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989755,0.00025957823,0.000021007225,0.00012279546,0.0001535015,0.0004676594],"domain_scores_gemma":[0.989772,0.004923545,0.0017691761,0.0003591976,0.00093436247,0.0022416585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002197133,0.00019055717,0.00041025615,0.0009886487,0.0015298846,0.00430296,0.0010218711,0.0019151113,0.027758706],"category_scores_gemma":[0.010215585,0.00026744127,0.00026891142,0.0011620806,0.0016577463,0.0043736943,0.0010958768,0.0010806244,0.0011157034],"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.0025551459,0.0013954415,0.17815842,0.00026590985,0.00013176925,0.001305537,0.016420491,0.031101663,0.007839369,0.5375335,0.027138129,0.19615471],"study_design_scores_gemma":[0.000404748,0.0010984635,0.18696655,0.0002779676,0.00017834091,0.00049095484,0.0654195,0.23869939,0.0045251166,0.469398,0.03231261,0.0002283605],"about_ca_topic_score_codex":0.015430361,"about_ca_topic_score_gemma":0.017818354,"teacher_disagreement_score":0.027758706,"about_ca_system_score_codex":0.0031628564,"about_ca_system_score_gemma":0.002122136,"threshold_uncertainty_score":0.09286219},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057160314,0.0038676225,0.8977288,0.002328159,0.0002623556,0.00017506661,0.00024528647,0.00018868962,0.03804374],"genre_scores_gemma":[0.9437,0.0019193684,0.03320558,0.0002888553,0.00022230022,0.00030150998,0.00019440473,0.0000599066,0.020107953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867475,0.0004928637,0.00006157962,0.00022707465,0.00029801726,0.00024578793],"domain_scores_gemma":[0.997083,0.0021619604,0.00021877585,0.000041015137,0.00037611107,0.000119112105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024346795,0.0012222647,0.0010917974,0.0010037677,0.0006866434,0.0024479295,0.0011151758,0.0016653269,0.0035536808],"category_scores_gemma":[0.0065026702,0.00057211344,0.00058262923,0.0008940056,0.0022299276,0.0015059005,0.0013410373,0.0017422324,0.0002242446],"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.00006773793,0.00007586571,0.00028684372,0.00013060877,0.000029413031,0.000083898114,0.00015065598,0.766581,0.00059475575,0.21985692,0.0017395148,0.01040283],"study_design_scores_gemma":[0.00003593504,0.00002948205,0.00014840893,0.00001462806,0.000006687149,0.000010415919,0.000047122783,0.91207683,0.00014877014,0.08658054,0.0008893503,0.000011743388],"about_ca_topic_score_codex":0.018076843,"about_ca_topic_score_gemma":0.0063031875,"teacher_disagreement_score":0.018076843,"about_ca_system_score_codex":0.0035067562,"about_ca_system_score_gemma":0.0023678027,"threshold_uncertainty_score":0.03594321},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0321368,0.0014171728,0.3001515,0.10996472,0.007232039,0.0014540261,0.009996565,0.012172718,0.5254744],"genre_scores_gemma":[0.45282263,0.0014774194,0.11863695,0.010187662,0.0024745516,0.0007347638,0.0055208975,0.003397844,0.40474734],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965341,0.0011722129,0.000105243715,0.00047956634,0.0013539096,0.00035494054],"domain_scores_gemma":[0.9759774,0.006917442,0.0009701652,0.0065662633,0.006784533,0.00278408],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0082399435,0.0006245006,0.00063411216,0.0018028436,0.0021614032,0.0036905431,0.0018408631,0.0021403602,0.0686632],"category_scores_gemma":[0.02791699,0.00036255032,0.0005289982,0.0022552493,0.0012355243,0.004674185,0.0061129173,0.0017538237,0.02644543],"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.00036632805,0.00024880035,0.003534885,0.00015362125,0.00004374078,0.00015198348,0.0005739238,0.005279334,0.005630779,0.07731013,0.406691,0.50001544],"study_design_scores_gemma":[0.00012613944,0.00017281268,0.0054205093,0.00015796718,0.000038336788,0.00013692763,0.00129936,0.10257008,0.0107850395,0.13423854,0.7449656,0.00008862736],"about_ca_topic_score_codex":0.01584102,"about_ca_topic_score_gemma":0.020598533,"teacher_disagreement_score":0.9313368,"about_ca_system_score_codex":0.0022424827,"about_ca_system_score_gemma":0.0050866734,"threshold_uncertainty_score":0.22970134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4988611,0.0013683203,0.4820146,0.0017651464,0.0004560444,0.00025919682,0.0006065322,0.0007138515,0.013955157],"genre_scores_gemma":[0.9863435,0.0003607388,0.009550272,0.00008484633,0.00012333503,0.00006443759,0.00010576017,0.000013432413,0.0033536376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982279,0.0004193079,0.000085271786,0.00033374937,0.00031101954,0.00062263664],"domain_scores_gemma":[0.9978612,0.001041816,0.00038067688,0.00012591176,0.0003586376,0.00023174427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001713045,0.0007131151,0.0011876175,0.000684096,0.0012746565,0.0016989205,0.0016174644,0.0014319692,0.0017250018],"category_scores_gemma":[0.0029830206,0.0004736802,0.0008215968,0.0011256809,0.0013387059,0.0017730648,0.0011401703,0.0012875709,0.00022826757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003437034,0.00020480472,0.007191962,0.00014733408,0.000091407426,0.0016432041,0.0003899014,0.8807888,0.0042768912,0.09381329,0.0017267558,0.009381872],"study_design_scores_gemma":[0.000023254612,0.00006376179,0.0009666264,0.000005434114,0.000025682075,0.00013973766,0.00007264873,0.9877412,0.0003245415,0.010028298,0.0005850787,0.000023784633],"about_ca_topic_score_codex":0.023877809,"about_ca_topic_score_gemma":0.011447236,"teacher_disagreement_score":0.023877809,"about_ca_system_score_codex":0.0022834362,"about_ca_system_score_gemma":0.0026720057,"threshold_uncertainty_score":0.047477603},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24108256,0.0011024837,0.7402574,0.0010665455,0.00017913243,0.00017915465,0.00046900997,0.0008642025,0.01479953],"genre_scores_gemma":[0.97199583,0.00021950535,0.025326582,0.000047225134,0.00002382532,0.00010739595,0.00012428645,0.000013726467,0.0021416212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998342,0.000044383105,0.000012771331,0.00003253104,0.000044187353,0.000031958563],"domain_scores_gemma":[0.99962366,0.00025534118,0.00002763192,0.0000097672555,0.00007383023,0.000009699716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062354136,0.0005945114,0.00063227996,0.00028365693,0.0004725809,0.0006728548,0.000473235,0.0008389513,0.002568072],"category_scores_gemma":[0.0011472688,0.00018424848,0.00044817163,0.00026813368,0.000310059,0.00033752254,0.00036407827,0.0007225141,0.00015010954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060724728,0.000024478075,0.0005202243,0.00008175957,0.000016082886,0.00012419923,0.000051542596,0.9807839,0.0009839418,0.0021152708,0.0005008221,0.014737145],"study_design_scores_gemma":[0.0000016468441,0.000008692842,0.0000956744,0.0000027353399,0.000002186342,0.0000036538752,0.0000060876405,0.99940014,0.00012471799,0.0002798322,0.00007341595,0.0000013465811],"about_ca_topic_score_codex":0.023430295,"about_ca_topic_score_gemma":0.01355514,"teacher_disagreement_score":0.023430295,"about_ca_system_score_codex":0.00065804616,"about_ca_system_score_gemma":0.0006708762,"threshold_uncertainty_score":0.046587825},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048896573,0.0002602624,0.93947434,0.0004924265,0.00011270981,0.00018956211,0.00019762294,0.001167211,0.009209316],"genre_scores_gemma":[0.47128865,0.00023152003,0.52177334,0.00028981557,0.00012313496,0.000563607,0.00048421492,0.0004915075,0.0047542104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930596,0.00033629028,0.000031287746,0.00008758879,0.00012781633,0.00011103127],"domain_scores_gemma":[0.9915599,0.0070547666,0.0001752399,0.000341189,0.00066038355,0.00020844674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024051217,0.00078675454,0.0011067252,0.0010946675,0.001294468,0.0016062732,0.0025267606,0.0012105681,0.012787087],"category_scores_gemma":[0.010211484,0.00056843634,0.0008401389,0.0011816251,0.0010134175,0.0018558052,0.0015464688,0.0018994606,0.0012727167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032071673,0.00031402014,0.0013155455,0.00016886147,0.000048796424,0.00014302852,0.00016084488,0.8664181,0.0010618657,0.056855742,0.0038946834,0.06929779],"study_design_scores_gemma":[0.000019673585,0.000007876097,0.000065808665,0.000006344975,0.000004593053,0.0000072228754,0.00001593322,0.9945186,0.00014778101,0.005063011,0.00013883696,0.000004359037],"about_ca_topic_score_codex":0.019674676,"about_ca_topic_score_gemma":0.023237092,"teacher_disagreement_score":0.019674676,"about_ca_system_score_codex":0.001865766,"about_ca_system_score_gemma":0.0042711417,"threshold_uncertainty_score":0.042777},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1939715,0.00015709788,0.80377305,0.00028457807,0.00003295954,0.00002864891,0.00011969148,0.00060193345,0.0010304765],"genre_scores_gemma":[0.9102065,0.00012808306,0.08770027,0.000041603504,0.00005146625,0.00004758965,0.00028591475,0.000043583637,0.0014949756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996437,0.00008636503,0.000027390153,0.000112995105,0.000059358666,0.000070208785],"domain_scores_gemma":[0.9958734,0.0032890406,0.0002652779,0.00012500223,0.0003181498,0.0001291141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001314277,0.00048630452,0.0008836498,0.000939823,0.0006323077,0.0015312866,0.0012915467,0.0010631203,0.0016269882],"category_scores_gemma":[0.006564075,0.00076785305,0.0007102607,0.0006448311,0.00079068757,0.001797266,0.00066934986,0.0012803472,0.00027728418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009006998,0.00007714615,0.0025083038,0.00003558356,0.000037635236,0.00002951078,0.00003134511,0.96585864,0.0011841776,0.0070183952,0.0002935445,0.022835547],"study_design_scores_gemma":[0.0000010764734,0.0000036379417,0.0001012003,7.863056e-7,0.0000014941136,0.0000025567697,0.000002069029,0.9974886,0.00013055677,0.002252681,0.0000134987,0.0000017447081],"about_ca_topic_score_codex":0.008787308,"about_ca_topic_score_gemma":0.0070454506,"teacher_disagreement_score":0.008787308,"about_ca_system_score_codex":0.0012359145,"about_ca_system_score_gemma":0.0019777685,"threshold_uncertainty_score":0.017472327},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05153962,0.0019332509,0.9314344,0.0021912681,0.00032679472,0.00024440617,0.00031585532,0.00030791946,0.011706463],"genre_scores_gemma":[0.82725996,0.0022539932,0.15529835,0.0007520271,0.0004742919,0.00035011236,0.00026768632,0.00019056402,0.013153038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736196,0.001069073,0.00011519142,0.00052647246,0.00055388093,0.00037332805],"domain_scores_gemma":[0.9917755,0.006298645,0.0006297921,0.00025135637,0.0007319734,0.0003127023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054305093,0.0010900005,0.0012676108,0.0010455417,0.0009359652,0.0026419922,0.0034168132,0.0022779591,0.0045760423],"category_scores_gemma":[0.020279024,0.0009234934,0.0009903952,0.0015104472,0.0024435765,0.0036958365,0.0017001794,0.0022411593,0.0005299609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027484525,0.0002615643,0.0018943896,0.0005082129,0.00005410716,0.0004168138,0.0002768679,0.6506323,0.002485055,0.31069744,0.006995229,0.025503185],"study_design_scores_gemma":[0.000048665624,0.000049291386,0.00029400256,0.000035347843,0.000016455371,0.000096049764,0.000043653923,0.94479275,0.00044846797,0.052953213,0.001199341,0.000022798442],"about_ca_topic_score_codex":0.009107572,"about_ca_topic_score_gemma":0.0042666416,"teacher_disagreement_score":0.009107572,"about_ca_system_score_codex":0.004045508,"about_ca_system_score_gemma":0.00370473,"threshold_uncertainty_score":0.029352307},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20935564,0.0009187651,0.096120544,0.021364072,0.0006464224,0.0009307497,0.000562322,0.0021170545,0.6679845],"genre_scores_gemma":[0.88449717,0.0005798165,0.028927365,0.0026144448,0.00016782114,0.00016177156,0.0003188597,0.00024119047,0.08249165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99878794,0.00017941081,0.00003080747,0.000119420394,0.00033718057,0.0005451638],"domain_scores_gemma":[0.99846125,0.00037967323,0.000106348285,0.00021904129,0.00040910594,0.00042461252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019389949,0.00054153963,0.00031270285,0.0010125012,0.0034026238,0.003812766,0.0021059066,0.002547337,0.021519993],"category_scores_gemma":[0.0033993656,0.00036456835,0.00055261137,0.001105278,0.0018380142,0.004878525,0.002549868,0.00223249,0.0014274061],"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.00051120226,0.00080550206,0.012832503,0.000338788,0.000047811907,0.01324896,0.003222824,0.04475957,0.005390985,0.6134478,0.18066035,0.12473369],"study_design_scores_gemma":[0.0003129006,0.0006289333,0.007398503,0.00034479744,0.00007226741,0.0039015214,0.014431689,0.21137245,0.008702387,0.17454208,0.57812726,0.0001652201],"about_ca_topic_score_codex":0.038132574,"about_ca_topic_score_gemma":0.07690742,"teacher_disagreement_score":0.038132574,"about_ca_system_score_codex":0.005239078,"about_ca_system_score_gemma":0.0062805447,"threshold_uncertainty_score":0.07582122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9690141,0.00012298212,0.027386658,0.0007916396,0.000052598225,0.000037645146,0.000098764736,0.000089466615,0.0024061354],"genre_scores_gemma":[0.9978509,0.000036374917,0.0008526588,0.000042970223,0.000012976805,0.0000071231702,0.00003083607,0.0000072802654,0.0011590106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981464,0.00050790404,0.000063445186,0.0002855149,0.00023014829,0.0007666585],"domain_scores_gemma":[0.98683643,0.007882025,0.0014668556,0.00026401752,0.0014172297,0.0021334474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035121657,0.0005984266,0.0012962254,0.0010169598,0.0015659842,0.0030783843,0.0021279005,0.0019638846,0.003165571],"category_scores_gemma":[0.008855655,0.0009232418,0.00065638905,0.0013722125,0.001495471,0.002000319,0.0011157703,0.001477613,0.00032804185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023981489,0.0010332874,0.048434652,0.00012254078,0.00019864738,0.0024793905,0.0010207136,0.85107845,0.008328563,0.071590215,0.0042239893,0.009091303],"study_design_scores_gemma":[0.000029486917,0.00010432566,0.0018301512,0.00000426693,0.000022693057,0.000061462044,0.00020485239,0.9952302,0.00017689484,0.0022457412,0.000065686276,0.000024335304],"about_ca_topic_score_codex":0.02690811,"about_ca_topic_score_gemma":0.021545198,"teacher_disagreement_score":0.02690811,"about_ca_system_score_codex":0.0038577488,"about_ca_system_score_gemma":0.0035685943,"threshold_uncertainty_score":0.053502977},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2682812,0.0004419924,0.72763735,0.0016940731,0.00009954104,0.000108482986,0.00030341966,0.0003111941,0.0011227234],"genre_scores_gemma":[0.9688658,0.00018140228,0.029585166,0.00012020368,0.00010849342,0.00006240416,0.00017953955,0.000019207546,0.00087783556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851793,0.0004939308,0.000072643226,0.00046655646,0.00021117403,0.00023785519],"domain_scores_gemma":[0.9860605,0.010449177,0.0016214063,0.00066545774,0.000775858,0.00042760468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034336923,0.0010190104,0.0013571364,0.00048173187,0.00054717646,0.001478494,0.002624179,0.0016825525,0.0011777288],"category_scores_gemma":[0.01603527,0.0005644705,0.00076143356,0.00085155014,0.0015320114,0.0020884322,0.0013152362,0.0023663987,0.0001312659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016174822,0.00006885958,0.0063891904,0.00006588629,0.00003490213,0.00009740698,0.000095395684,0.9738545,0.0005864681,0.008177917,0.00054076785,0.009926969],"study_design_scores_gemma":[0.000005547479,0.000016846203,0.00032875722,0.000003928818,0.000004388459,0.0000083640225,0.000010929704,0.9968676,0.00013933844,0.0025743714,0.00003562361,0.0000043798673],"about_ca_topic_score_codex":0.016614402,"about_ca_topic_score_gemma":0.0057393876,"teacher_disagreement_score":0.016614402,"about_ca_system_score_codex":0.0013237081,"about_ca_system_score_gemma":0.0024391888,"threshold_uncertainty_score":0.033035398},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8419423,0.00049035525,0.12210192,0.0024037447,0.00010983373,0.00013871511,0.00033537686,0.00016253362,0.032315142],"genre_scores_gemma":[0.9960025,0.00005248553,0.0015094269,0.000063012136,0.00002614129,0.000021579332,0.00002350654,0.0000070182145,0.0022942715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816185,0.00064327504,0.000032019416,0.0002314273,0.00018407355,0.0007474292],"domain_scores_gemma":[0.993946,0.0033876894,0.00090177625,0.00021804577,0.000502174,0.0010443329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026544859,0.0007997764,0.0014608379,0.00081361196,0.0013380094,0.0029425288,0.0021010842,0.0021663185,0.010374945],"category_scores_gemma":[0.005601993,0.00054184656,0.0007868284,0.0009286109,0.00275498,0.003179171,0.0018690003,0.0017139667,0.00043551202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073420705,0.0003452974,0.0034336227,0.00013487099,0.000104692015,0.0010633941,0.0003069143,0.6548437,0.00273332,0.3248109,0.0039970255,0.007492058],"study_design_scores_gemma":[0.000101027785,0.0001447515,0.0011401451,0.000014431862,0.000020509815,0.00010759686,0.00031095164,0.94692844,0.00019406335,0.05007499,0.0009245874,0.000038513088],"about_ca_topic_score_codex":0.013043035,"about_ca_topic_score_gemma":0.008958451,"teacher_disagreement_score":0.013043035,"about_ca_system_score_codex":0.0036731882,"about_ca_system_score_gemma":0.0016295655,"threshold_uncertainty_score":0.034707606},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05648924,0.00006113502,0.9376636,0.00027801315,0.00006749087,0.00012835249,0.00023775236,0.001026627,0.0040477016],"genre_scores_gemma":[0.5144744,0.00008825601,0.4755072,0.00016701667,0.00008559918,0.0004043259,0.00074447243,0.00035825867,0.008170544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996884,0.00005463737,0.000018376868,0.00006353023,0.000097301,0.0000778454],"domain_scores_gemma":[0.9983741,0.0009817695,0.00007070018,0.0000906814,0.0003541481,0.0001285376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010932741,0.00043851102,0.00076417945,0.0008762877,0.001494197,0.0012309485,0.0021225996,0.0008224251,0.013906342],"category_scores_gemma":[0.0032924335,0.0004371896,0.00084809493,0.0007973231,0.00047033254,0.0009738712,0.0012011067,0.0010560121,0.0011048686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025548416,0.00021032659,0.0034596096,0.0001550916,0.00004904758,0.0003030413,0.00017293355,0.88934577,0.004692152,0.043403637,0.0034468682,0.05450597],"study_design_scores_gemma":[0.000013143276,0.000006889064,0.00011068524,0.0000023057962,0.0000036569334,0.000010918763,0.000013605244,0.99697006,0.00029733154,0.00242685,0.0001406107,0.000003919977],"about_ca_topic_score_codex":0.02562601,"about_ca_topic_score_gemma":0.019586839,"teacher_disagreement_score":0.02562601,"about_ca_system_score_codex":0.0016325644,"about_ca_system_score_gemma":0.004176552,"threshold_uncertainty_score":0.050953686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11970782,0.012450162,0.828312,0.004281905,0.0011123371,0.00006520227,0.00023182445,0.00041540235,0.03342328],"genre_scores_gemma":[0.9187652,0.007809134,0.043439895,0.00090888893,0.0026604764,0.00018162737,0.00024309735,0.00020344442,0.025788255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883944,0.00038872444,0.0000620926,0.0002231884,0.00035760563,0.0001290174],"domain_scores_gemma":[0.9896938,0.006189982,0.001406521,0.0006339366,0.001266219,0.0008095563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004321767,0.0014155956,0.0019119069,0.0033939404,0.0013313732,0.003965932,0.0024846818,0.0034157317,0.0036747954],"category_scores_gemma":[0.025105163,0.0011196971,0.00160102,0.0027102605,0.005852748,0.006990017,0.0034418667,0.004735414,0.00072405295],"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.000027873191,0.000053274518,0.0005834627,0.00009034911,0.00003292864,0.00020482013,0.00016892754,0.022409411,0.00093104405,0.9706534,0.0015093058,0.003335272],"study_design_scores_gemma":[0.000015548227,0.00002767693,0.0007590475,0.000043621556,0.000026872462,0.00018251903,0.00008857951,0.27556795,0.00021965685,0.72154754,0.0014766147,0.000044314325],"about_ca_topic_score_codex":0.0028462992,"about_ca_topic_score_gemma":0.0015242631,"teacher_disagreement_score":0.004321767,"about_ca_system_score_codex":0.0021096345,"about_ca_system_score_gemma":0.001339452,"threshold_uncertainty_score":0.022855997},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09870061,0.0010312092,0.89116126,0.00075694855,0.00011305918,0.00012630851,0.00021307032,0.000307544,0.007589993],"genre_scores_gemma":[0.9647381,0.0011670408,0.028435638,0.00017342194,0.00013224021,0.00015839914,0.00017899727,0.000102443344,0.0049137156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865806,0.00037798868,0.000038044243,0.00019178026,0.00034458278,0.00038953175],"domain_scores_gemma":[0.9956773,0.0025744885,0.00057423237,0.0001595401,0.0007682584,0.00024616797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027314876,0.0015702695,0.001260266,0.0016975114,0.0009385693,0.0018635233,0.0026132243,0.0012558086,0.0035169304],"category_scores_gemma":[0.009832167,0.00069078663,0.001378148,0.0014143835,0.0019235472,0.002180242,0.0013346112,0.0019047074,0.00034322703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056613822,0.00004999093,0.0006800031,0.00004788783,0.00003142439,0.00008723646,0.00011090697,0.95216995,0.0012115344,0.042287838,0.0004889112,0.0027777972],"study_design_scores_gemma":[0.000002730772,0.0000062218,0.000048499554,0.000002173307,0.0000040796986,0.0000041232047,0.0000073298766,0.9972632,0.00004275954,0.0025466792,0.0000685118,0.0000036788422],"about_ca_topic_score_codex":0.028218629,"about_ca_topic_score_gemma":0.00872319,"teacher_disagreement_score":0.028218629,"about_ca_system_score_codex":0.0038637049,"about_ca_system_score_gemma":0.0027733792,"threshold_uncertainty_score":0.056108773},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009713689,0.0009253291,0.96429336,0.0012329316,0.00061966386,0.000105898194,0.00039479538,0.00029227554,0.022422137],"genre_scores_gemma":[0.37272164,0.0028995972,0.54601043,0.0018571947,0.0010612077,0.00037855437,0.00063049834,0.0009828266,0.07345808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962175,0.00006734896,0.000023695093,0.000051481875,0.00018837594,0.000047254816],"domain_scores_gemma":[0.9992932,0.00033034667,0.000030242658,0.00005545833,0.00024688576,0.00004391301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014414116,0.0007616114,0.0008159256,0.0011459286,0.00075714866,0.0013254093,0.0018648019,0.0011202904,0.011954456],"category_scores_gemma":[0.0048760097,0.0005069664,0.0008780541,0.0011375059,0.00087040645,0.002129365,0.0010807444,0.0020708228,0.0035422966],"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.000025466488,0.000045137353,0.00028281988,0.00009097046,0.000016485958,0.00019367816,0.00015429739,0.034518305,0.004354367,0.9344147,0.007339299,0.018564533],"study_design_scores_gemma":[0.000034845394,0.000035217698,0.00047601855,0.000046870115,0.000022423743,0.00021261607,0.000036575693,0.54343545,0.0010659606,0.4396543,0.014933241,0.000046511133],"about_ca_topic_score_codex":0.008457943,"about_ca_topic_score_gemma":0.007334129,"teacher_disagreement_score":0.011954456,"about_ca_system_score_codex":0.0018224283,"about_ca_system_score_gemma":0.002736825,"threshold_uncertainty_score":0.039991617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31813696,0.00420027,0.6514909,0.0034776707,0.00049335154,0.0004614181,0.00079523074,0.0012352028,0.019709004],"genre_scores_gemma":[0.93961,0.0015175065,0.044190146,0.00043085212,0.00021920189,0.00023903743,0.00042384723,0.0004488974,0.012920468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858415,0.00039552693,0.000061337305,0.00022244317,0.00018552195,0.0005510927],"domain_scores_gemma":[0.9949582,0.0033208532,0.00043397018,0.00019053914,0.0004793329,0.0006170778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021534571,0.0020041687,0.002647417,0.0013727805,0.0016488855,0.0029557787,0.002274048,0.0021380088,0.009195309],"category_scores_gemma":[0.009692151,0.0011532414,0.00082243653,0.000990918,0.0027498533,0.0030352224,0.0027881279,0.0019303306,0.0011862387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004173836,0.000069311565,0.0005637038,0.00014596927,0.000028463317,0.00012928128,0.00009340188,0.9709594,0.0019262028,0.018296264,0.0024314988,0.004939122],"study_design_scores_gemma":[0.000026998583,0.000038328104,0.000124175,0.000010706571,0.0000071590307,0.000016469972,0.000041421896,0.9920426,0.00021933569,0.007203846,0.00025749026,0.000011474682],"about_ca_topic_score_codex":0.011961159,"about_ca_topic_score_gemma":0.0075700697,"teacher_disagreement_score":0.011961159,"about_ca_system_score_codex":0.003392784,"about_ca_system_score_gemma":0.0027100272,"threshold_uncertainty_score":0.030761361},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05393426,0.0020948134,0.91827524,0.0029701665,0.00025733406,0.00015407191,0.00028042647,0.000136166,0.021897413],"genre_scores_gemma":[0.9331319,0.002708825,0.048998963,0.00053756894,0.00049620273,0.00029755486,0.0001906259,0.00008265291,0.013555827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948382,0.002410297,0.000164674,0.0008611638,0.0010222687,0.0007033281],"domain_scores_gemma":[0.990935,0.00644395,0.00096680317,0.00036641644,0.0008653987,0.00042241678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043906765,0.0022773652,0.0020307996,0.0013230098,0.0014846567,0.0040588556,0.0025228758,0.0029950552,0.005309847],"category_scores_gemma":[0.01365979,0.0007975305,0.0013340622,0.0015595515,0.0034930892,0.0059422855,0.0027307537,0.0036740166,0.0006211258],"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.00004793068,0.00006878297,0.00070572936,0.00010513025,0.00003780443,0.00029162996,0.00020571495,0.21945268,0.0007645519,0.77174026,0.0013275661,0.0052522137],"study_design_scores_gemma":[0.000019233168,0.000040853138,0.0002055149,0.000027596338,0.000013311998,0.00006605588,0.00007910711,0.7040538,0.00012958486,0.29367247,0.0016644365,0.000028055872],"about_ca_topic_score_codex":0.0056470847,"about_ca_topic_score_gemma":0.0025372622,"teacher_disagreement_score":0.0056470847,"about_ca_system_score_codex":0.0047473083,"about_ca_system_score_gemma":0.0020319924,"threshold_uncertainty_score":0.034444273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043623157,0.00023954504,0.95342803,0.00039561206,0.00003988946,0.0000798937,0.00008548786,0.0005394983,0.0015689055],"genre_scores_gemma":[0.87247366,0.00026272825,0.12243461,0.0004117951,0.00008861706,0.00019555575,0.00021553188,0.00019632226,0.0037212505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984493,0.00066345424,0.00004946473,0.00029320817,0.00019581169,0.0003487327],"domain_scores_gemma":[0.9923287,0.0060364045,0.0005149697,0.0003018399,0.0004046753,0.0004134296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038770132,0.0014177549,0.0018167341,0.0006579847,0.0007256192,0.0014658922,0.0021964053,0.001832342,0.0025096484],"category_scores_gemma":[0.010621859,0.00093044946,0.0005961521,0.0011325328,0.001575281,0.002672405,0.001837857,0.002404647,0.00045432826],"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.00014519035,0.00008721783,0.00039014692,0.000043642965,0.000022050059,0.000022598808,0.000036961745,0.9719448,0.0004945625,0.009674411,0.00093946216,0.016198976],"study_design_scores_gemma":[0.000010082041,0.000013058322,0.000030280804,0.0000020871466,0.0000024395379,0.0000040088757,0.000004891816,0.9947812,0.00014547266,0.004938562,0.000065847016,0.0000020970388],"about_ca_topic_score_codex":0.0064494223,"about_ca_topic_score_gemma":0.0059915567,"teacher_disagreement_score":0.0064494223,"about_ca_system_score_codex":0.0025868374,"about_ca_system_score_gemma":0.0025902044,"threshold_uncertainty_score":0.020503879},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006186428,0.00032386862,0.98996454,0.00087205437,0.00004528537,0.00009724021,0.00024678765,0.00028548233,0.0019783292],"genre_scores_gemma":[0.5362021,0.0011959401,0.4573093,0.00047524346,0.00033794442,0.0009881445,0.0010077656,0.00024971986,0.0022337937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908954,0.0063234544,0.0003132381,0.0011777922,0.0010257643,0.00026429188],"domain_scores_gemma":[0.9135721,0.07713966,0.0036338724,0.0024627203,0.0025417218,0.0006498711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016222129,0.0015676863,0.0014369006,0.0025735302,0.00093995366,0.0029242896,0.0025880851,0.0020451604,0.0066575785],"category_scores_gemma":[0.09205633,0.0007383519,0.0014458576,0.0025477791,0.0025249226,0.0054852045,0.0028314255,0.0036045567,0.00048661177],"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.00007979885,0.00010184562,0.0029646878,0.00022793426,0.00007738479,0.00010428438,0.00029787928,0.6203923,0.00026505796,0.34494904,0.002672147,0.027867647],"study_design_scores_gemma":[0.000010801307,0.000021700313,0.00017861949,0.00002144226,0.000010449026,0.0000112658145,0.0000303275,0.8680201,0.00012376717,0.1306873,0.0008735516,0.000010626417],"about_ca_topic_score_codex":0.008278951,"about_ca_topic_score_gemma":0.004085574,"teacher_disagreement_score":0.016222129,"about_ca_system_score_codex":0.0037241192,"about_ca_system_score_gemma":0.0034743208,"threshold_uncertainty_score":0.085791886},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69337386,0.00045196616,0.30253187,0.000774492,0.00007472809,0.00011685454,0.000064632615,0.00022999705,0.002381648],"genre_scores_gemma":[0.9969796,0.0000581371,0.002444205,0.000030603685,0.000010541468,0.000013961022,0.000009066729,0.0000054507223,0.00044844844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984397,0.0005003289,0.000053963882,0.00023901781,0.00018816412,0.0005788803],"domain_scores_gemma":[0.9956868,0.0023823346,0.00073383347,0.00012073343,0.0004460082,0.00063009444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026807166,0.0009988201,0.0011069261,0.0006285003,0.0010108805,0.0011639987,0.0017157381,0.0013540714,0.0017808777],"category_scores_gemma":[0.0060170186,0.0005302229,0.0006814828,0.00038965195,0.0015824257,0.0016045284,0.0013008298,0.0013724093,0.00014770193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041985602,0.00016375605,0.003528398,0.00010173994,0.00007272225,0.00060547696,0.00038221944,0.9442993,0.007792709,0.03430763,0.00090617227,0.0074201673],"study_design_scores_gemma":[0.0000139849335,0.00006931953,0.00029326876,0.0000039057572,0.000017003626,0.000040348594,0.00010176279,0.99484575,0.00042150353,0.004080744,0.00009668312,0.000015637741],"about_ca_topic_score_codex":0.01090979,"about_ca_topic_score_gemma":0.0053433906,"teacher_disagreement_score":0.01090979,"about_ca_system_score_codex":0.0024975045,"about_ca_system_score_gemma":0.0020270727,"threshold_uncertainty_score":0.021692574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009506836,0.0008560633,0.9712573,0.001307738,0.00019672581,0.000095766205,0.00013158465,0.0001771077,0.016470876],"genre_scores_gemma":[0.61980325,0.0021932381,0.36140832,0.0015059279,0.00049225107,0.0005873612,0.00021670805,0.00042166814,0.013371322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991247,0.0002617348,0.000030166817,0.000093922004,0.0003806788,0.00010887156],"domain_scores_gemma":[0.99628735,0.0025718817,0.00015475953,0.00016982702,0.00072840415,0.00008775684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037226016,0.0011271805,0.0012889673,0.000883109,0.00053740415,0.001150341,0.00177461,0.0013575462,0.004599936],"category_scores_gemma":[0.013018162,0.00047263363,0.0010741492,0.0010448761,0.0015735592,0.002395575,0.0014126227,0.0022314475,0.00069290114],"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.000047441867,0.00009464166,0.00056887063,0.000247137,0.00003461437,0.00017150832,0.00020150901,0.35614163,0.0027228715,0.6004099,0.006923565,0.03243628],"study_design_scores_gemma":[0.00001745064,0.000031301584,0.00015922703,0.000043784887,0.000008935281,0.000030770956,0.000019178393,0.8730316,0.0005025758,0.12404706,0.002094766,0.000013254177],"about_ca_topic_score_codex":0.0042794417,"about_ca_topic_score_gemma":0.00263143,"teacher_disagreement_score":0.004599936,"about_ca_system_score_codex":0.0019825567,"about_ca_system_score_gemma":0.002901626,"threshold_uncertainty_score":0.019687295},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13150239,0.0015144792,0.8561156,0.0018293456,0.00021273737,0.00008789907,0.00023038223,0.00019760398,0.0083096335],"genre_scores_gemma":[0.9403775,0.0017162354,0.04423492,0.00034119881,0.00036084733,0.00012688382,0.000187859,0.000055468186,0.012599159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819034,0.0007707603,0.000096335985,0.0003458474,0.00033605009,0.00026067087],"domain_scores_gemma":[0.9976004,0.0014609044,0.00033757326,0.00011826149,0.00028854076,0.00019434532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026363402,0.0009525052,0.0014043669,0.0012243761,0.0010103784,0.0021179002,0.0018671838,0.0019140373,0.0023803352],"category_scores_gemma":[0.0050031054,0.00050147343,0.0010527346,0.0015310643,0.0027391464,0.0035688912,0.0014571672,0.0019789473,0.0003960678],"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.00009293623,0.000074087664,0.0010980855,0.00008321698,0.000036604804,0.0003349099,0.0002472499,0.37055215,0.002451248,0.62026256,0.000707842,0.0040591815],"study_design_scores_gemma":[0.000021136791,0.000030848467,0.00015245467,0.000009714448,0.000009930131,0.000034510875,0.000022667473,0.9285046,0.000120626755,0.07060551,0.00046718091,0.000020920586],"about_ca_topic_score_codex":0.00919002,"about_ca_topic_score_gemma":0.0036156233,"teacher_disagreement_score":0.00919002,"about_ca_system_score_codex":0.0023712295,"about_ca_system_score_gemma":0.0015900604,"threshold_uncertainty_score":0.018273056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7556316,0.0012026372,0.19955978,0.014596828,0.00031072763,0.00021841995,0.00043728488,0.00019784457,0.027844869],"genre_scores_gemma":[0.9934683,0.00028097586,0.0029157798,0.00023280634,0.00010021541,0.000037880513,0.000048440583,0.000036442296,0.0028791234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675983,0.0013796502,0.00011738293,0.0004678364,0.0003302305,0.0009451226],"domain_scores_gemma":[0.982941,0.012513059,0.001697831,0.00032178036,0.0007779763,0.0017483796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005924618,0.0008199957,0.002789697,0.0012608946,0.0019443895,0.005616437,0.0028856874,0.0043383553,0.0062789614],"category_scores_gemma":[0.021317026,0.0013429079,0.0011384956,0.001465588,0.0037641441,0.0067709475,0.0026238058,0.0030232265,0.0003432727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044908107,0.00034913467,0.008282764,0.00019628734,0.00026424837,0.00065910217,0.00077353284,0.6037339,0.001121208,0.3655215,0.007981483,0.010667751],"study_design_scores_gemma":[0.000048484704,0.000065658,0.0022748653,0.000022618295,0.0000496042,0.00007655196,0.0008568556,0.7404495,0.00019109237,0.2553603,0.0005476228,0.00005685924],"about_ca_topic_score_codex":0.010477082,"about_ca_topic_score_gemma":0.01035627,"teacher_disagreement_score":0.010477082,"about_ca_system_score_codex":0.004226668,"about_ca_system_score_gemma":0.0037327698,"threshold_uncertainty_score":0.03133273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6059793,0.0020681052,0.06449927,0.17068365,0.0013148409,0.000091751346,0.00039288445,0.00025214304,0.15471815],"genre_scores_gemma":[0.99455607,0.00021133204,0.0007922144,0.0010231851,0.00016751637,0.000016033739,0.00002110083,0.000028646513,0.0031838794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936102,0.0036581033,0.0001666628,0.0004176597,0.0008196454,0.0013277427],"domain_scores_gemma":[0.95916206,0.029427042,0.0038662904,0.0011853533,0.0025914307,0.0037677847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007205359,0.00034373734,0.0005062787,0.0006392874,0.0036160287,0.008232503,0.0013176453,0.0036199426,0.0167071],"category_scores_gemma":[0.053577684,0.00034569207,0.00039782983,0.0012434385,0.0047653974,0.009055619,0.004243289,0.0058846776,0.0009703064],"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.0010142548,0.00042784878,0.039610848,0.00028904618,0.00008073294,0.0013832777,0.024288343,0.009582422,0.0009367664,0.81568235,0.04587996,0.060824156],"study_design_scores_gemma":[0.00013570928,0.00019221852,0.015899768,0.00021141839,0.00007092606,0.00059230684,0.031169973,0.05894021,0.00081214396,0.86806756,0.023773449,0.0001343329],"about_ca_topic_score_codex":0.007860974,"about_ca_topic_score_gemma":0.0048948056,"teacher_disagreement_score":0.0167071,"about_ca_system_score_codex":0.0037590014,"about_ca_system_score_gemma":0.0026925004,"threshold_uncertainty_score":0.0558908},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5169113,0.0067495196,0.4130878,0.0030519513,0.0011559352,0.00007039216,0.0007085619,0.0018389515,0.056425568],"genre_scores_gemma":[0.9812213,0.00080382696,0.0057686814,0.00011515569,0.00020495037,0.000029281939,0.00025705114,0.00029749036,0.011302326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916303,0.00018189348,0.000029789393,0.00011964527,0.00033703353,0.0001685871],"domain_scores_gemma":[0.9957937,0.0030264312,0.00020404627,0.00021977843,0.00056211354,0.00019393639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001671576,0.00048136266,0.0004597172,0.0009106485,0.00036226565,0.0011882223,0.0010008457,0.0006943277,0.005071402],"category_scores_gemma":[0.010015306,0.00037117465,0.0003058215,0.0010143559,0.00072066666,0.0012041121,0.00046861434,0.0011852512,0.0008185558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013328631,0.00013875577,0.0025889603,0.00025381977,0.000059102673,0.00040073408,0.0007133621,0.5593147,0.025883796,0.3274743,0.010801747,0.07103788],"study_design_scores_gemma":[0.00001523371,0.000040485775,0.000885595,0.00001862938,0.0000127540625,0.00010838999,0.00007757055,0.9519111,0.0015241051,0.043594632,0.0017922153,0.000019318006],"about_ca_topic_score_codex":0.0037813112,"about_ca_topic_score_gemma":0.001397681,"teacher_disagreement_score":0.005071402,"about_ca_system_score_codex":0.0019815464,"about_ca_system_score_gemma":0.00090234564,"threshold_uncertainty_score":0.016965508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048718866,0.078954175,0.33056843,0.06724049,0.002300465,0.00003734278,0.0006610671,0.00050047773,0.47101867],"genre_scores_gemma":[0.7327425,0.08005542,0.093376435,0.0055729486,0.0051727975,0.00007935409,0.00055184553,0.00035508387,0.08209366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962103,0.00011223187,0.000018852053,0.00008361533,0.00013783366,0.000026345706],"domain_scores_gemma":[0.99857605,0.0007934247,0.00009754596,0.00022108952,0.0002521303,0.000059777656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009992932,0.0005233974,0.0003616216,0.0011931974,0.00049576274,0.0024426954,0.0011752163,0.0012027795,0.004558359],"category_scores_gemma":[0.0036117325,0.00044935013,0.0005389672,0.0016388748,0.0018461741,0.0054712123,0.00087979774,0.0023853453,0.00080895337],"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.000013627611,0.000032283406,0.0006091751,0.00008869284,0.000018821318,0.00006694587,0.00025350667,0.0247379,0.00023065016,0.9126094,0.011446303,0.04989269],"study_design_scores_gemma":[0.0000043590435,0.000021119313,0.00053623854,0.00014139495,0.000019897627,0.00018028879,0.000117914446,0.056137834,0.00047903095,0.835282,0.107060485,0.0000193307],"about_ca_topic_score_codex":0.0030456523,"about_ca_topic_score_gemma":0.0024327673,"teacher_disagreement_score":0.004558359,"about_ca_system_score_codex":0.0019499961,"about_ca_system_score_gemma":0.0006022841,"threshold_uncertainty_score":0.015249193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002672018,0.0054370104,0.00025943125,0.08680703,0.011648417,0.00027784487,0.0031863698,0.00026850123,0.88944334],"genre_scores_gemma":[0.005771855,0.00086696836,0.00014115182,0.1043789,0.0009757317,0.00032606453,0.00054818706,0.00011322501,0.8868779],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99843794,0.00013791416,0.00007823506,0.00025418212,0.00047289935,0.00061892543],"domain_scores_gemma":[0.9982559,0.00025341677,0.0000811796,0.00015076935,0.00081511046,0.00044359028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016868951,0.00075329177,0.00043333808,0.0007298785,0.0072712475,0.005741502,0.0020326665,0.015150629,0.10202601],"category_scores_gemma":[0.0048389803,0.0009690865,0.0006966441,0.00092227024,0.0015201379,0.0031394942,0.00272828,0.01087616,0.044658773],"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.000010939434,0.00001567405,0.00036431674,0.000030624684,0.0000021379383,0.000073709016,0.00013594606,0.000009081781,0.00005461867,0.008127495,0.98601985,0.0051556416],"study_design_scores_gemma":[0.0000075259536,0.000006897232,0.0021111167,0.0001249949,0.0000023221253,0.000023444984,0.000169741,0.000012543058,0.00003043271,0.0005424312,0.9969562,0.00001239675],"about_ca_topic_score_codex":0.25381362,"about_ca_topic_score_gemma":0.47152972,"teacher_disagreement_score":0.25381362,"about_ca_system_score_codex":0.0068017957,"about_ca_system_score_gemma":0.013078514,"threshold_uncertainty_score":0.5046725},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032920945,0.00056539994,0.9598907,0.00044639138,0.000074404845,0.00012789603,0.00017658995,0.00025181373,0.005545818],"genre_scores_gemma":[0.7230367,0.0018025752,0.26584095,0.00017152158,0.00012997442,0.00074292504,0.00035348642,0.00012873084,0.0077931797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995016,0.00022894552,0.000040134408,0.000060357346,0.00012837426,0.000040577266],"domain_scores_gemma":[0.9980901,0.0012968268,0.00018867369,0.00017707965,0.00019420481,0.000053143147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008786199,0.0004603074,0.0006144582,0.000607303,0.00040488422,0.0010559115,0.0014785511,0.0017824263,0.0019333703],"category_scores_gemma":[0.0038434272,0.0003244801,0.000794065,0.00065817346,0.0009464487,0.0011011945,0.0009348508,0.0011888592,0.000409248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012145914,0.000022102284,0.00047831924,0.000049914164,0.000011687811,0.00007218455,0.00009981248,0.92738813,0.001157505,0.06728402,0.00033634197,0.0030877665],"study_design_scores_gemma":[0.0000019395475,0.0000051129127,0.000042555974,0.000005085709,0.0000015943667,0.000008633305,0.000004974014,0.9929368,0.00013892844,0.0062613636,0.000589189,0.000003839348],"about_ca_topic_score_codex":0.0032648507,"about_ca_topic_score_gemma":0.001797781,"teacher_disagreement_score":0.0032648507,"about_ca_system_score_codex":0.0008917477,"about_ca_system_score_gemma":0.00062494626,"threshold_uncertainty_score":0.006491661},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9918942,0.0011290049,0.0036002288,0.000210131,0.0005397617,0.00023880982,0.0006330287,0.00017463237,0.0015801603],"genre_scores_gemma":[0.9772624,0.0040558535,0.0056865723,0.0003882673,0.0001909001,0.0010126114,0.0008727946,0.000050773146,0.010479925],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996166,0.000040966155,0.000033872213,0.000120403245,0.000059497615,0.00012862802],"domain_scores_gemma":[0.99958974,0.000046773654,0.00010625962,0.00006275641,0.000055026652,0.00013935285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005371486,0.00085326924,0.0010309039,0.00056889706,0.00029858292,0.00057034777,0.00038359407,0.00080658344,0.0025917252],"category_scores_gemma":[0.00033084906,0.00024617792,0.0006518448,0.00036143014,0.0008192975,0.00051572314,0.00029388233,0.0016709865,0.00031886355],"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.06588327,0.008534513,0.0015836459,0.0005992452,0.00016002808,0.00026048627,0.00017593271,0.0008319894,0.89198864,0.0008699365,0.00085848436,0.028253842],"study_design_scores_gemma":[0.0037895541,0.058674254,0.0065563982,0.0000817914,0.0006096725,0.00020368783,0.00026173395,0.0014858532,0.9226926,0.00046237602,0.005120873,0.00006110868],"about_ca_topic_score_codex":0.0015243378,"about_ca_topic_score_gemma":0.0019180668,"teacher_disagreement_score":0.0025917252,"about_ca_system_score_codex":0.00038995445,"about_ca_system_score_gemma":0.001210668,"threshold_uncertainty_score":0.008670211},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014695914,0.0069627734,0.0002982813,0.008970877,0.0099820625,0.00023371165,0.15662439,0.0010539499,0.8144043],"genre_scores_gemma":[0.0043632984,0.004714812,0.00030120785,0.0015300814,0.00059697544,0.0001403216,0.051194824,0.0004184486,0.9367399],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99594116,0.00016047902,0.00026567062,0.00042028565,0.0025337092,0.00067866646],"domain_scores_gemma":[0.96979886,0.00094413734,0.0006529715,0.001862175,0.023800172,0.002941626],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014783877,0.0011354338,0.0014641136,0.011193157,0.009741392,0.015367043,0.002510754,0.0021772657,0.38162404],"category_scores_gemma":[0.015198752,0.00066862965,0.0005188771,0.026265183,0.0014754139,0.0026698376,0.0020734447,0.002900669,0.29393288],"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.000017321692,0.0000057652887,0.00019499322,0.00008916668,0.0000022395132,0.000029004532,0.000027923164,0.000012476108,0.000039700753,0.0009198583,0.984945,0.013716439],"study_design_scores_gemma":[0.000004047536,0.0000023759887,0.0011463701,0.00012741546,0.0000023559187,0.00001834834,0.00007756343,0.000014624737,0.000046726775,0.00014657935,0.99840313,0.0000104079045],"about_ca_topic_score_codex":0.80143106,"about_ca_topic_score_gemma":0.85529035,"teacher_disagreement_score":0.38162404,"about_ca_system_score_codex":0.026886594,"about_ca_system_score_gemma":0.073673844,"threshold_uncertainty_score":0.88203824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"protocol","genre_consensus":"protocol","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065835833,0.00427764,0.00071137387,0.00023827438,0.00018020422,0.99167985,0.0018831555,0.00006852591,0.00030257838],"genre_scores_gemma":[0.00073428266,0.0023090679,0.001994556,0.00019488885,0.000028673467,0.9942082,0.00029846287,0.0000068484196,0.0002249277],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.9618935,0.013876556,0.013592563,0.003519092,0.0054388978,0.0016793254],"domain_scores_gemma":[0.95627666,0.01658631,0.010966959,0.002912121,0.011275764,0.0019821331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.07379993,0.0060188533,0.029487401,0.014666286,0.0045564556,0.008536739,0.0064394386,0.008743863,0.05534726],"category_scores_gemma":[0.098749526,0.006961112,0.021135204,0.013618012,0.0055113905,0.009691382,0.0057869563,0.0064156796,0.006262465],"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.004654868,0.0002524983,0.0006648874,0.964795,0.0036084994,0.0002621804,0.00083701644,0.00042752372,0.0004588307,0.0013264937,0.006063697,0.016648473],"study_design_scores_gemma":[0.054995015,0.0040954957,0.0075990637,0.79214245,0.049709473,0.00054068194,0.0022013641,0.0018120433,0.002393047,0.0043126023,0.07961611,0.000582599],"about_ca_topic_score_codex":0.0075583817,"about_ca_topic_score_gemma":0.016402472,"teacher_disagreement_score":0.07379993,"about_ca_system_score_codex":0.016097656,"about_ca_system_score_gemma":0.07004273,"threshold_uncertainty_score":0.39029598},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17845538,0.0009384698,0.8141148,0.0008726853,0.000118711505,0.0001026255,0.0002433884,0.00021349941,0.0049404786],"genre_scores_gemma":[0.9735752,0.0005570225,0.02045811,0.00010524697,0.000114861854,0.000076505734,0.00017723635,0.00005627391,0.004879537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994265,0.00014607687,0.000018674653,0.000073450305,0.00021610265,0.000119188306],"domain_scores_gemma":[0.9984573,0.00078832934,0.00018627537,0.00007303573,0.0003813519,0.000113705726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016606482,0.0006537956,0.0008774432,0.0008941678,0.0006432686,0.0011470595,0.0011394346,0.00073734287,0.0020607754],"category_scores_gemma":[0.0039887736,0.00033227468,0.001048229,0.0005837451,0.0008335031,0.0016338652,0.00074617687,0.0009937993,0.00022451738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020086314,0.00009576473,0.0020773422,0.00018126461,0.00008803703,0.00032416446,0.00019146709,0.8299011,0.010148429,0.14648525,0.0013507137,0.008955548],"study_design_scores_gemma":[0.0000032674375,0.000011097655,0.00022891787,0.000002000713,0.0000054278853,0.000016989867,0.000010356224,0.993566,0.00028878162,0.005751667,0.00010985024,0.000005734346],"about_ca_topic_score_codex":0.0081612645,"about_ca_topic_score_gemma":0.002915305,"teacher_disagreement_score":0.0081612645,"about_ca_system_score_codex":0.0018487806,"about_ca_system_score_gemma":0.0024885766,"threshold_uncertainty_score":0.016227543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016064066,0.031661995,0.00044344942,0.0819235,0.053912852,0.00009016046,0.00465915,0.00057340227,0.8251291],"genre_scores_gemma":[0.0043203994,0.011089889,0.00027255094,0.01331659,0.008288666,0.000043654294,0.0014381841,0.00024674123,0.96098334],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979699,0.00014848704,0.0000633402,0.00024443117,0.0012968703,0.00027703648],"domain_scores_gemma":[0.9946274,0.00091346103,0.00029510303,0.00051760144,0.0021739611,0.0014724436],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015710404,0.0009998322,0.00054812414,0.003013933,0.0048785233,0.011319019,0.001097468,0.0027566038,0.21503578],"category_scores_gemma":[0.009227488,0.00043436023,0.00046023217,0.0038223315,0.0014538959,0.0035767932,0.0022156115,0.0048563317,0.08187976],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000011724224,0.000008433696,0.00007505683,0.00003696507,0.0000013365518,0.000040051455,0.00003210849,0.000010813857,0.000040313993,0.0029292384,0.9829952,0.013818769],"study_design_scores_gemma":[0.00000137599,0.000001920231,0.00028506693,0.000068115405,9.109026e-7,0.0000132791065,0.000029822819,0.000009619494,0.000032474374,0.00021446151,0.99934024,0.0000026853031],"about_ca_topic_score_codex":0.062233493,"about_ca_topic_score_gemma":0.13886063,"teacher_disagreement_score":0.9377665,"about_ca_system_score_codex":0.0066910633,"about_ca_system_score_gemma":0.008125411,"threshold_uncertainty_score":0.7193663},"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":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55898696,0.026976712,0.0032252714,0.007500608,0.0013687462,0.00028019346,0.07452509,0.000248488,0.32688802],"genre_scores_gemma":[0.6818397,0.013321887,0.0026209345,0.00082735694,0.00025226828,0.00016778507,0.055999093,0.00016773227,0.24480323],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910563,0.00012259684,0.000054742963,0.00018259491,0.00033897272,0.00019537446],"domain_scores_gemma":[0.9991597,0.00018017815,0.00016712614,0.000061658364,0.00036051407,0.00007080306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008410737,0.00033003945,0.00019114478,0.0028667198,0.0028687392,0.0018996295,0.00069842936,0.00073779054,0.01470501],"category_scores_gemma":[0.0016679157,0.00025778144,0.00022065073,0.002468253,0.00073708117,0.0009808602,0.0014382154,0.00091958215,0.0019536642],"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.0008958746,0.00014344312,0.33240294,0.0015668558,0.00019076071,0.0076803477,0.09030154,0.0015621447,0.0070765163,0.032793414,0.27259526,0.2527908],"study_design_scores_gemma":[0.0000061057754,0.00004064561,0.31310713,0.0003580728,0.00004761061,0.0004364092,0.025130123,0.00014376597,0.001811471,0.000805365,0.6580732,0.00004007889],"about_ca_topic_score_codex":0.4721964,"about_ca_topic_score_gemma":0.67681694,"teacher_disagreement_score":0.5278036,"about_ca_system_score_codex":0.005683104,"about_ca_system_score_gemma":0.002865049,"threshold_uncertainty_score":0.9388958},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3713558,0.01429515,0.002463351,0.33462602,0.0024786673,0.00014449799,0.011428784,0.0003333543,0.26287436],"genre_scores_gemma":[0.8617504,0.014982275,0.0021783826,0.014600429,0.00037844834,0.0000567552,0.0024366023,0.000108478765,0.10350815],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9989011,0.000059595128,0.000023862105,0.000079959114,0.00035515038,0.00058039575],"domain_scores_gemma":[0.9976707,0.00010740242,0.00024061787,0.00006066715,0.0010692786,0.0008513146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007414232,0.00028108567,0.0002838057,0.0009221573,0.009230417,0.0042947694,0.00085407053,0.0010047964,0.015379357],"category_scores_gemma":[0.002868361,0.00021900248,0.000368835,0.0024941768,0.0022417286,0.001890726,0.0014228027,0.0009433316,0.0014645053],"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.00032610286,0.000052136613,0.28830585,0.0007160145,0.00011590479,0.0016860373,0.01748286,0.0010638533,0.0014346938,0.07095781,0.47222278,0.14563592],"study_design_scores_gemma":[0.000022826574,0.000047825502,0.2441801,0.00046709983,0.000076895536,0.00028098532,0.056361057,0.0010036412,0.00038529272,0.006289185,0.69074416,0.00014085749],"about_ca_topic_score_codex":0.9936399,"about_ca_topic_score_gemma":0.9977296,"teacher_disagreement_score":0.06290154,"about_ca_system_score_codex":0.06290154,"about_ca_system_score_gemma":0.11245141,"threshold_uncertainty_score":0.45638478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9867988,0.010529733,0.000115942654,0.00043448925,0.00012926987,0.0002010454,0.000816929,0.000016374823,0.0009574593],"genre_scores_gemma":[0.9930189,0.0035326192,0.00035232573,0.0005082067,0.00029300872,0.0002984036,0.0012336686,0.0000035911269,0.0007592512],"study_design_codex":"randomized_trial","study_design_gemma":"nonrandomized_trial","domain_scores_codex":[0.9996722,0.00018312373,0.000037386875,0.000036623067,0.000030892697,0.000039769246],"domain_scores_gemma":[0.9994288,0.00018526762,0.00015724823,0.000036422953,0.000027783426,0.0001644873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011912839,0.0004361651,0.0013274817,0.0001767219,0.00029390643,0.00070414785,0.00031866177,0.0007709596,0.0021642332],"category_scores_gemma":[0.0014852519,0.00023088284,0.00096489093,0.00039019316,0.0001605045,0.0003166835,0.00027428384,0.0009747187,0.00017273538],"study_design_candidate":"nonrandomized_trial","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.6893868,0.0057513467,0.23218365,0.0017305438,0.007489369,0.00012810239,0.00013611729,0.0005371102,0.0021184776,0.00021397068,0.0030907393,0.057233825],"study_design_scores_gemma":[0.21604173,0.048237074,0.7142327,0.00039920968,0.0139585165,0.00023103338,0.00021736391,0.001853339,0.00065033196,0.0004945719,0.003642874,0.000041257917],"about_ca_topic_score_codex":0.0014109073,"about_ca_topic_score_gemma":0.0034556098,"teacher_disagreement_score":0.0021642332,"about_ca_system_score_codex":0.00017904861,"about_ca_system_score_gemma":0.00035520372,"threshold_uncertainty_score":0.0072401166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41608423,0.0039028185,0.0024249577,0.0005799232,0.00014997872,0.00025226345,0.008847379,0.00067441113,0.567084],"genre_scores_gemma":[0.92238337,0.0015784737,0.004228229,0.00069902145,0.00007376927,0.00012885527,0.0048364718,0.00011222464,0.06595956],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99985504,0.000011180444,0.000010777813,0.00007076792,0.000037021313,0.000015247353],"domain_scores_gemma":[0.99989676,0.00001582297,0.00002985978,0.000014916946,0.00002849857,0.0000140201255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102791615,0.00045490722,0.00042949355,0.0016341723,0.0016092361,0.00045249867,0.0004589538,0.00029480897,0.019784955],"category_scores_gemma":[0.00024642472,0.0002982205,0.00018802032,0.0005355919,0.00038439248,0.0009364077,0.0009963048,0.00046163006,0.008194953],"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.001990662,0.00040422936,0.07554012,0.0018492616,0.00015949743,0.005074707,0.004955138,0.0011049787,0.1326871,0.0062209466,0.06772937,0.702284],"study_design_scores_gemma":[0.00013387526,0.00045114962,0.5963044,0.00075945095,0.00025909813,0.014660893,0.003785186,0.0010669676,0.008190932,0.0025455225,0.37176576,0.00007682056],"about_ca_topic_score_codex":0.00998786,"about_ca_topic_score_gemma":0.040526837,"teacher_disagreement_score":0.019784955,"about_ca_system_score_codex":0.00044339892,"about_ca_system_score_gemma":0.0002029258,"threshold_uncertainty_score":0.06618726},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042598806,0.0032015515,0.0051376172,0.0007331787,0.00042160004,0.084449194,0.89682734,0.0008509675,0.0041187475],"genre_scores_gemma":[0.048804104,0.0023716714,0.042806786,0.002281271,0.00034011443,0.8152984,0.0733372,0.000749319,0.01401121],"study_design_codex":"systematic_review","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949479,0.0020583312,0.0014322001,0.00068946317,0.00056675903,0.00030535337],"domain_scores_gemma":[0.9152721,0.07193316,0.0067630117,0.002402413,0.002976229,0.00065305416],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.012996902,0.0023155967,0.0055878786,0.003930332,0.0012681664,0.002342817,0.0020151015,0.0023469755,0.71598077],"category_scores_gemma":[0.0955264,0.0021029287,0.008207912,0.0040477277,0.00090970885,0.0029002565,0.0016744368,0.0022017392,0.020971715],"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.045008183,0.0013169013,0.002627056,0.5995077,0.012378909,0.00016984128,0.0006685736,0.0019206181,0.0006203637,0.005990692,0.2747564,0.05503472],"study_design_scores_gemma":[0.5980901,0.0065657864,0.030344319,0.11379595,0.04096462,0.00052211556,0.00081547187,0.0063391807,0.0014014648,0.024751678,0.17580692,0.0006024479],"about_ca_topic_score_codex":0.0055065523,"about_ca_topic_score_gemma":0.012035435,"teacher_disagreement_score":0.71598077,"about_ca_system_score_codex":0.0029634347,"about_ca_system_score_gemma":0.004628387,"threshold_uncertainty_score":0.40511894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70813864,0.0004990211,0.21254334,0.00035204733,0.00012651797,0.0005718125,0.0097409645,0.036169633,0.031857993],"genre_scores_gemma":[0.9052557,0.00012509394,0.08390838,0.000080920305,0.000018787307,0.00008933175,0.00308211,0.00035997745,0.0070796236],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9991405,0.00005515609,0.000030193572,0.00016867481,0.00047544145,0.0001300912],"domain_scores_gemma":[0.9992488,0.00009858708,0.00005578027,0.00006633585,0.00048271523,0.00004780517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005205361,0.0007789781,0.00041760452,0.002194242,0.0008882483,0.00083646685,0.000788536,0.0003122923,0.0030414492],"category_scores_gemma":[0.0010980288,0.00022548813,0.00040942518,0.0013194706,0.00029870335,0.0003220574,0.0006135517,0.00033785313,0.001501968],"study_design_candidate":"observational","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.0008953862,0.0003082626,0.17391907,0.00037924794,0.0002234426,0.0008977452,0.0013796831,0.09786937,0.2563611,0.0024922567,0.019307883,0.4459665],"study_design_scores_gemma":[0.000075511045,0.00012065939,0.18256609,0.00005306905,0.000099733246,0.00022686964,0.0006559134,0.6738258,0.121501215,0.0008151865,0.019956985,0.000103030005],"about_ca_topic_score_codex":0.45839998,"about_ca_topic_score_gemma":0.5342008,"teacher_disagreement_score":0.5416,"about_ca_system_score_codex":0.0036433323,"about_ca_system_score_gemma":0.0042402623,"threshold_uncertainty_score":0.9114636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79530007,0.00063729566,0.17130463,0.010068602,0.00024376035,0.00015749552,0.00018655403,0.00024003568,0.0218616],"genre_scores_gemma":[0.9944365,0.00016054708,0.0032560911,0.00034880594,0.00005920679,0.00002256376,0.0000147785095,0.00001807147,0.001683417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99359834,0.0032309364,0.00031684776,0.00067694695,0.0007103828,0.0014665235],"domain_scores_gemma":[0.9234642,0.05122983,0.015332591,0.0027911556,0.0025479028,0.004634348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009998371,0.0007416716,0.0011606822,0.0007941331,0.0016232505,0.004781038,0.0022696801,0.002780806,0.006392133],"category_scores_gemma":[0.051367976,0.0007762978,0.0010280669,0.0005473846,0.003849956,0.004258589,0.0032080102,0.0042275507,0.00046305335],"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.0018322361,0.0010257916,0.043224156,0.00040195123,0.00032856385,0.0021848886,0.005022611,0.2517775,0.010626531,0.63462704,0.008297099,0.040651657],"study_design_scores_gemma":[0.00020023283,0.00044102146,0.007850131,0.00010529605,0.00012349251,0.00028478476,0.0017742512,0.7724739,0.0012030789,0.21380724,0.0015175382,0.00021907019],"about_ca_topic_score_codex":0.008541591,"about_ca_topic_score_gemma":0.0049237325,"teacher_disagreement_score":0.009998371,"about_ca_system_score_codex":0.0032630512,"about_ca_system_score_gemma":0.002759725,"threshold_uncertainty_score":0.05287707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6452623,0.002483585,0.113738514,0.004409808,0.0004470421,0.0001461952,0.00042688596,0.00041742384,0.2326683],"genre_scores_gemma":[0.9801762,0.0005140518,0.0050336453,0.00021344428,0.00006401081,0.000033611137,0.000063107735,0.000027828759,0.0138740335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981876,0.0005323455,0.00005280796,0.00021869804,0.00042021894,0.0005883471],"domain_scores_gemma":[0.9971554,0.0011829034,0.0006083243,0.00043906225,0.00036682244,0.00024741783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001026652,0.00030008086,0.00023262762,0.00045055908,0.0011906038,0.001772848,0.0012131273,0.00088927854,0.0157695],"category_scores_gemma":[0.005018797,0.00021869554,0.00028810554,0.0010143225,0.0016874542,0.0028879452,0.001645998,0.00078410463,0.0007799578],"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.00030681933,0.00031897257,0.013214719,0.00016477474,0.00003632204,0.0007342469,0.0010630457,0.09778857,0.0028438244,0.8005584,0.009627206,0.07334314],"study_design_scores_gemma":[0.0001620649,0.000891726,0.035724293,0.00023297853,0.00010945068,0.0011938282,0.008994144,0.45903903,0.004129395,0.3409072,0.1484109,0.00020498845],"about_ca_topic_score_codex":0.038200594,"about_ca_topic_score_gemma":0.035010744,"teacher_disagreement_score":0.038200594,"about_ca_system_score_codex":0.0038587695,"about_ca_system_score_gemma":0.0019764616,"threshold_uncertainty_score":0.075956464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9346527,0.00034593773,0.05341657,0.00047964,0.000059970203,0.00010837424,0.00010645438,0.00011405477,0.010716294],"genre_scores_gemma":[0.99396497,0.00014652377,0.003768871,0.000030532363,0.000018410907,0.000034722416,0.00003735503,0.000017162472,0.0019814752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989191,0.0005426648,0.000041836498,0.0001115408,0.0002183719,0.00016645386],"domain_scores_gemma":[0.9820877,0.012829577,0.0016041942,0.0010377141,0.0018299964,0.00061086094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026925553,0.00031481532,0.00033808142,0.0008008521,0.00055889715,0.0016148961,0.0007105488,0.00052652374,0.0027295894],"category_scores_gemma":[0.013300571,0.00021223152,0.00038580698,0.0007323425,0.0012004451,0.001683493,0.00051329803,0.0007299609,0.00023229778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014530482,0.0013128468,0.045667417,0.00028810883,0.00020122524,0.0005424705,0.0022914738,0.4837072,0.036944866,0.33893135,0.004566437,0.08409354],"study_design_scores_gemma":[0.00007149019,0.00054335495,0.014953745,0.000035581485,0.00005466929,0.00016824446,0.00075897144,0.92772037,0.0075900615,0.045484595,0.0025762746,0.00004265891],"about_ca_topic_score_codex":0.0023890724,"about_ca_topic_score_gemma":0.0012990717,"teacher_disagreement_score":0.0027295894,"about_ca_system_score_codex":0.0018406528,"about_ca_system_score_gemma":0.0008935827,"threshold_uncertainty_score":0.014239728},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38929895,0.000598911,0.6003983,0.0006221753,0.00008754607,0.00017106133,0.00010681035,0.00062658463,0.0080897305],"genre_scores_gemma":[0.94689095,0.00013403146,0.051894713,0.00004363907,0.000011708023,0.00008879721,0.00006006223,0.000034906727,0.0008412036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987576,0.0008357534,0.0000233805,0.00008735826,0.00014685193,0.00014909924],"domain_scores_gemma":[0.9950276,0.0039002197,0.00035865887,0.00017935397,0.0002843412,0.00024977562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024505975,0.0007650367,0.0009547099,0.0005966116,0.0006574315,0.0011351936,0.0010997803,0.0010614388,0.00172592],"category_scores_gemma":[0.0045432425,0.00052735396,0.00049502205,0.00065654836,0.0010644307,0.0009307496,0.0007939462,0.00089686667,0.00015692937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041857747,0.000019734278,0.00013209914,0.000005924864,0.000006727922,0.000004826261,0.000006693325,0.99731654,0.00012903327,0.0009963629,0.000046200774,0.0012939731],"study_design_scores_gemma":[0.000006829642,0.0000120859595,0.000033784763,0.0000010438345,0.0000012246228,0.00000113345,0.0000032629089,0.99937767,0.000099106794,0.00042009866,0.000042475767,0.0000013563666],"about_ca_topic_score_codex":0.010260352,"about_ca_topic_score_gemma":0.0066056834,"teacher_disagreement_score":0.010260352,"about_ca_system_score_codex":0.0024031217,"about_ca_system_score_gemma":0.0017797659,"threshold_uncertainty_score":0.02040124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024867365,0.024511613,0.0016630848,0.015199717,0.016959785,0.000046507113,0.00041517822,0.00020134394,0.938516],"genre_scores_gemma":[0.016930953,0.017299786,0.001744658,0.0040698764,0.0048179156,0.00005285466,0.00052861695,0.00020159474,0.95435375],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995639,0.00006507436,0.00002053366,0.00006375263,0.0002416469,0.00004511836],"domain_scores_gemma":[0.9994611,0.00014348082,0.000025647381,0.000042313783,0.00019490883,0.00013254122],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004139405,0.0004341719,0.00034607854,0.0014014503,0.0023034173,0.004770255,0.0003529364,0.0006307993,0.054358676],"category_scores_gemma":[0.0011800706,0.00019333443,0.0002642487,0.0021485945,0.0011463811,0.002211139,0.0014414116,0.0013557095,0.033885594],"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.000020327156,0.000038183927,0.00038987145,0.00018708217,0.0000040169866,0.000067830835,0.0014496864,0.000080784666,0.000374524,0.049217653,0.81553346,0.13263656],"study_design_scores_gemma":[7.107448e-7,0.000003637485,0.0002859321,0.00010265078,8.531207e-7,0.0000352233,0.000475212,0.000024076713,0.00006010457,0.0022052513,0.99680424,0.000002103186],"about_ca_topic_score_codex":0.0021983185,"about_ca_topic_score_gemma":0.006469301,"teacher_disagreement_score":0.94564134,"about_ca_system_score_codex":0.001574774,"about_ca_system_score_gemma":0.0012089014,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9992829,0.000009783621,0.00016173573,0.0000037306916,0.0000012744043,0.00040341783,0.000029908202,0.0000068470645,0.000100448524],"genre_scores_gemma":[0.9928173,0.000070542,0.0043500722,0.00001774907,0.000011693531,0.0021167912,0.0002587658,0.0000061313062,0.00035101577],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99883634,0.00040638738,0.000120140256,0.00015899158,0.00023642168,0.00024171802],"domain_scores_gemma":[0.9991041,0.00022957078,0.00018486437,0.00008281401,0.00017397664,0.00022460872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014927285,0.00058014784,0.0006050483,0.00066275994,0.00041675047,0.00029998962,0.0007296563,0.0003824494,0.0014181595],"category_scores_gemma":[0.0021010633,0.00032272527,0.0006277119,0.00034974856,0.00033546987,0.0004906522,0.00059884996,0.0004049118,0.0002400354],"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.039266143,0.25501597,0.28320503,0.0018003803,0.00038888698,0.0019739708,0.008376021,0.0024902667,0.12342985,0.00018795932,0.00048492895,0.28338054],"study_design_scores_gemma":[0.0026747466,0.39907974,0.58161175,0.000058384674,0.00014373106,0.0006950357,0.0017361911,0.0016877363,0.011314049,0.00003071233,0.00091229414,0.000055637567],"about_ca_topic_score_codex":0.0018157891,"about_ca_topic_score_gemma":0.005186068,"teacher_disagreement_score":0.0018157891,"about_ca_system_score_codex":0.00053551915,"about_ca_system_score_gemma":0.0012354848,"threshold_uncertainty_score":0.007894397},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068259905,0.07856145,0.014107987,0.33073038,0.025841877,0.000038419603,0.00030076696,0.00016492588,0.54342824],"genre_scores_gemma":[0.17628703,0.026938912,0.006364426,0.04228542,0.011791141,0.00014731057,0.0002057816,0.00055181177,0.73542815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961681,0.0016311449,0.000100097604,0.0006018066,0.0010812748,0.00041758042],"domain_scores_gemma":[0.99726105,0.0014509831,0.00018114361,0.00032230528,0.0006106182,0.00017386054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031800128,0.0007074488,0.00076869206,0.0016962594,0.0038818812,0.008681787,0.0012738094,0.005338699,0.034730565],"category_scores_gemma":[0.012623974,0.00039395416,0.0005245736,0.0018954445,0.0068689673,0.008255232,0.003129339,0.00629348,0.0059182993],"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.000017910377,0.000008402002,0.000101244565,0.000039459635,0.0000063548778,0.000048683505,0.0005791408,0.00012679622,0.000045106455,0.9310931,0.056848437,0.011085299],"study_design_scores_gemma":[0.0000102686,0.000008905464,0.00034013996,0.00017716012,0.000005898571,0.000104253384,0.00067550846,0.00053635094,0.00014703318,0.20038188,0.79759485,0.000017818957],"about_ca_topic_score_codex":0.020028228,"about_ca_topic_score_gemma":0.017969532,"teacher_disagreement_score":0.034730565,"about_ca_system_score_codex":0.006074671,"about_ca_system_score_gemma":0.004388616,"threshold_uncertainty_score":0.11618525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9853217,0.00098069,0.0071569113,0.0015651128,0.00006258082,0.00003398166,0.0005378996,0.0001000401,0.004241066],"genre_scores_gemma":[0.996732,0.00015628895,0.00044924425,0.00004864553,0.000016431739,0.000009493387,0.0001849126,0.000017185319,0.0023858922],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805534,0.00048189366,0.000064168285,0.0004944712,0.00029045352,0.00061380793],"domain_scores_gemma":[0.9932289,0.0035535016,0.0010197978,0.00038801608,0.0009552402,0.00085453666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002704274,0.00031528148,0.00083820143,0.0016210481,0.0011349963,0.003606162,0.0011541877,0.0012210296,0.014346178],"category_scores_gemma":[0.013000449,0.0004630108,0.00042905836,0.002614594,0.0016672807,0.0021805593,0.001477568,0.0015752211,0.0013049036],"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.0017841671,0.00044302293,0.71407884,0.00015099252,0.00038475415,0.0020308373,0.005019722,0.12325611,0.0032144333,0.058781788,0.024422351,0.06643294],"study_design_scores_gemma":[0.00009218294,0.00018092143,0.60599947,0.00010418376,0.00015180002,0.0009172995,0.00999725,0.3424839,0.0011920993,0.028616847,0.010134469,0.00012968562],"about_ca_topic_score_codex":0.1140032,"about_ca_topic_score_gemma":0.09049817,"teacher_disagreement_score":0.1140032,"about_ca_system_score_codex":0.006545767,"about_ca_system_score_gemma":0.0024167786,"threshold_uncertainty_score":0.2266792},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017896156,0.12719314,0.016762959,0.17042582,0.113124914,0.00042272548,0.0043813386,0.002558825,0.56334066],"genre_scores_gemma":[0.01135098,0.04986482,0.006442956,0.0062829885,0.0066660815,0.00020559857,0.0030232552,0.00073887315,0.9154245],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99607193,0.00048350677,0.00016582674,0.00042222533,0.001920127,0.0009363026],"domain_scores_gemma":[0.99064845,0.0005812615,0.00014631507,0.000493835,0.005965253,0.0021648149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072642523,0.0020667738,0.0017138704,0.0031278236,0.0070708925,0.012533607,0.0045527085,0.0060453583,0.26517537],"category_scores_gemma":[0.012567847,0.0008898384,0.00095508556,0.004200911,0.0027035472,0.0077562076,0.004647262,0.004441271,0.084502764],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000018962526,0.000019957413,0.00010309723,0.000077555436,0.0000024282983,0.000026698584,0.000077109326,0.00016717931,0.0000898013,0.008672798,0.94968665,0.04105773],"study_design_scores_gemma":[0.0000022474724,0.000004223461,0.00017505034,0.00012102474,0.0000019549573,0.000015121941,0.00012308027,0.00021989677,0.000035476543,0.0012020082,0.9980902,0.0000098564415],"about_ca_topic_score_codex":0.49503666,"about_ca_topic_score_gemma":0.53615606,"teacher_disagreement_score":0.9704013,"about_ca_system_score_codex":0.029598687,"about_ca_system_score_gemma":0.059361834,"threshold_uncertainty_score":0.98431045},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011664792,0.0022662294,0.9721919,0.0025472515,0.00030030234,0.000069431444,0.00021576832,0.0006877294,0.010056542],"genre_scores_gemma":[0.5097445,0.0043358225,0.47475183,0.0007403492,0.0010395366,0.00033034824,0.00051156216,0.00073853007,0.0078074844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97871643,0.005307909,0.0013517515,0.002455142,0.0111738695,0.0009948027],"domain_scores_gemma":[0.90534365,0.06630733,0.0025865433,0.015927963,0.00934677,0.00048774917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016675225,0.0013356113,0.0019147369,0.0019099523,0.0014612218,0.006353014,0.004093762,0.0027309319,0.0037462958],"category_scores_gemma":[0.12407377,0.0012559975,0.0017878118,0.0019279243,0.0035624667,0.0077107954,0.0042600427,0.005455401,0.002245077],"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.00031617086,0.000099507255,0.0027569232,0.00065582414,0.00012198222,0.0003939278,0.0006850055,0.29121685,0.0054880516,0.5752211,0.003946806,0.11909782],"study_design_scores_gemma":[0.00005994235,0.0001162669,0.0006864908,0.0002795697,0.00006590089,0.00043527494,0.00014330208,0.6424355,0.0074040922,0.3405642,0.007727299,0.00008220619],"about_ca_topic_score_codex":0.0058216737,"about_ca_topic_score_gemma":0.0024678058,"teacher_disagreement_score":0.016675225,"about_ca_system_score_codex":0.002235882,"about_ca_system_score_gemma":0.0036388487,"threshold_uncertainty_score":0.08818805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.887687,0.00017104803,0.10679918,0.0010014431,0.0000473219,0.00011198899,0.00009771728,0.00007517825,0.0040090284],"genre_scores_gemma":[0.9957973,0.00004435132,0.0033243974,0.000037492227,0.000010167655,0.000014752808,0.000016289368,0.000005536853,0.00074972224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611354,0.0019269037,0.00016428348,0.00041810426,0.0004934596,0.00088367605],"domain_scores_gemma":[0.97235084,0.020835847,0.0031272068,0.0008095735,0.0013298058,0.0015467419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074348305,0.0006535729,0.001457646,0.0007053837,0.0010477254,0.0031011177,0.001934099,0.0019113955,0.0026980168],"category_scores_gemma":[0.02337766,0.0006515181,0.0007487233,0.000751044,0.0017376579,0.0032701355,0.0013026051,0.0020630753,0.00023558104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013171904,0.0006852186,0.0071154325,0.000097523596,0.00009444778,0.0005106398,0.0005304385,0.8717418,0.0065924367,0.09851557,0.0010267685,0.011772576],"study_design_scores_gemma":[0.000039258768,0.00012410006,0.0006750856,0.0000040201935,0.000014096826,0.000026044285,0.00013871533,0.98848593,0.00042741394,0.009972385,0.00007174138,0.000021161843],"about_ca_topic_score_codex":0.006684899,"about_ca_topic_score_gemma":0.004416501,"teacher_disagreement_score":0.0074348305,"about_ca_system_score_codex":0.0027256787,"about_ca_system_score_gemma":0.0029802874,"threshold_uncertainty_score":0.039319634},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018402703,0.0011968467,0.10994385,0.004428948,0.0017411178,0.00017048453,0.0010654035,0.00039265948,0.8626581],"genre_scores_gemma":[0.50549066,0.0030503669,0.021991638,0.0011410591,0.001090226,0.0004870204,0.001632954,0.00031967097,0.4647964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996107,0.00008156514,0.000009436827,0.00008123645,0.00013040849,0.00008667333],"domain_scores_gemma":[0.99899584,0.00026499154,0.000055362158,0.00014931796,0.0003019437,0.00023262104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000563638,0.0005783623,0.00034646757,0.0014368616,0.0013121795,0.0020423264,0.0012173906,0.0013156859,0.07605432],"category_scores_gemma":[0.003991683,0.0002486311,0.00034629402,0.00078682497,0.00070922484,0.003598,0.0014333875,0.0013542784,0.008981939],"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.000022212385,0.000011368988,0.000086190696,0.00004401707,0.000004281016,0.000046353387,0.000032991415,0.0037900207,0.00049019227,0.970288,0.013400307,0.011784097],"study_design_scores_gemma":[0.000014252405,0.000016267802,0.00014814948,0.000037997277,0.0000070845185,0.00014936384,0.000101162215,0.023542332,0.0004663974,0.90684706,0.06865947,0.000010523626],"about_ca_topic_score_codex":0.0016084649,"about_ca_topic_score_gemma":0.0015535598,"teacher_disagreement_score":0.07605432,"about_ca_system_score_codex":0.0011270676,"about_ca_system_score_gemma":0.0009075324,"threshold_uncertainty_score":0.25442708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2454355,0.0014787433,0.72607297,0.0037095172,0.0004452363,0.00017686942,0.00040989544,0.0005684282,0.021702789],"genre_scores_gemma":[0.97712016,0.0003276813,0.016460722,0.00014869576,0.0002029219,0.00004286507,0.00006471575,0.00008329303,0.0055489046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978257,0.0008499589,0.00008479458,0.00028407434,0.00032817153,0.0006273088],"domain_scores_gemma":[0.98947865,0.00744305,0.0005833056,0.0005254637,0.0007582258,0.0012112926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004259173,0.00084374513,0.0028164112,0.0009670823,0.0007378918,0.0036000332,0.002953395,0.0025204492,0.0074612116],"category_scores_gemma":[0.019138366,0.0013052194,0.00069055264,0.001390407,0.0019442693,0.0043008984,0.0022954578,0.0025354128,0.00044645963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009494599,0.0002790723,0.0010334611,0.00018890326,0.00007073935,0.00013147389,0.00019630416,0.737139,0.0036194206,0.22800496,0.003653831,0.02473331],"study_design_scores_gemma":[0.00007143754,0.00007278319,0.00040083207,0.00001640976,0.000025165315,0.000030097144,0.000032678276,0.91193914,0.00027195807,0.08668565,0.0004289544,0.000024941963],"about_ca_topic_score_codex":0.0046199346,"about_ca_topic_score_gemma":0.0028486713,"teacher_disagreement_score":0.0074612116,"about_ca_system_score_codex":0.0032425325,"about_ca_system_score_gemma":0.0030134246,"threshold_uncertainty_score":0.02496028},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051148236,0.000561457,0.0041204155,0.020000704,0.97000355,0.000035096502,0.0018788759,0.0009821523,0.0019063184],"genre_scores_gemma":[0.107899375,0.0051475824,0.04051512,0.056253694,0.42780218,0.000557721,0.011352266,0.008807707,0.34166437],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99283665,0.0010621286,0.0013468423,0.0014942575,0.0026197939,0.0006402741],"domain_scores_gemma":[0.92015433,0.01615035,0.0027879935,0.007768052,0.050864663,0.0022745826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048396788,0.0025914786,0.0030652187,0.004235877,0.0036298248,0.004068671,0.0052470635,0.0059610773,0.09996665],"category_scores_gemma":[0.105620004,0.001667772,0.002513984,0.004305968,0.002748474,0.003658407,0.0025462795,0.008610853,0.04103928],"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.0001238958,0.000012728121,0.00017659765,0.00023289912,0.0000395612,0.0002688538,0.000053085907,0.0002924108,0.00011364418,0.0027418574,0.98834527,0.0075991275],"study_design_scores_gemma":[0.00027163426,0.00007631271,0.0030452497,0.00040177768,0.00013794364,0.001314621,0.00022668876,0.0048108213,0.0014201867,0.010625535,0.9775032,0.00016618517],"about_ca_topic_score_codex":0.017074103,"about_ca_topic_score_gemma":0.018459344,"teacher_disagreement_score":0.09996665,"about_ca_system_score_codex":0.0046482966,"about_ca_system_score_gemma":0.005179185,"threshold_uncertainty_score":0.33442175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093142636,0.00026029214,0.89218384,0.0020277635,0.000091523674,0.00037907227,0.0011196901,0.0010403895,0.00975482],"genre_scores_gemma":[0.9294288,0.00020202147,0.06375079,0.0002266695,0.000058594516,0.00027583927,0.0005961575,0.00011278405,0.005348265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99351245,0.0025261329,0.00037213354,0.0013386251,0.0011304731,0.0011202528],"domain_scores_gemma":[0.97746813,0.01300342,0.0028304143,0.0032121986,0.0019248495,0.0015609141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074773664,0.0015439609,0.002714375,0.0008791659,0.0012687788,0.00282417,0.003217446,0.0025953786,0.006869973],"category_scores_gemma":[0.025103718,0.0013808728,0.00082634785,0.0017930868,0.0021036363,0.004539612,0.0047556893,0.002588405,0.0011893145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072734,0.00013163991,0.0012078412,0.00015059276,0.0000618817,0.00026134893,0.00016060754,0.91374,0.003023283,0.055541787,0.0035888222,0.021404987],"study_design_scores_gemma":[0.00012633258,0.00006573366,0.00012816084,0.000016056227,0.000009745338,0.000036001868,0.000027406151,0.9540899,0.00077466184,0.043819677,0.0008931205,0.0000131405395],"about_ca_topic_score_codex":0.005326132,"about_ca_topic_score_gemma":0.0056222137,"teacher_disagreement_score":0.0074773664,"about_ca_system_score_codex":0.0022710748,"about_ca_system_score_gemma":0.006157583,"threshold_uncertainty_score":0.039544582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97434807,0.000063168816,0.007178525,0.00024839377,0.000027679967,0.000096576376,0.0007213239,0.00025657038,0.01705974],"genre_scores_gemma":[0.99323505,0.000051563,0.0023902275,0.000025534568,0.0000018006147,0.000028881139,0.00027575783,0.000014617836,0.0039765914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997762,0.000030482257,0.0000074817053,0.000030548083,0.00006915082,0.000086127904],"domain_scores_gemma":[0.99960953,0.00014123112,0.000024879348,0.000013735174,0.00013841639,0.00007216676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036641906,0.0005707967,0.000412346,0.00045467724,0.001373654,0.001016751,0.00089415594,0.00085224345,0.0037058408],"category_scores_gemma":[0.000819038,0.00027273622,0.0005157824,0.0005278136,0.00082579994,0.00029848304,0.0004877253,0.00068259984,0.00018508981],"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.0001289109,0.000061903935,0.0026109389,0.000019290635,0.000007287499,0.000097369804,0.00008409242,0.9913019,0.0013149319,0.0014239529,0.0006063296,0.0023430155],"study_design_scores_gemma":[0.000031737065,0.00004409458,0.0012110294,0.0000024858105,0.000005989852,0.0000049419555,0.0000859115,0.99754,0.0005155122,0.00012292132,0.0004258971,0.000009524198],"about_ca_topic_score_codex":0.83857375,"about_ca_topic_score_gemma":0.671103,"teacher_disagreement_score":0.16142625,"about_ca_system_score_codex":0.007935358,"about_ca_system_score_gemma":0.007827779,"threshold_uncertainty_score":0.32475382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7087813,0.00254387,0.25636747,0.0052881576,0.00040629783,0.00015754027,0.00023595933,0.0002470862,0.025972348],"genre_scores_gemma":[0.9946608,0.00027186453,0.004141521,0.00011362858,0.000049545775,0.000020325888,0.000021768554,0.000020063502,0.0007004204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800295,0.0009262727,0.00006563777,0.0002509299,0.00037735092,0.00037685572],"domain_scores_gemma":[0.96144646,0.03302173,0.00295945,0.0007525959,0.0009739366,0.0008457512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005977822,0.00066680525,0.0007229463,0.0007490102,0.0006558591,0.0025720214,0.0011090398,0.0018346746,0.00266059],"category_scores_gemma":[0.03487331,0.00038443352,0.0005989578,0.0005499447,0.0013816956,0.0023349137,0.0010911698,0.0024777928,0.00010915662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044374404,0.00032904127,0.0032087527,0.00015009039,0.00006133331,0.00016911462,0.00015835857,0.90561306,0.002817404,0.06364944,0.0015911656,0.02180846],"study_design_scores_gemma":[0.000025813755,0.00010292007,0.000984953,0.000019551511,0.00001585997,0.000036773974,0.00008009532,0.98543096,0.0005597674,0.012366037,0.00036050373,0.000016747088],"about_ca_topic_score_codex":0.0052490924,"about_ca_topic_score_gemma":0.0018611416,"teacher_disagreement_score":0.005977822,"about_ca_system_score_codex":0.0021304758,"about_ca_system_score_gemma":0.0016001482,"threshold_uncertainty_score":0.031614125},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13055018,0.03398446,0.29845968,0.020622943,0.0015555786,0.00009693693,0.00062790996,0.00043342193,0.5136689],"genre_scores_gemma":[0.8599631,0.009934367,0.013018048,0.0007596587,0.000571107,0.000051700204,0.00012671814,0.000077187506,0.115498126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997174,0.00005623661,0.000008693811,0.000053640477,0.00009287559,0.000071170194],"domain_scores_gemma":[0.9995535,0.00025784707,0.00004471643,0.000045469238,0.000059762435,0.00003862584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042778594,0.0004706848,0.0003009777,0.00048260472,0.00069952646,0.002793485,0.00079549226,0.0010282976,0.009665979],"category_scores_gemma":[0.0021373578,0.00030864746,0.00023896672,0.0014824527,0.0012784902,0.004052759,0.00078413676,0.001132213,0.00072137953],"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.00004424407,0.000037775375,0.00024555004,0.000028147415,0.000006250774,0.00004140876,0.00010326233,0.016009646,0.00051390164,0.9478887,0.0075776707,0.027503677],"study_design_scores_gemma":[0.000010163455,0.000026010555,0.00043699556,0.000027502741,0.0000113748365,0.00007984774,0.00016076722,0.043225545,0.00038387458,0.93426305,0.021360865,0.0000139278645],"about_ca_topic_score_codex":0.005576635,"about_ca_topic_score_gemma":0.004609981,"teacher_disagreement_score":0.009665979,"about_ca_system_score_codex":0.002003236,"about_ca_system_score_gemma":0.0008664865,"threshold_uncertainty_score":0.032335877},"labels":[],"label_agreement":null}]}