{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":62,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":62,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"e6fd5d97faf8","filters":{"venue":"Queueing Systems"}},"results":[{"id":"W2047840281","doi":"10.1007/s11134-013-9382-6","title":"Waiting time distributions in the accumulating priority queue","year":2013,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":93,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; University of Toronto; University of Auckland","keywords":"Priority queue; Computer science; Queue; Priority inheritance; Queueing theory; Multilevel queue; Bulk queue; Service (business); Class (philosophy); Operations research; Task (project management); Queue management system; Point (geometry); Priority ceiling protocol; Fork–join queue; Process (computing); Computer network; Real-time computing; Mathematical optimization; Quality of service; Mathematics; Business; Dynamic priority scheduling; Operating system; Engineering; Artificial intelligence","authors":[{"name":"David A. Stanford","is_ca":true},{"name":"Peter Taylor","is_ca":false},{"name":"Ilze Ziediņš","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06169002521522753,"gpt":0.4073437930204038,"spread":0.3456537678051763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003851521,0.0008686019,0.000871251,0.001395518,0.0007755118,0.001820002,0.00299227,0.0009501631,0.00297324],"category_scores_gemma":[0.01541626,0.0004449365,0.0008403507,0.0016235,0.001579194,0.003921564,0.001023122,0.002105897,0.0004434819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002349427,"about_ca_system_score_gemma":0.002047558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007527858,"about_ca_topic_score_gemma":0.002656678,"domain_scores_codex":[0.9981911,0.0003602171,0.0001244438,0.0002815042,0.0007252985,0.0003175213],"domain_scores_gemma":[0.9915697,0.004792517,0.001195842,0.0003187143,0.001683258,0.000440008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000111831,0.00007547963,0.00305742,0.0001341879,0.00002793074,0.0004503698,0.0005916831,0.2242002,0.004580021,0.7532576,0.001654387,0.01185868],"study_design_scores_gemma":[0.00002489072,0.0001132705,0.001126297,0.00002748281,0.00002411649,0.0001677268,0.0001329674,0.846624,0.001037668,0.148677,0.00199865,0.00004585523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1213051,0.001093876,0.8646734,0.0009299642,0.0001249595,0.0001025404,0.0002882197,0.0002456192,0.01123626],"genre_scores_gemma":[0.9097756,0.00195043,0.0754087,0.0002632274,0.0003549233,0.0001916237,0.0003426101,0.0001139245,0.01159894],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007527858,"threshold_uncertainty_score":0.02036899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1587039046","doi":"10.1023/a:1010947911863","title":"Discrete Time Geo/G/1 Queue with Multiple Adaptive Vacations","year":2001,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":91,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Mathematics; Business","authors":[{"name":"Zhe George Zhang","is_ca":true},{"name":"Naishuo Tian","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01074630155693247,"gpt":0.2103868682623396,"spread":0.1996405667054071,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030889,0.0007921786,0.00182848,0.001073824,0.001857655,0.003322319,0.003513147,0.002313814,0.003944777],"category_scores_gemma":[0.007529172,0.0007136212,0.0006301164,0.001813606,0.001934338,0.00206268,0.002036344,0.002017581,0.0006475143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003446158,"about_ca_system_score_gemma":0.002354634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01349948,"about_ca_topic_score_gemma":0.01495018,"domain_scores_codex":[0.9977685,0.0004420417,0.00007873427,0.0004862542,0.000343136,0.0008812613],"domain_scores_gemma":[0.9957581,0.001720173,0.0005484572,0.0005735768,0.0007287243,0.000671002],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002169334,0.000382941,0.009401761,0.0002078845,0.0001652723,0.001445126,0.0004341776,0.7711257,0.01149193,0.152464,0.01109757,0.03961437],"study_design_scores_gemma":[0.00007944716,0.00007825529,0.0007110604,0.000003870555,0.00003116954,0.00009441558,0.00004012394,0.9868934,0.0006972012,0.01085727,0.0004885166,0.00002514597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4557852,0.0009788113,0.5280692,0.00341219,0.0009642945,0.000250094,0.0009560519,0.001502017,0.008082197],"genre_scores_gemma":[0.9840748,0.00009950898,0.01205292,0.0002158498,0.0002066624,0.00003600747,0.0001157443,0.00002976934,0.003168635],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01349948,"threshold_uncertainty_score":0.02684176,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139290908","doi":"10.1007/s11134-007-9017-x","title":"Time dependent analysis of finite buffer fluid flows and risk models with a dividend barrier","year":2007,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":74,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Markov chain; Markov process; Fluid queue; Computer science; Set (abstract data type); Flow (mathematics); Matrix (chemical analysis); Applied mathematics; Dividend; Mathematical optimization; Process (computing); Mathematics; Queue; Statistics; Economics","authors":[{"name":"Soohan Ahn","is_ca":false},{"name":"Andrei L. Badescu","is_ca":true},{"name":"V. Ramaswami","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0478357894454256,"gpt":0.304538447677049,"spread":0.2567026582316234,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007397529,0.002587486,0.003437875,0.002949432,0.00128878,0.005841184,0.004259559,0.004923482,0.004375892],"category_scores_gemma":[0.02632124,0.002121853,0.001919721,0.001750126,0.005134613,0.006395947,0.002793962,0.004365359,0.0003000014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00626323,"about_ca_system_score_gemma":0.00470362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01789981,"about_ca_topic_score_gemma":0.005564458,"domain_scores_codex":[0.9973066,0.001262274,0.00008384813,0.0003887018,0.0004488553,0.0005098095],"domain_scores_gemma":[0.9819571,0.01372198,0.001709196,0.000365361,0.001181022,0.001065389],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008849284,0.0000787501,0.0005794424,0.00007539619,0.00006504371,0.0001721815,0.0001152852,0.7369589,0.0009429223,0.2581989,0.0008720905,0.001852569],"study_design_scores_gemma":[0.000009789976,0.00001121351,0.00008669141,0.000007991945,0.00001246394,0.00001559798,0.00001463684,0.9720895,0.00009372809,0.02748167,0.0001634346,0.00001336983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1327467,0.004812049,0.8432738,0.005607172,0.0005100381,0.0001207466,0.0003290335,0.0002661998,0.01233427],"genre_scores_gemma":[0.9418441,0.002887981,0.02522581,0.0004157441,0.0004775635,0.0001617962,0.0002781624,0.0001650659,0.02854382],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01789981,"threshold_uncertainty_score":0.04544312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1593591280","doi":"10.1023/a:1019139405059","title":"An analytical solution for a tandem queue with blocking","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenvalues and eigenvectors; Mathematics; Simple (philosophy); Line (geometry); Poisson distribution; Applied mathematics; Combinatorics; Statistics; Physics; Geometry","authors":[{"name":"Winfried K. Grassmann","is_ca":true},{"name":"Steve Drekic","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01689125562703021,"gpt":0.2540141036912759,"spread":0.2371228480642457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001666651,0.001193401,0.00149899,0.001263781,0.001448266,0.002480455,0.00270105,0.003406261,0.006893178],"category_scores_gemma":[0.005656925,0.001072677,0.001148664,0.001933369,0.001403903,0.002220494,0.00214192,0.002338925,0.001235765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003354261,"about_ca_system_score_gemma":0.005025056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01189773,"about_ca_topic_score_gemma":0.00792138,"domain_scores_codex":[0.9993356,0.00009347738,0.00002192838,0.0001073828,0.0002609416,0.0001807369],"domain_scores_gemma":[0.9988513,0.0005289725,0.00009557992,0.00004326459,0.0003229119,0.0001579584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007262158,0.0000927666,0.000456724,0.0001562094,0.00003555413,0.000299094,0.0002104008,0.7453011,0.003773557,0.2289028,0.005822245,0.01487694],"study_design_scores_gemma":[0.00001156488,0.00001160306,0.00004498349,0.00001151108,0.000009891028,0.00004724622,0.00002383134,0.9828599,0.0001733472,0.01596683,0.0008288598,0.00001046761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02076924,0.001220116,0.959433,0.001232866,0.0004671055,0.00009816354,0.0001476764,0.0003466344,0.01628516],"genre_scores_gemma":[0.6756743,0.002856876,0.2570833,0.0009489204,0.0009035739,0.0003619219,0.0003183112,0.0004553586,0.0613976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01189773,"threshold_uncertainty_score":0.02433699,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131297116","doi":"10.1007/s11134-010-9201-2","title":"Dynamic control of a single-server system with abandonments","year":2010,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Markov decision process; Computer science; Scheduling (production processes); Abandonment (legal); Mathematical optimization; Markov chain; Operations research; Uniformization (probability theory); Counterexample; Markov process; Mathematics; Markov model; Statistics; Variable-order Markov model","authors":[{"name":"Douglas G. Down","is_ca":true},{"name":"Ger Koole","is_ca":false},{"name":"Mark Edward Lewis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005396278547896633,"gpt":0.1908203917151976,"spread":0.185424113167301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002344036,0.001196376,0.001971364,0.0009137883,0.001205126,0.003654538,0.002734104,0.001651843,0.002013836],"category_scores_gemma":[0.006681556,0.0007048458,0.000661011,0.0009851543,0.002371141,0.001361141,0.001669262,0.001785469,0.0002606614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002587827,"about_ca_system_score_gemma":0.002026785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02062512,"about_ca_topic_score_gemma":0.007533738,"domain_scores_codex":[0.998562,0.0003073549,0.00007274641,0.0003466096,0.0002829038,0.0004283257],"domain_scores_gemma":[0.9961281,0.002105416,0.000510255,0.0001907777,0.0006011497,0.0004643135],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004877851,0.0001096092,0.0008479374,0.00006470345,0.00005043013,0.0003188547,0.0001499381,0.9665468,0.006686832,0.01802147,0.0005469299,0.006168813],"study_design_scores_gemma":[0.00001740598,0.00002821024,0.0001645629,0.000002202635,0.00001080079,0.00001282228,0.000008702513,0.9977592,0.0002476959,0.001670186,0.00006989983,0.000008234103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5536567,0.0009929205,0.4330953,0.001758419,0.0004934972,0.0001058475,0.0002078686,0.000865688,0.008823764],"genre_scores_gemma":[0.9959856,0.00009376121,0.001883483,0.00003351318,0.00003600511,0.00001495692,0.00001885958,0.00001607885,0.001917883],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02062512,"threshold_uncertainty_score":0.04101014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053028813","doi":"10.1023/b:ques.0000018028.16682.ef","title":"Vacation models in discrete time","year":2003,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Discrete time and continuous time; Computer science; Mathematics; Statistics","authors":[{"name":"Attahiru Sule Alfa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01263388078204098,"gpt":0.2199847940193971,"spread":0.2073509132373561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00483828,0.001725854,0.003184984,0.001999076,0.001951766,0.006963143,0.006599531,0.0049858,0.01331719],"category_scores_gemma":[0.015904,0.002162796,0.00170021,0.003425461,0.003697818,0.008364978,0.002603426,0.004241299,0.001736075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006625258,"about_ca_system_score_gemma":0.003306865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02812234,"about_ca_topic_score_gemma":0.01554893,"domain_scores_codex":[0.9970224,0.001253461,0.0001204728,0.0004303022,0.0004100783,0.000763223],"domain_scores_gemma":[0.9900284,0.006861929,0.0008707776,0.0003918779,0.000973067,0.0008738969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008768263,0.000095832,0.0007670967,0.00009798435,0.00004868786,0.0001502499,0.0002804058,0.3766287,0.0002849126,0.612918,0.00502029,0.003620199],"study_design_scores_gemma":[0.00002664631,0.00001723922,0.0001335206,0.00001537185,0.00002117488,0.00002692377,0.00007056294,0.8961123,0.00004269621,0.1021655,0.001348258,0.00001969504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1071682,0.005665718,0.8357952,0.007949425,0.001119322,0.0001983477,0.00157163,0.000660527,0.03987169],"genre_scores_gemma":[0.9180622,0.00318412,0.02121705,0.0007116914,0.0007626649,0.0002952747,0.0007712289,0.0002534113,0.05474229],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02812234,"threshold_uncertainty_score":0.05591726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072709938","doi":"10.1023/a:1026097723093","title":"Analysis of Queueing Systems with Synchronous Single Vacation for Some Servers","year":2003,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Western Washington University","keywords":"Server; Idle; Computer science; Computer network; Queueing theory; Queue; Real-time computing; Operating system","authors":[{"name":"Zhe G. Zhang","is_ca":false},{"name":"Naishuo Tian","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01369276134957893,"gpt":0.2204369974851817,"spread":0.2067442361356028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004002023,0.001141881,0.001594199,0.001380382,0.001326635,0.002627461,0.002526788,0.001238775,0.003665237],"category_scores_gemma":[0.01255611,0.0008727147,0.001087759,0.001167739,0.002120637,0.00296673,0.001467545,0.001585437,0.0003023363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003841379,"about_ca_system_score_gemma":0.003098015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009725398,"about_ca_topic_score_gemma":0.004551978,"domain_scores_codex":[0.9983272,0.0004932396,0.00007220083,0.0002353855,0.000399546,0.0004724581],"domain_scores_gemma":[0.9909297,0.006432215,0.000654871,0.0003278159,0.0009673559,0.0006880704],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001989803,0.0001122296,0.001875456,0.0001126626,0.00009317583,0.0003176276,0.000289889,0.7148907,0.004215152,0.2693954,0.001969413,0.0065293],"study_design_scores_gemma":[0.000008326078,0.00001546906,0.000252059,0.000003430403,0.00001365389,0.00002376416,0.00002531413,0.9810376,0.0001745645,0.01827455,0.0001634729,0.000007768371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.273968,0.001423956,0.7123613,0.001695429,0.0002038909,0.0001238487,0.0002849651,0.0003350449,0.009603477],"genre_scores_gemma":[0.9833223,0.000355523,0.01205044,0.00009312126,0.0001874822,0.00005481317,0.0001022891,0.00007015981,0.003764015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009725398,"threshold_uncertainty_score":0.02787131,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Attahiru Sule Alfa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01263388078204098,"gpt":0.2199847940193971,"spread":0.2073509132373561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00483828,0.001725854,0.003184984,0.001999076,0.001951766,0.006963143,0.006599531,0.0049858,0.01331719],"category_scores_gemma":[0.015904,0.002162796,0.00170021,0.003425461,0.003697818,0.008364978,0.002603426,0.004241299,0.001736075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006625258,"about_ca_system_score_gemma":0.003306865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02812234,"about_ca_topic_score_gemma":0.01554893,"domain_scores_codex":[0.9970224,0.001253461,0.0001204728,0.0004303022,0.0004100783,0.000763223],"domain_scores_gemma":[0.9900284,0.006861929,0.0008707776,0.0003918779,0.000973067,0.0008738969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008768263,0.000095832,0.0007670967,0.00009798435,0.00004868786,0.0001502499,0.0002804058,0.3766287,0.0002849126,0.612918,0.00502029,0.003620199],"study_design_scores_gemma":[0.00002664631,0.00001723922,0.0001335206,0.00001537185,0.00002117488,0.00002692377,0.00007056294,0.8961123,0.00004269621,0.1021655,0.001348258,0.00001969504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1071682,0.005665718,0.8357952,0.007949425,0.001119322,0.0001983477,0.00157163,0.000660527,0.03987169],"genre_scores_gemma":[0.9180622,0.00318412,0.02121705,0.0007116914,0.0007626649,0.0002952747,0.0007712289,0.0002534113,0.05474229],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02812234,"threshold_uncertainty_score":0.05591726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Quan‐Lin Li","is_ca":true},{"name":"Yiqiang Q. Zhao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008477706350612917,"gpt":0.211126057196433,"spread":0.2026483508458201,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001020927,0.0005939719,0.0009295723,0.001070352,0.002010162,0.003262722,0.001610613,0.002327518,0.00707323],"category_scores_gemma":[0.003772185,0.0004047401,0.0005690568,0.001102529,0.001185913,0.001653839,0.001774726,0.001631178,0.0008986224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002392903,"about_ca_system_score_gemma":0.002076993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0095529,"about_ca_topic_score_gemma":0.00517151,"domain_scores_codex":[0.9995067,0.00007964855,0.00001576193,0.00009529275,0.0001306212,0.0001719922],"domain_scores_gemma":[0.9984732,0.0004979332,0.00008994132,0.0001213661,0.0004139898,0.0004034748],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003244973,0.0007730086,0.008959918,0.0003762827,0.0001265672,0.006180811,0.00072524,0.2753798,0.04593277,0.5828349,0.03352343,0.04194224],"study_design_scores_gemma":[0.0001691779,0.0001919318,0.0009391985,0.00001647449,0.00004788983,0.0004532391,0.0001414872,0.9001509,0.005073673,0.09020687,0.002548774,0.00006048059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6139469,0.0006811087,0.3320079,0.007135021,0.001099937,0.0003004116,0.001260628,0.002267841,0.04130039],"genre_scores_gemma":[0.9630212,0.0001742627,0.0228858,0.0004444487,0.0002276331,0.00003447226,0.0001871676,0.00008600516,0.01293906],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0095529,"threshold_uncertainty_score":0.02366227,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hossein Abouee‐Mehrizi","is_ca":true},{"name":"Opher Baron","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02580645549049002,"gpt":0.2398458663900274,"spread":0.2140394108995374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002251387,0.001044262,0.001661482,0.001352136,0.001687541,0.00299837,0.003144016,0.002719649,0.003749376],"category_scores_gemma":[0.01135351,0.0007762845,0.0007497822,0.00196079,0.001859614,0.002804072,0.00191361,0.002667311,0.0008654362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003699854,"about_ca_system_score_gemma":0.002061201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007197024,"about_ca_topic_score_gemma":0.005697735,"domain_scores_codex":[0.9980472,0.0005366551,0.00006484983,0.000465084,0.0004440803,0.0004420876],"domain_scores_gemma":[0.9956414,0.001974463,0.0006043847,0.0006822114,0.0007944301,0.000303212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005268862,0.0002362787,0.00396182,0.0001680168,0.00008367989,0.0006761692,0.0004502418,0.3282354,0.007264085,0.6161097,0.01023229,0.03205558],"study_design_scores_gemma":[0.00002957277,0.00004234201,0.0006183247,0.000009031165,0.00002380553,0.00007443078,0.00002919202,0.9267268,0.0009151502,0.0705094,0.0009884551,0.00003343851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2344042,0.001140409,0.7413082,0.002632089,0.0005479641,0.0002359055,0.001025314,0.001262463,0.0174436],"genre_scores_gemma":[0.965952,0.0004807517,0.02419638,0.000294151,0.0002841474,0.00009639678,0.0002904104,0.00005945565,0.008346369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007197024,"threshold_uncertainty_score":0.02684444,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Qi‐Ming He","is_ca":true},{"name":"Hui Li","is_ca":true},{"name":"Yiqiang Q. Zhao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00887618401332673,"gpt":0.2034823379907821,"spread":0.1946061539774554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004375154,0.001101772,0.001482859,0.002551073,0.002424501,0.004230199,0.003240688,0.001310726,0.004807364],"category_scores_gemma":[0.01823455,0.0009999322,0.001140553,0.001434638,0.003700336,0.003788872,0.003491584,0.002670104,0.0009192707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00447785,"about_ca_system_score_gemma":0.004163479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01118854,"about_ca_topic_score_gemma":0.005725101,"domain_scores_codex":[0.9973581,0.0006462106,0.0001331196,0.00040714,0.0005958442,0.0008593635],"domain_scores_gemma":[0.986744,0.005724696,0.0019094,0.001211981,0.002250347,0.002159556],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005842278,0.0001591933,0.003684863,0.0001247929,0.00009326701,0.00069581,0.0005935982,0.1030557,0.008285706,0.8705257,0.004106471,0.008090608],"study_design_scores_gemma":[0.00004741982,0.000073822,0.001551243,0.00002914035,0.00004175126,0.0001994784,0.0001357103,0.8084352,0.001963851,0.1866605,0.0007793024,0.00008259389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6527015,0.001330841,0.3196095,0.002157132,0.0002636861,0.0001424147,0.0008974794,0.000854342,0.02204309],"genre_scores_gemma":[0.9871655,0.0003416942,0.005800882,0.0001506218,0.0001581239,0.00006421249,0.0002323701,0.00013047,0.00595606],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01118854,"threshold_uncertainty_score":0.03248918,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111170904","doi":"10.1007/s11134-009-9140-y","title":"Exact asymptotics for the stationary distribution of a Markov chain: a production model","year":2009,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Markov chain; Limit (mathematics); Rare events; Stationary distribution; Context (archaeology); Large deviations theory; Applied mathematics; Discrete phase-type distribution; Event (particle physics); Distribution (mathematics); Markov process; Statistical physics; Continuous-time Markov chain; Queueing theory; Variable-order Markov model; Mathematical analysis; Markov model; Physics; Statistics","authors":[{"name":"Ivo Adan","is_ca":false},{"name":"Robert D. Foley","is_ca":false},{"name":"David McDonald","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0433020382424933,"gpt":0.3135527758680189,"spread":0.2702507376255256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004036637,0.0009222492,0.001129651,0.001971472,0.0009034701,0.002165046,0.001694179,0.001495613,0.004726875],"category_scores_gemma":[0.02223815,0.0006514741,0.00126902,0.001112662,0.003091987,0.004545667,0.002330452,0.003060329,0.001077935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002591559,"about_ca_system_score_gemma":0.001669906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004257517,"about_ca_topic_score_gemma":0.002397393,"domain_scores_codex":[0.9983994,0.0005175319,0.00006825016,0.0002257779,0.0005673188,0.0002217501],"domain_scores_gemma":[0.9925592,0.004769875,0.0006965018,0.0007743549,0.0008928304,0.0003072332],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003587314,0.000053772,0.0007862319,0.00008634817,0.00002795698,0.000355603,0.00027715,0.2582852,0.002197258,0.72816,0.001216742,0.00851786],"study_design_scores_gemma":[0.00000877718,0.00001578566,0.0002334207,0.00003066875,0.000009463598,0.00008911572,0.00003643526,0.7349662,0.0004688195,0.2632917,0.0008286872,0.00002098326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03410356,0.0005450501,0.9564447,0.0004833281,0.00005550066,0.00003876965,0.00008605771,0.0002310761,0.008011967],"genre_scores_gemma":[0.8681598,0.001408159,0.120642,0.0002921351,0.0002944532,0.0002515896,0.0003032609,0.0003023977,0.008346152],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004726875,"threshold_uncertainty_score":0.021348,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Hui Li","is_ca":true},{"name":"Yiqiang Q. Zhao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04635275459403758,"gpt":0.282787678364388,"spread":0.2364349237703504,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004655793,0.001069412,0.00192992,0.002097239,0.0008741345,0.002147377,0.00358836,0.001967638,0.003578879],"category_scores_gemma":[0.0215042,0.0007882332,0.001527491,0.001623368,0.002736766,0.005955132,0.003203188,0.003644591,0.0006666035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002106772,"about_ca_system_score_gemma":0.00206836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006765216,"about_ca_topic_score_gemma":0.003088604,"domain_scores_codex":[0.9989226,0.0004817516,0.00003940029,0.0001521069,0.0002293834,0.0001747015],"domain_scores_gemma":[0.9896188,0.006522184,0.0006800924,0.0009381042,0.001699439,0.0005413473],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001266998,0.0001987059,0.001385304,0.0002179072,0.00009209032,0.0002138931,0.0003883073,0.2586392,0.0036332,0.7158022,0.00313189,0.01617053],"study_design_scores_gemma":[0.000006266516,0.000007172766,0.0001553442,0.000007579282,0.00001034039,0.00002098713,0.00001757984,0.9585861,0.0001267012,0.0408028,0.0002458829,0.00001327064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03511399,0.0005919993,0.9595304,0.0005002911,0.00009249571,0.00003712338,0.00005296978,0.0003708342,0.003709857],"genre_scores_gemma":[0.8870839,0.001430335,0.09110498,0.0003736112,0.0004775535,0.0001759677,0.0002441625,0.0005444767,0.01856488],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006765216,"threshold_uncertainty_score":0.0246225,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Xinyang Shen","is_ca":true},{"name":"Hong Chen","is_ca":true},{"name":"J. G. Dai","is_ca":false},{"name":"Wanyang Dai","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01804850739439129,"gpt":0.2668036029076193,"spread":0.248755095513228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00154915,0.0004669386,0.0009948347,0.0009537498,0.0007642064,0.0009117546,0.001295766,0.001497743,0.003282827],"category_scores_gemma":[0.004307356,0.0006340438,0.0005557972,0.001079241,0.0009912141,0.001148418,0.0008967897,0.00155132,0.000654006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008308106,"about_ca_system_score_gemma":0.001836658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006537995,"about_ca_topic_score_gemma":0.00654818,"domain_scores_codex":[0.999645,0.000132787,0.00001840216,0.00003221581,0.0001413889,0.00003036864],"domain_scores_gemma":[0.9982211,0.001229001,0.00008085951,0.00008565917,0.0003145569,0.00006883931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008152112,0.00006489595,0.0005675604,0.00008325656,0.0000234517,0.00004095728,0.00009779904,0.9380172,0.002350101,0.02025991,0.0006357097,0.03777764],"study_design_scores_gemma":[0.000004469084,0.000004996152,0.00001973213,0.0000037082,0.00000140767,0.000003707256,0.000006320953,0.9976844,0.0002563962,0.001779921,0.0002322674,0.000002729077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01198566,0.000135081,0.9859743,0.0001263278,0.00004068834,0.00003245647,0.00003179564,0.0002648648,0.001408746],"genre_scores_gemma":[0.2574133,0.0003595953,0.7374321,0.0001403336,0.00005611959,0.0003608712,0.0001709478,0.0002704297,0.003796315],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006537995,"threshold_uncertainty_score":0.01299989,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","authors":[{"name":"Douglas G. Down","is_ca":true},{"name":"Rong Wu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02332507120211842,"gpt":0.2441921547155638,"spread":0.2208670835134454,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039715,0.0008328565,0.001301179,0.0009365558,0.001757585,0.002754512,0.002743778,0.0009559318,0.003849243],"category_scores_gemma":[0.01046286,0.0009446163,0.0009716584,0.001039333,0.0009416456,0.002739616,0.00172606,0.001576207,0.001101879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002425163,"about_ca_system_score_gemma":0.002611681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0058965,"about_ca_topic_score_gemma":0.007415568,"domain_scores_codex":[0.9976516,0.0009249935,0.0001601847,0.0002660749,0.0005327964,0.0004643589],"domain_scores_gemma":[0.9959518,0.001620065,0.0003066848,0.001057752,0.0007278561,0.0003357681],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001000771,0.0002311605,0.001014888,0.000165885,0.0001133499,0.0002811452,0.0003046222,0.7674839,0.01824332,0.1005712,0.00598628,0.1046034],"study_design_scores_gemma":[0.00001403845,0.00002932513,0.00007856663,0.000005641491,0.00001727737,0.0000311015,0.00001718625,0.9819435,0.001958426,0.01519449,0.0006924897,0.00001784281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0286528,0.0002594855,0.9672005,0.0002194581,0.0001009163,0.00008326447,0.00009091431,0.001160309,0.002232278],"genre_scores_gemma":[0.5906165,0.0003397129,0.4020702,0.0001480562,0.0001133853,0.0001411513,0.0002245358,0.0003675,0.005979036],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0058965,"threshold_uncertainty_score":0.02100354,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor; Manitoba Beekeepers' Association","funders":"","keywords":"Computer science; Mathematics","authors":[{"name":"Jeffrey E. Diamond","is_ca":true},{"name":"Attahiru Sule Alfa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009491983175894652,"gpt":0.2198468382916295,"spread":0.2103548551157349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005828555,0.001864673,0.001771766,0.002562017,0.001146801,0.002838818,0.002131635,0.002126541,0.002809242],"category_scores_gemma":[0.03187644,0.0009005518,0.001115896,0.002112754,0.003494893,0.005784624,0.0041595,0.003286361,0.0003828674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002366097,"about_ca_system_score_gemma":0.00159785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007096227,"about_ca_topic_score_gemma":0.003214377,"domain_scores_codex":[0.9980261,0.001061531,0.00006840022,0.0001706308,0.0004330429,0.0002402926],"domain_scores_gemma":[0.977199,0.01855693,0.0006975318,0.001080776,0.001552478,0.0009132879],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002147492,0.0001037366,0.001425682,0.0001135845,0.00004253153,0.0001288985,0.0004047049,0.3067034,0.001287211,0.6685613,0.001436922,0.01957729],"study_design_scores_gemma":[0.000008616385,0.00003141447,0.0001039567,0.00001041004,0.000008253928,0.00002198937,0.00003500249,0.8182176,0.0002799459,0.1806522,0.0006188679,0.00001158808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.063816,0.0009398701,0.9273625,0.0005552555,0.0002493565,0.00004340805,0.0000480519,0.0002518905,0.006733512],"genre_scores_gemma":[0.7741107,0.001891039,0.2089278,0.000361263,0.0004502745,0.000135631,0.0002238067,0.0002726171,0.01362685],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007096227,"threshold_uncertainty_score":0.03082472,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David L. Jagerman","is_ca":false},{"name":"Barış Balciog̃lu","is_ca":true},{"name":"Tayfur Altıok","is_ca":false},{"name":"Benjamin Melamed","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01297710120152964,"gpt":0.219790643586509,"spread":0.2068135423849793,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006420237,0.001086542,0.001774976,0.001850865,0.001296686,0.00304922,0.004665039,0.002592994,0.003339306],"category_scores_gemma":[0.02968859,0.0009111175,0.001128771,0.002102926,0.002784587,0.004920862,0.002164223,0.004770695,0.0007794957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00588876,"about_ca_system_score_gemma":0.003690931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02808917,"about_ca_topic_score_gemma":0.01259398,"domain_scores_codex":[0.9983171,0.0005804867,0.00004428289,0.0001827148,0.0004448402,0.0004305219],"domain_scores_gemma":[0.988418,0.008386371,0.0006690611,0.0008129631,0.001205662,0.0005080146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002197939,0.00007236336,0.001157559,0.0001132618,0.0000355203,0.0001808771,0.0004038712,0.4048093,0.001086528,0.5773978,0.006324255,0.008198857],"study_design_scores_gemma":[0.00001398088,0.00000790653,0.0001533965,0.00001186072,0.000009046279,0.00001667546,0.00002548373,0.9441466,0.000101141,0.05509701,0.0004059827,0.00001087972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1623624,0.005369955,0.7914943,0.007402769,0.001125891,0.0001009893,0.0004204201,0.001075168,0.03064818],"genre_scores_gemma":[0.9067727,0.001953772,0.07136369,0.001055105,0.001023434,0.0001340357,0.0002658497,0.000514432,0.01691702],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02808917,"threshold_uncertainty_score":0.05585134,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hui Li","is_ca":true},{"name":"Yiqiang Q. Zhao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01282126222683746,"gpt":0.2308747606590491,"spread":0.2180534984322116,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004988486,0.00108528,0.001363525,0.002450174,0.001080889,0.003112691,0.003394845,0.00164724,0.004379306],"category_scores_gemma":[0.03931193,0.0008206497,0.000797077,0.001694541,0.0028239,0.006143117,0.00260627,0.003996602,0.0007698511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00309875,"about_ca_system_score_gemma":0.00225415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004187057,"about_ca_topic_score_gemma":0.002310861,"domain_scores_codex":[0.9980736,0.0004954517,0.00007120831,0.0002246537,0.0007538945,0.0003812766],"domain_scores_gemma":[0.9854102,0.008982239,0.001303985,0.001415709,0.002062721,0.0008250375],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001826274,0.0001596834,0.002298712,0.0001419693,0.00003715519,0.0003391768,0.000535509,0.1520625,0.004541957,0.8213798,0.003659423,0.0146615],"study_design_scores_gemma":[0.00001767165,0.00002398991,0.0005200314,0.00002380633,0.00001408281,0.0001239588,0.00005863032,0.7684501,0.0005266443,0.2295159,0.000699707,0.00002540901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1711087,0.002493244,0.8006194,0.001775937,0.0002487841,0.00007557474,0.0002350769,0.0009080943,0.0225351],"genre_scores_gemma":[0.9720147,0.001022217,0.01686117,0.0003383084,0.000425756,0.00007031174,0.000175844,0.0002532465,0.008838422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004988486,"threshold_uncertainty_score":0.02638197,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Foad Iravani","is_ca":false},{"name":"Barış Balciog̃lu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03254360343862187,"gpt":0.2431694018438913,"spread":0.2106257984052694,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004639165,0.0009684117,0.001256899,0.00169263,0.00166657,0.003309331,0.005265503,0.002404399,0.01013947],"category_scores_gemma":[0.01860957,0.0007724841,0.001266957,0.002305762,0.00218802,0.003665843,0.002046379,0.003232038,0.002202585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007631084,"about_ca_system_score_gemma":0.003852704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02848431,"about_ca_topic_score_gemma":0.0229815,"domain_scores_codex":[0.9984521,0.0005309941,0.00003604951,0.0001663257,0.0004083588,0.0004061795],"domain_scores_gemma":[0.9938737,0.003553753,0.0003900511,0.0007363493,0.0009366695,0.0005095156],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001844057,0.00008574902,0.001279352,0.00008581185,0.00002744663,0.0001306315,0.0002455042,0.561188,0.0007202082,0.4118702,0.01097739,0.01320536],"study_design_scores_gemma":[0.000007023629,0.000005863136,0.0001446773,0.00001262511,0.000008185542,0.00002069224,0.00002964982,0.9753284,0.0001160923,0.02348329,0.0008336404,0.00000972648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05569103,0.001939938,0.8869693,0.002269363,0.0005487062,0.0001072398,0.0004677078,0.0009405811,0.05106618],"genre_scores_gemma":[0.79792,0.001424557,0.1575941,0.0007768106,0.0006366154,0.0002284744,0.0004858397,0.0007420622,0.04019145],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02848431,"threshold_uncertainty_score":0.05663705,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Attahiru Sule Alfa","is_ca":true},{"name":"Jungong Xue","is_ca":false},{"name":"Qiang Ye","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01098394051631817,"gpt":0.2500382330015101,"spread":0.2390542924851919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004964207,0.001692179,0.00135583,0.003117668,0.001126757,0.002653025,0.002270652,0.0021632,0.005121641],"category_scores_gemma":[0.02478929,0.0007479182,0.001601769,0.001784221,0.00346203,0.004390471,0.00266914,0.004573465,0.0009403461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003275483,"about_ca_system_score_gemma":0.001966591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003571659,"about_ca_topic_score_gemma":0.001223706,"domain_scores_codex":[0.9984524,0.0008845953,0.00004937948,0.0001327268,0.0003295237,0.0001512191],"domain_scores_gemma":[0.9892697,0.007402104,0.0007550822,0.0004336469,0.001488611,0.0006508309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006595246,0.00006292952,0.000297447,0.0001251682,0.00004995646,0.00010082,0.0001778271,0.06738053,0.002171243,0.9217416,0.002884499,0.004941941],"study_design_scores_gemma":[0.00001383541,0.00001702706,0.0002304139,0.0000305608,0.00002069188,0.00006633051,0.00004438397,0.6648988,0.0003241604,0.333427,0.0008957007,0.00003109613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04020694,0.002426194,0.931172,0.00326093,0.0005775621,0.0001078762,0.0001916979,0.0003654199,0.02169144],"genre_scores_gemma":[0.8244443,0.006392672,0.1219366,0.001845243,0.001814387,0.000712135,0.0005764631,0.0008035725,0.04147452],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005121641,"threshold_uncertainty_score":0.02625352,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Qi‐Ming He","is_ca":true},{"name":"Marcel F. Neuts","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01418374144959014,"gpt":0.2123957937844073,"spread":0.1982120523348171,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002252945,0.0009701276,0.001266998,0.001330607,0.003043771,0.006211168,0.003053115,0.004566291,0.01145384],"category_scores_gemma":[0.007957142,0.0009798188,0.0009359095,0.001462646,0.001819177,0.003997575,0.003592027,0.002365188,0.001613817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003850016,"about_ca_system_score_gemma":0.00233637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003696449,"about_ca_topic_score_gemma":0.002766518,"domain_scores_codex":[0.9978564,0.0005291406,0.0001279824,0.0003556594,0.0004247132,0.000706104],"domain_scores_gemma":[0.9959939,0.001413962,0.000417734,0.0005708489,0.0007200272,0.0008836365],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.01248049,0.003324584,0.01441133,0.0005151136,0.0002662606,0.00796106,0.001928568,0.195696,0.04940616,0.6322806,0.02460403,0.05712582],"study_design_scores_gemma":[0.0007195998,0.0007136819,0.003044562,0.00005018973,0.0001165724,0.0008422945,0.0003684395,0.8528197,0.01799038,0.116317,0.006810812,0.0002067693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6818022,0.0008879447,0.2586184,0.01045276,0.002123818,0.0006368809,0.001329283,0.00158986,0.04255879],"genre_scores_gemma":[0.9239455,0.0002093764,0.04328777,0.0007955846,0.0004305825,0.0001557037,0.0002477005,0.00008024636,0.03084749],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01145384,"threshold_uncertainty_score":0.03831691,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Donald A. Dawson","is_ca":true},{"name":"Jiashan Tang","is_ca":true},{"name":"Yiqiang Q. Zhao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008403665087546397,"gpt":0.2362989600954169,"spread":0.2278952950078705,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002785104,0.0006150376,0.001674132,0.001272052,0.001742173,0.002708459,0.00244622,0.002365564,0.005563777],"category_scores_gemma":[0.01159012,0.0007148505,0.0006705192,0.0009419337,0.001522087,0.003552762,0.002251885,0.001709064,0.0005848536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002279618,"about_ca_system_score_gemma":0.001525198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001848417,"about_ca_topic_score_gemma":0.00148461,"domain_scores_codex":[0.9982396,0.0007661651,0.00003791174,0.0001993793,0.0004872104,0.0002697175],"domain_scores_gemma":[0.9948,0.003441968,0.0002818816,0.0003908887,0.000640913,0.0004444722],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006575558,0.0002710119,0.0008977305,0.00007479158,0.00009345257,0.0001107885,0.0001984311,0.4391849,0.007724768,0.5110257,0.005582576,0.03417833],"study_design_scores_gemma":[0.00003239293,0.00003154939,0.0001076216,0.000003353282,0.00001126979,0.00001405565,0.00001254561,0.8831056,0.0003402508,0.1157479,0.0005803088,0.00001309833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09805644,0.0006387059,0.8822291,0.001902231,0.0005741789,0.00007361344,0.00004513222,0.0007442682,0.01573636],"genre_scores_gemma":[0.9557803,0.0002163917,0.03528655,0.0004491939,0.0004605213,0.00009218862,0.00003494543,0.0001234755,0.0075565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005563777,"threshold_uncertainty_score":0.01861262,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Steve Drekic","is_ca":true},{"name":"David A. Stanford","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02095696375057969,"gpt":0.2630803513837344,"spread":0.2421233876331547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001881186,0.0005040037,0.000741673,0.0004870484,0.0004708511,0.001395516,0.001412236,0.0008953767,0.001794261],"category_scores_gemma":[0.0138325,0.0002548472,0.0001702647,0.0004745031,0.0006667388,0.001047114,0.0008356335,0.001362331,0.0002071909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000969292,"about_ca_system_score_gemma":0.001909588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001452295,"about_ca_topic_score_gemma":0.001441862,"domain_scores_codex":[0.9990699,0.0003787153,0.00005373963,0.0001123194,0.0001992006,0.0001861695],"domain_scores_gemma":[0.9941069,0.004316432,0.0004638768,0.0002690736,0.0005045501,0.0003391677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001703035,0.001319332,0.003172804,0.0002204606,0.00010175,0.0001844878,0.0004956578,0.6563323,0.02744727,0.1043606,0.004644953,0.2000173],"study_design_scores_gemma":[0.0001397128,0.0002174832,0.0005753177,0.00001270661,0.00003130043,0.0000275967,0.00005095176,0.9629726,0.003659836,0.0318208,0.0004740897,0.00001752365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2253247,0.0007601368,0.7644388,0.001296206,0.000256356,0.0001497742,0.00004191639,0.00146484,0.0062673],"genre_scores_gemma":[0.9827944,0.00009624488,0.01626343,0.0001252368,0.00003645015,0.0000398969,0.000008718121,0.0000358883,0.0005998953],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001881186,"threshold_uncertainty_score":0.00994879,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hong Chen","is_ca":true},{"name":"Hanqin Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01366989263858857,"gpt":0.2558689195580092,"spread":0.2421990269194206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008630675,0.001570562,0.003194263,0.002408467,0.002534082,0.004699844,0.004523776,0.004581186,0.008698201],"category_scores_gemma":[0.08450648,0.001857995,0.002669707,0.001963222,0.004788361,0.01168332,0.005376889,0.01043581,0.001075297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005028621,"about_ca_system_score_gemma":0.005916325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006232316,"about_ca_topic_score_gemma":0.003106993,"domain_scores_codex":[0.9948545,0.001344414,0.0003844524,0.001129009,0.001470611,0.000817051],"domain_scores_gemma":[0.9159773,0.06467992,0.004819574,0.002883341,0.008515756,0.003124174],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00047267,0.0002134381,0.001923954,0.0005379324,0.0001277356,0.0006466884,0.0008911254,0.09758511,0.01105219,0.8703353,0.004995851,0.01121809],"study_design_scores_gemma":[0.0001422304,0.00006955468,0.0006587877,0.0001301948,0.00006465396,0.0002450504,0.0001801465,0.6625351,0.003416532,0.3297328,0.00274023,0.00008473781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05762303,0.001685465,0.9214135,0.004354892,0.000543161,0.0002062082,0.0007221253,0.0005427141,0.01290887],"genre_scores_gemma":[0.8752149,0.003086515,0.1102019,0.001198257,0.001207016,0.0005553185,0.0008556956,0.0003956912,0.007284829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008698201,"threshold_uncertainty_score":0.04564393,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jingui Xie","is_ca":false},{"name":"Qi‐Ming He","is_ca":true},{"name":"Xiaobo Zhao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01291756361596209,"gpt":0.2296371052120022,"spread":0.2167195415960401,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009251853,0.00131868,0.001892257,0.002939745,0.001410215,0.003288861,0.004114622,0.001668796,0.003299387],"category_scores_gemma":[0.03602591,0.001407357,0.0008855285,0.002874832,0.004586754,0.005562595,0.001471831,0.003314834,0.000467968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005810498,"about_ca_system_score_gemma":0.003214824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01111468,"about_ca_topic_score_gemma":0.005737334,"domain_scores_codex":[0.9981962,0.0006602623,0.00005726846,0.0003011828,0.0004452682,0.0003398473],"domain_scores_gemma":[0.9685332,0.0249726,0.00170576,0.0007958282,0.003096908,0.0008956616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005602236,0.0002154149,0.004423751,0.0002164811,0.0001124489,0.0004024839,0.0008343034,0.5541002,0.005109492,0.4166538,0.003840592,0.01353082],"study_design_scores_gemma":[0.00001779815,0.00002905657,0.0006530145,0.00001763808,0.00002131618,0.00004149269,0.00008666487,0.969609,0.0003250337,0.02897358,0.0002003277,0.00002517286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.34701,0.003167216,0.6375229,0.002758062,0.0003096536,0.0001048859,0.0003428092,0.0004036572,0.008380711],"genre_scores_gemma":[0.98085,0.001847835,0.01270881,0.0001811673,0.0004460998,0.00007155235,0.0002454501,0.0001376505,0.003511415],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01111468,"threshold_uncertainty_score":0.04892904,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Steve Drekic","is_ca":true},{"name":"David A. Stanford","is_ca":true},{"name":"Douglas G. Woolford","is_ca":true},{"name":"Vivian C. McAlister","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01843517538255782,"gpt":0.2257407653887213,"spread":0.2073055900061635,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002327972,0.001201132,0.001900722,0.001102375,0.001425922,0.004706241,0.004483244,0.004911226,0.01169135],"category_scores_gemma":[0.007555711,0.0009534723,0.001335878,0.001535136,0.001353484,0.003379097,0.001632271,0.003460193,0.001599095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006376225,"about_ca_system_score_gemma":0.004821443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03666456,"about_ca_topic_score_gemma":0.01886078,"domain_scores_codex":[0.998931,0.0002850825,0.00004646948,0.0002516774,0.0001715465,0.0003141925],"domain_scores_gemma":[0.9972463,0.001580828,0.0002715132,0.0000888614,0.0004382177,0.000374298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000145914,0.0001462404,0.001542866,0.0001091648,0.00005786158,0.0005458337,0.000256908,0.8312536,0.001262633,0.1539786,0.00505,0.005650249],"study_design_scores_gemma":[0.00004145368,0.00003502768,0.0002698117,0.00001312555,0.00003000311,0.00007886717,0.00004526521,0.9807779,0.00009963224,0.0175619,0.001024194,0.00002291139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1635273,0.001973188,0.7764827,0.01098907,0.0009284916,0.0002891946,0.003113958,0.0008360375,0.0418601],"genre_scores_gemma":[0.9234155,0.00114891,0.01839175,0.0006979987,0.0002990311,0.0002403761,0.0008534794,0.0001452684,0.05480766],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03666456,"threshold_uncertainty_score":0.07290226,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hong Chen","is_ca":true},{"name":"Heng-Qing Ye","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02045667733063701,"gpt":0.2582556669479064,"spread":0.2377989896172694,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006130199,0.0008153357,0.001473368,0.001871768,0.001476031,0.003106112,0.002235645,0.002169783,0.004028236],"category_scores_gemma":[0.04864143,0.001146065,0.0009560557,0.001077491,0.00325662,0.005551149,0.003226464,0.005225705,0.0003867346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004457274,"about_ca_system_score_gemma":0.002398089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004573712,"about_ca_topic_score_gemma":0.002529399,"domain_scores_codex":[0.9982394,0.0006485017,0.00007674669,0.0002648103,0.0004665422,0.0003039678],"domain_scores_gemma":[0.9704213,0.02318769,0.001563546,0.0007215159,0.002784841,0.001321023],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001958096,0.00006949362,0.001065225,0.0001451616,0.00004184366,0.0001566359,0.0005442734,0.1143436,0.003286754,0.8685653,0.002215714,0.009370172],"study_design_scores_gemma":[0.00002217449,0.00001736192,0.0002286078,0.00003209399,0.00001403099,0.00004885636,0.00007363068,0.8451145,0.0005381419,0.1530358,0.0008558448,0.00001893833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1305262,0.002161209,0.8452548,0.004001865,0.0003457073,0.00008704026,0.000150557,0.000287667,0.01718502],"genre_scores_gemma":[0.9334146,0.001593289,0.05196356,0.0004887508,0.0003110874,0.0001458347,0.0001955816,0.0001436969,0.01174361],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006130199,"threshold_uncertainty_score":0.03241998,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"François Baccelli","is_ca":false},{"name":"Ki Baek Kim","is_ca":false},{"name":"David McDonald","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01079789601405104,"gpt":0.2209600135785384,"spread":0.2101621175644873,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00140679,0.0009660425,0.001144525,0.001491779,0.001874437,0.003826081,0.00179486,0.002742428,0.006593575],"category_scores_gemma":[0.00806299,0.0007090184,0.001068493,0.001053686,0.002052445,0.002910861,0.001915913,0.002232071,0.0004993796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002589591,"about_ca_system_score_gemma":0.001449434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007491107,"about_ca_topic_score_gemma":0.004469647,"domain_scores_codex":[0.9993668,0.0002176668,0.00002901275,0.00009331543,0.0001415567,0.0001516268],"domain_scores_gemma":[0.9975265,0.001540753,0.0003190571,0.00007102763,0.0003130753,0.0002296249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000576552,0.00008827831,0.0006860192,0.00004879922,0.00002586637,0.0001953997,0.0002171216,0.04552469,0.00113961,0.9472417,0.00206667,0.002708185],"study_design_scores_gemma":[0.00007088013,0.00003807725,0.0002991631,0.00002427807,0.00002304873,0.00008542221,0.0001498815,0.5480292,0.0004636786,0.4495401,0.001250089,0.0000262279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4012198,0.001264511,0.5391371,0.003253813,0.0002884319,0.0002391236,0.0005451512,0.0003183126,0.05373385],"genre_scores_gemma":[0.9666503,0.0006847196,0.01555732,0.0002215742,0.0001645063,0.0001301743,0.0002058075,0.00006665171,0.01631877],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007491107,"threshold_uncertainty_score":0.02205771,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Mathematics","authors":[{"name":"Attahiru Sule Alfa","is_ca":true},{"name":"Jungong Xue","is_ca":false},{"name":"Qiang Ye","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01254046748760409,"gpt":0.2553203178125956,"spread":0.2427798503249915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003605658,0.001473703,0.001218742,0.002353616,0.001057995,0.002082282,0.002335058,0.002017935,0.006253467],"category_scores_gemma":[0.02442297,0.0006716986,0.001598754,0.00164555,0.002549818,0.004073545,0.002359435,0.004271655,0.001214795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002542493,"about_ca_system_score_gemma":0.001886629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004320178,"about_ca_topic_score_gemma":0.001620246,"domain_scores_codex":[0.9987553,0.0006220855,0.00004746152,0.0001325409,0.0003136502,0.0001289448],"domain_scores_gemma":[0.9910749,0.005118487,0.0006473549,0.0007360124,0.001932306,0.0004909623],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006492195,0.00004380586,0.0003398188,0.0001550466,0.00005022682,0.0001227451,0.0001553842,0.07557001,0.0025739,0.9071048,0.00504205,0.008777278],"study_design_scores_gemma":[0.00001239082,0.00001344117,0.0002688565,0.00003282391,0.00001848514,0.00009702152,0.0000288854,0.6678184,0.0005963609,0.3292358,0.00183978,0.00003779018],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0221911,0.002218068,0.9503117,0.003153752,0.001449924,0.00008383334,0.0001415994,0.0005275871,0.01992248],"genre_scores_gemma":[0.7578749,0.006122556,0.1567103,0.002238456,0.002906313,0.000477815,0.0004942122,0.001165743,0.07200973],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006253467,"threshold_uncertainty_score":0.02091998,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Opher Baron","is_ca":true},{"name":"Antonis Economou","is_ca":false},{"name":"Athanasia Manou","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008609727379317943,"gpt":0.2149337979784225,"spread":0.2063240705991045,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001322749,0.0005721056,0.0008876903,0.0009589636,0.001514995,0.002268084,0.001720187,0.001675024,0.003309133],"category_scores_gemma":[0.006665865,0.0004031186,0.0006245254,0.0009552845,0.001626603,0.002368916,0.001607904,0.00182692,0.000380838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002655488,"about_ca_system_score_gemma":0.002658986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01061103,"about_ca_topic_score_gemma":0.006199911,"domain_scores_codex":[0.9994336,0.0000942284,0.00001885028,0.0001120231,0.0001622907,0.0001790588],"domain_scores_gemma":[0.9982103,0.0006892082,0.0003068719,0.0002037312,0.000309279,0.0002806361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005571817,0.0001492239,0.004352787,0.0001260728,0.0000480852,0.00081942,0.000346621,0.2071936,0.008239553,0.7583119,0.00673048,0.01312506],"study_design_scores_gemma":[0.00004352293,0.00005628789,0.0009802034,0.00001183305,0.00002548703,0.0001265841,0.00005381118,0.9061586,0.001252657,0.09057152,0.0006786599,0.00004090535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6208116,0.001179356,0.3479528,0.00438732,0.0006992933,0.0001470459,0.0007134635,0.000705293,0.02340372],"genre_scores_gemma":[0.981501,0.0002589538,0.01039259,0.0002047372,0.0002095698,0.00002800256,0.0001246115,0.00004245242,0.007238072],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01061103,"threshold_uncertainty_score":0.02109855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1541967644","doi":"10.1023/a:1019150312811","title":"Overflow and losses in a network queue with a self-similar input","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Communications Research Centre Canada; University of Ottawa","funders":"","keywords":"Computer science; Mathematics","authors":[{"name":"B. Tsybakov","is_ca":false},{"name":"Nicolas D. Georganas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004166838745077293,"gpt":0.1805184383715006,"spread":0.1763515996264233,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003028853,0.0006028747,0.001098953,0.001333976,0.001228206,0.002133795,0.001844229,0.002032551,0.00151505],"category_scores_gemma":[0.01609515,0.0007442246,0.00057298,0.0008393036,0.001847171,0.002620548,0.001634942,0.001103331,0.0001116232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002683409,"about_ca_system_score_gemma":0.001228947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005445978,"about_ca_topic_score_gemma":0.003694081,"domain_scores_codex":[0.9990692,0.0002415531,0.00006429818,0.0001429301,0.0002473488,0.0002346869],"domain_scores_gemma":[0.989046,0.007349793,0.001204363,0.0003095714,0.0009297089,0.001160547],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002804911,0.0006865488,0.01637148,0.0001983285,0.0001622199,0.002311188,0.001141304,0.8058389,0.02068281,0.1306212,0.00274963,0.01643156],"study_design_scores_gemma":[0.00003633478,0.00005639283,0.000868509,0.000005148779,0.00002567845,0.00005730143,0.00003491823,0.9895316,0.0007770993,0.00854073,0.00004863935,0.00001761259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8967793,0.0002562479,0.1001496,0.0006703374,0.000106995,0.00005440304,0.0001203216,0.0002432473,0.00161949],"genre_scores_gemma":[0.9951617,0.00006018916,0.003302915,0.00005634955,0.00005134097,0.00001614423,0.00004188418,0.00001963523,0.001289725],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005445978,"threshold_uncertainty_score":0.01946962,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yutaka Sakuma","is_ca":false},{"name":"Masakiyo Miyazawa","is_ca":false},{"name":"Yiqiang Q. Zhao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009475817708492512,"gpt":0.2234021209784268,"spread":0.2139263032699343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007212178,0.001107885,0.001546021,0.002659453,0.001773188,0.003197816,0.003449007,0.002161011,0.004716802],"category_scores_gemma":[0.03906041,0.0008763123,0.0008625712,0.001500478,0.002595244,0.004268394,0.002603577,0.003243197,0.0008455269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004843545,"about_ca_system_score_gemma":0.004423684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01003402,"about_ca_topic_score_gemma":0.003520011,"domain_scores_codex":[0.9983655,0.0003594048,0.00007353569,0.0002391699,0.0004700285,0.0004924846],"domain_scores_gemma":[0.9798922,0.01188446,0.001749419,0.001070956,0.003806633,0.001596373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001221605,0.0002711129,0.005972259,0.0004600504,0.00009423023,0.0004965212,0.001516378,0.2069994,0.02379135,0.7284647,0.008261473,0.02245086],"study_design_scores_gemma":[0.00006290722,0.00007572401,0.0006326553,0.00004006012,0.00004900252,0.0001744469,0.0001395808,0.9485366,0.001812311,0.04782113,0.0005900123,0.00006554073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3029046,0.001504113,0.678625,0.003651907,0.0003573095,0.0002359173,0.0005917093,0.001366341,0.01076309],"genre_scores_gemma":[0.9584776,0.0007878263,0.02885818,0.000412099,0.0001781159,0.0001768443,0.0002702377,0.0002976339,0.01054159],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01003402,"threshold_uncertainty_score":0.03814209,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"John Shortle","is_ca":false},{"name":"Percy H. Brill","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01137263580928066,"gpt":0.2322363896830519,"spread":0.2208637538737712,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00256,0.0006612606,0.0006932893,0.001742918,0.0008967133,0.001923454,0.001889881,0.001074091,0.003939026],"category_scores_gemma":[0.01072071,0.0006139152,0.0003773414,0.001275371,0.001522184,0.001945164,0.0009192839,0.001601631,0.0005679947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004556797,"about_ca_system_score_gemma":0.002421693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008827465,"about_ca_topic_score_gemma":0.004652863,"domain_scores_codex":[0.9993929,0.0001324986,0.00002142997,0.0001056163,0.000145833,0.0002017056],"domain_scores_gemma":[0.9962308,0.002176181,0.0004326669,0.0001820718,0.0006438417,0.0003345646],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006481366,0.0002155909,0.007096789,0.0002532473,0.00005416827,0.0005835931,0.0009402403,0.3279099,0.01799611,0.6185528,0.008808753,0.01694067],"study_design_scores_gemma":[0.00002332083,0.00003314792,0.001065865,0.00002089151,0.00001509326,0.00009326607,0.00008492053,0.9726825,0.00110395,0.02420251,0.0006410646,0.00003343656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6492271,0.002945977,0.3203857,0.003062178,0.0003693207,0.0001178055,0.00066829,0.00101471,0.02220886],"genre_scores_gemma":[0.9869618,0.000444965,0.007811681,0.0001193097,0.0001490636,0.00003108937,0.0001398209,0.00008669928,0.004255548],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008827465,"threshold_uncertainty_score":0.03306198,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"A. Karthik","is_ca":true},{"name":"Arpan Mukhopadhyay","is_ca":true},{"name":"Ravi R. Mazumdar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01180901223012604,"gpt":0.2141525646057336,"spread":0.2023435523756076,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005265129,0.000707062,0.001381798,0.001157811,0.002006216,0.004017915,0.002065144,0.00142598,0.008007216],"category_scores_gemma":[0.01385894,0.0007089856,0.0008721265,0.001620253,0.0008647767,0.005337499,0.002160947,0.001644544,0.0007279508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001495368,"about_ca_system_score_gemma":0.001906852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001808675,"about_ca_topic_score_gemma":0.004342805,"domain_scores_codex":[0.9963862,0.001609247,0.0001499828,0.0004692038,0.0004010307,0.0009843642],"domain_scores_gemma":[0.990577,0.005176159,0.0003948924,0.001390347,0.0008660609,0.001595578],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.009169085,0.002021841,0.05495564,0.00022864,0.0007977346,0.001869138,0.000718954,0.459665,0.02051669,0.1397983,0.01192458,0.2983344],"study_design_scores_gemma":[0.0002591979,0.0005124015,0.005358621,0.00003288302,0.0002068651,0.0002873761,0.0009252303,0.9143056,0.004722781,0.07092792,0.002397379,0.00006378426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8231988,0.0005585179,0.1608373,0.002039456,0.0001550273,0.0002193275,0.0001307259,0.0003616572,0.01249923],"genre_scores_gemma":[0.9738056,0.00007275,0.02500595,0.0001156173,0.00003424892,0.00002123135,0.00004241188,0.0000385784,0.0008635451],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008007216,"threshold_uncertainty_score":0.02784503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2605431651","doi":"10.1007/s11134-017-9524-3","title":"Mutual service processes in Euclidean spaces: existence and ergodicity","year":2017,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Academy of Finland","keywords":"Ergodicity; Mathematics; Moment (physics); Point process; Euclidean geometry; Hierarchy; Poisson distribution; Set (abstract data type); Service (business); Property (philosophy); Pure mathematics; Discrete mathematics; Computer science; Statistics; Geometry; Business; Economics","authors":[{"name":"François Baccelli","is_ca":true},{"name":"Fabien Mathieu","is_ca":false},{"name":"Ilkka Norros","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1230389899774974,"gpt":0.350376631644675,"spread":0.2273376416671776,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005305263,0.001373155,0.001788001,0.003629695,0.001666221,0.004069297,0.002331108,0.002140497,0.003270746],"category_scores_gemma":[0.02057351,0.0008842301,0.00169008,0.002605221,0.006753742,0.008448894,0.004432989,0.003653825,0.0003781545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002458539,"about_ca_system_score_gemma":0.001543441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002112302,"about_ca_topic_score_gemma":0.001353484,"domain_scores_codex":[0.9974447,0.001035591,0.000142022,0.0004636167,0.0005114471,0.0004026151],"domain_scores_gemma":[0.9806548,0.01304718,0.002750808,0.000950092,0.001493498,0.001103538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003278243,0.00001796156,0.0003938469,0.00003446395,0.00002376295,0.00004872838,0.0001661598,0.008106845,0.0003242095,0.9889832,0.0001799426,0.001688099],"study_design_scores_gemma":[0.00002107371,0.00004280403,0.0005621522,0.00002685352,0.00004142142,0.0001298192,0.0001496812,0.1342977,0.0005198664,0.8631946,0.0009774868,0.00003659815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2562302,0.002341312,0.7275317,0.001282007,0.0001045837,0.00004241651,0.0001788433,0.0001423364,0.01214656],"genre_scores_gemma":[0.9564231,0.002200798,0.03300183,0.0001735365,0.0003841659,0.0001117647,0.0001730715,0.00007726823,0.00745446],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005305263,"threshold_uncertainty_score":0.02805722,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Bin Liu","is_ca":false},{"name":"Jinting Wang","is_ca":false},{"name":"Yiqiang Q. Zhao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005865845183217902,"gpt":0.1795847366588869,"spread":0.173718891475669,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009549459,0.002169437,0.001943682,0.004129311,0.001529977,0.003732607,0.004811625,0.00270857,0.01085654],"category_scores_gemma":[0.0672413,0.001670255,0.001359852,0.002139371,0.005485842,0.007822751,0.003148688,0.006450544,0.001980256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006560388,"about_ca_system_score_gemma":0.004055538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01085363,"about_ca_topic_score_gemma":0.007504147,"domain_scores_codex":[0.9980798,0.0005737846,0.00007971359,0.0003270795,0.0004278038,0.0005118083],"domain_scores_gemma":[0.9614416,0.02776868,0.002994635,0.002214713,0.003697243,0.001883126],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000554091,0.0001962669,0.002754742,0.0002885763,0.00009607415,0.0003607379,0.001278727,0.1169165,0.007582994,0.8502142,0.007006335,0.01275076],"study_design_scores_gemma":[0.00006101833,0.00004821785,0.001897019,0.000106132,0.00006856557,0.0002198407,0.0002043452,0.825102,0.001379311,0.1698087,0.0009819103,0.0001230627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3066551,0.005386247,0.6498428,0.006624518,0.0006622917,0.0001923721,0.001048189,0.00260763,0.02698085],"genre_scores_gemma":[0.9471433,0.002480502,0.02583321,0.0007800886,0.0008655776,0.0002916438,0.0007115506,0.0009293336,0.0209649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01085654,"threshold_uncertainty_score":0.05050296,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Sigrún Andradóttir","is_ca":false},{"name":"Hayriye Ayhan","is_ca":false},{"name":"Douglas G. Down","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01034886868263226,"gpt":0.2250333801350195,"spread":0.2146845114523872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007146902,0.0007967049,0.002768711,0.001584322,0.001716795,0.003814471,0.002247799,0.002768659,0.005584208],"category_scores_gemma":[0.03506816,0.001063983,0.0006268354,0.002315088,0.001571903,0.00473951,0.002890711,0.001771484,0.0007174733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001705832,"about_ca_system_score_gemma":0.00596396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003268484,"about_ca_topic_score_gemma":0.002676667,"domain_scores_codex":[0.9946114,0.002473536,0.0003357003,0.0006736406,0.000454912,0.00145079],"domain_scores_gemma":[0.9762303,0.01476979,0.001917973,0.002833767,0.001772579,0.002475606],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004137255,0.001520297,0.01090123,0.0004593644,0.0002683611,0.0008193193,0.0008265658,0.6711073,0.006803841,0.1487161,0.01468512,0.1397553],"study_design_scores_gemma":[0.0003252219,0.0002073615,0.001816384,0.00004760214,0.00009599092,0.0001903074,0.0006549325,0.7473423,0.002180212,0.2455267,0.001576448,0.00003657166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4559038,0.0002720029,0.5194913,0.0034543,0.0001840239,0.0003882064,0.0003184197,0.00060126,0.01938663],"genre_scores_gemma":[0.9597138,0.00009191512,0.03763743,0.0001386034,0.00007512017,0.0001083961,0.0000824999,0.00005230153,0.002099825],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007146902,"threshold_uncertainty_score":0.03779691,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jean-Paul Haddad","is_ca":true},{"name":"Ravi R. Mazumdar","is_ca":true},{"name":"Francisco J. Piera","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01659387192183311,"gpt":0.2519396716626834,"spread":0.2353457997408503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02578285,0.002723736,0.003402368,0.00670974,0.002471816,0.003572489,0.007645954,0.003497264,0.02184828],"category_scores_gemma":[0.07970169,0.001537176,0.002708462,0.00605693,0.005016475,0.02138921,0.008191849,0.008516455,0.001206741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005308601,"about_ca_system_score_gemma":0.004574448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002750132,"about_ca_topic_score_gemma":0.002232945,"domain_scores_codex":[0.9903486,0.00520306,0.000318289,0.001162953,0.002168961,0.0007980979],"domain_scores_gemma":[0.8874378,0.09470772,0.003034967,0.003279464,0.008586194,0.002953887],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006361944,0.0002152538,0.001181164,0.0003919486,0.0001774592,0.0001347497,0.0002635138,0.110448,0.001547911,0.8466523,0.005440217,0.03291126],"study_design_scores_gemma":[0.00004292356,0.0001938082,0.0004968255,0.00007499842,0.0000837574,0.00007994862,0.00005551077,0.4012964,0.001081868,0.5932729,0.003270023,0.00005109704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02784648,0.002417967,0.9506171,0.001768959,0.0005232638,0.0001499037,0.0003546098,0.000314885,0.01600702],"genre_scores_gemma":[0.5373166,0.006174259,0.4002226,0.001871667,0.001934225,0.001178146,0.001894277,0.001302108,0.04810617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02578285,"threshold_uncertainty_score":0.1363543,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Qi‐Ming He","is_ca":true},{"name":"Hui Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01752167341635439,"gpt":0.2273393239317797,"spread":0.2098176505154253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001551661,0.0006030044,0.0006999009,0.001226748,0.001273771,0.002628971,0.001436473,0.0008862655,0.005252068],"category_scores_gemma":[0.00753114,0.0003934902,0.000403717,0.0007051324,0.001410948,0.001274145,0.001442999,0.001295914,0.0008379386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002427206,"about_ca_system_score_gemma":0.00252994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02004899,"about_ca_topic_score_gemma":0.006436416,"domain_scores_codex":[0.9992601,0.000150266,0.00002677612,0.0001406036,0.0001877723,0.0002343964],"domain_scores_gemma":[0.9964941,0.001317449,0.000420176,0.0001523292,0.001375122,0.0002408547],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001006101,0.000128936,0.002907928,0.000197444,0.00008076754,0.0006637842,0.001035664,0.4609211,0.03000212,0.4698826,0.009746626,0.02342686],"study_design_scores_gemma":[0.00002374459,0.00002948497,0.0004263544,0.00001040281,0.000009444388,0.00003753117,0.00008187116,0.961802,0.001332748,0.03584351,0.0003833283,0.00001965228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3818784,0.001514937,0.5737665,0.002053031,0.0002658483,0.0002490542,0.0008171377,0.00070681,0.0387482],"genre_scores_gemma":[0.9875799,0.0002421912,0.007087096,0.0001096674,0.00007561839,0.00007085632,0.0001464062,0.000078157,0.004610278],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02004899,"threshold_uncertainty_score":0.03986454,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Salih Tekin","is_ca":false},{"name":"Sigrún Andradóttir","is_ca":false},{"name":"Douglas G. Down","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01897396136194329,"gpt":0.2165737138524776,"spread":0.1975997524905343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004068667,0.0008718623,0.001727869,0.00104124,0.001617025,0.002845958,0.002804396,0.001178978,0.002507881],"category_scores_gemma":[0.01391848,0.0008966304,0.0005643903,0.001350753,0.001651256,0.003358415,0.002217662,0.001639609,0.0003175097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003297231,"about_ca_system_score_gemma":0.002114897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004043939,"about_ca_topic_score_gemma":0.003515752,"domain_scores_codex":[0.998293,0.0006324258,0.00008134893,0.0002818223,0.0002961039,0.0004152565],"domain_scores_gemma":[0.9939269,0.004252294,0.0004174898,0.0004247584,0.0005204065,0.0004580866],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002680531,0.00005673923,0.0005071496,0.00003663084,0.00003433947,0.0001002039,0.0001213559,0.9080873,0.001738223,0.07592151,0.0009054095,0.01222318],"study_design_scores_gemma":[0.000007772956,0.000009335939,0.00004831318,0.0000020057,0.00000496533,0.000008588539,0.00001073188,0.984092,0.000135119,0.01557488,0.0001011854,0.000005119303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08368762,0.0003283867,0.9129394,0.0003518729,0.00008351962,0.00005865064,0.00006582293,0.0002099219,0.002274789],"genre_scores_gemma":[0.9628966,0.0001851483,0.03428768,0.00007362112,0.00006976619,0.00008774801,0.00006034767,0.00007877241,0.002260305],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004068667,"threshold_uncertainty_score":0.02392316,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Qi‐Ming He","is_ca":true},{"name":"Alireza Aliakbar Chavoushi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01381046385225283,"gpt":0.2360998558738797,"spread":0.2222893920216268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005378281,0.001300036,0.00158762,0.001723498,0.00113571,0.003310816,0.002445103,0.001529492,0.00324338],"category_scores_gemma":[0.01549647,0.0008801294,0.001202845,0.001515239,0.002306292,0.003091202,0.001911577,0.002332677,0.0003404167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004239262,"about_ca_system_score_gemma":0.003807658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01082842,"about_ca_topic_score_gemma":0.004034288,"domain_scores_codex":[0.9970301,0.001131755,0.00009697898,0.0003493425,0.0008506203,0.0005411184],"domain_scores_gemma":[0.9902869,0.007129068,0.0005258227,0.0003659595,0.001236541,0.0004556183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005371562,0.00007535316,0.0008805757,0.00005368556,0.00005701978,0.0001201389,0.0001181084,0.684505,0.001178173,0.3067074,0.001045577,0.005205125],"study_design_scores_gemma":[0.000004433623,0.000008152395,0.0001333509,0.000003820921,0.000008234087,0.00001052662,0.0000138226,0.9649728,0.0001069873,0.03453453,0.0001965889,0.000006696915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08180218,0.00148119,0.9064043,0.001195309,0.0001771195,0.00008333733,0.0001395739,0.000188521,0.008528442],"genre_scores_gemma":[0.9628477,0.0009458118,0.02687072,0.0001717209,0.0003787339,0.00007984174,0.0001461989,0.00008168806,0.0084776],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01082842,"threshold_uncertainty_score":0.03075814,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118574840","doi":"10.1007/s11134-011-9242-1","title":"Tail behaviour of the area under a random process, with applications to queueing systems, insurance and percolations","year":2011,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Queueing theory; Layered queueing network; Computer science; G-network; Queue; Percolation theory; Mean value analysis; Process (computing); Workload; Focus (optics); Probability theory; Mathematics; Computer network; Topology (electrical circuits); Statistics; Physics; Operating system; Combinatorics","authors":[{"name":"Rafał Kulik","is_ca":true},{"name":"Zbigniew Palmowski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1164618565890748,"gpt":0.3276070974455677,"spread":0.2111452408564929,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004033587,0.000892622,0.001029151,0.003095128,0.001036727,0.002602164,0.001295515,0.001469799,0.00402471],"category_scores_gemma":[0.0300665,0.0004480761,0.0007567807,0.001982017,0.003895306,0.005103609,0.001794866,0.002121369,0.0003953654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001723639,"about_ca_system_score_gemma":0.0006909578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002432981,"about_ca_topic_score_gemma":0.001151736,"domain_scores_codex":[0.999091,0.0003995872,0.00004335846,0.0001826184,0.0001705492,0.0001128858],"domain_scores_gemma":[0.9840527,0.01064802,0.001779339,0.0007152862,0.001568428,0.001236283],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001444479,0.00009183121,0.004536996,0.0002261765,0.00005344384,0.0006128965,0.0009381712,0.07750646,0.007189776,0.8890492,0.002373107,0.01727761],"study_design_scores_gemma":[0.0000212743,0.00007151751,0.003128357,0.00007323641,0.00003577654,0.0004929026,0.0002697843,0.468625,0.001002508,0.5247,0.001516674,0.00006303608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.403804,0.009609015,0.5551823,0.00463445,0.0003100544,0.0001010222,0.0003404006,0.0007940171,0.02522481],"genre_scores_gemma":[0.9755886,0.003187477,0.01500526,0.0002240798,0.0005725119,0.00007458156,0.0001541086,0.0001673699,0.005025971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004033587,"threshold_uncertainty_score":0.02133185,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Queue; Priority queue; Mathematics; Bulk queue; Computer science; Applied mathematics; Mathematical optimization; Computer network","authors":[{"name":"Jungong Xue","is_ca":false},{"name":"Attahiru Sule Alfa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01823093109056307,"gpt":0.2294705743490242,"spread":0.2112396432584612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002071457,0.0006743328,0.0007181324,0.001829734,0.0007444481,0.00197614,0.002190774,0.001021625,0.004315446],"category_scores_gemma":[0.01090356,0.0005595584,0.0005398233,0.001133064,0.001423003,0.002600401,0.001541227,0.001413636,0.0005638591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003022291,"about_ca_system_score_gemma":0.001959587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00517062,"about_ca_topic_score_gemma":0.003656681,"domain_scores_codex":[0.9993562,0.0001107297,0.00001930052,0.0001539668,0.0001738436,0.0001860002],"domain_scores_gemma":[0.9951162,0.002421527,0.0007366465,0.0002781925,0.0009442893,0.0005031234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001218343,0.0002695931,0.02475658,0.0003062115,0.00009849025,0.001388355,0.0007012372,0.6589618,0.01797119,0.26289,0.006463367,0.02497487],"study_design_scores_gemma":[0.00001878145,0.00006965734,0.003244163,0.00001286652,0.00001974995,0.0001507248,0.00007168169,0.9650016,0.001614613,0.02942103,0.0003380965,0.00003709775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6210025,0.0006842887,0.36509,0.001144445,0.0001940619,0.0001147719,0.0006456938,0.001257305,0.009866884],"genre_scores_gemma":[0.9875267,0.0001883165,0.008284517,0.0001030599,0.0001033658,0.00003196346,0.0003212213,0.0001042551,0.003336561],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00517062,"threshold_uncertainty_score":0.02192843,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083312487","doi":"10.1007/s11134-009-9113-1","title":"Transient solutions for multi-server queues with finite buffers","year":2009,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia; University of Saskatchewan","funders":"","keywords":"Eigenvalues and eigenvectors; Transient (computer programming); Queue; Staffing; Mathematics; Finite difference; Applied mathematics; Finite set; Computer science; Mathematical analysis; Physics; Computer network; Operating system","authors":[{"name":"Winfried K. Grassmann","is_ca":true},{"name":"Javad Tavakoli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03844989264053857,"gpt":0.2622355256748267,"spread":0.2237856330342882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001503514,0.0007501128,0.0008726286,0.001164557,0.0009033728,0.002386222,0.001609574,0.001948779,0.004101902],"category_scores_gemma":[0.01284049,0.0006729577,0.0006845966,0.001078901,0.00168712,0.002133009,0.001449518,0.001504476,0.0003540208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002510473,"about_ca_system_score_gemma":0.001897468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004781853,"about_ca_topic_score_gemma":0.003091245,"domain_scores_codex":[0.9995908,0.0001329102,0.0000214999,0.00006156396,0.00009358958,0.00009970799],"domain_scores_gemma":[0.9953859,0.00337436,0.0003677196,0.0001321584,0.0004636602,0.0002762504],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002365775,0.0001182334,0.0005611453,0.0001542716,0.00004945895,0.0002208789,0.000357969,0.5420278,0.003156438,0.4356097,0.003294067,0.01421348],"study_design_scores_gemma":[0.00002098254,0.00001252742,0.00006173736,0.00001328164,0.000007689486,0.00001722032,0.00005344249,0.9300568,0.0002629051,0.06923033,0.0002540254,0.000009124856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06236593,0.0009518203,0.9256598,0.00124027,0.000211924,0.00005201778,0.00009347775,0.0003351624,0.009089573],"genre_scores_gemma":[0.9471741,0.0008145861,0.03783322,0.000254128,0.0001314893,0.0001648311,0.0001178624,0.0001159774,0.01339368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004781853,"threshold_uncertainty_score":0.01821482,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Jean-Paul Haddad","is_ca":true},{"name":"Ravi R. Mazumdar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0127721185429633,"gpt":0.2345142388983309,"spread":0.2217421203553676,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003672872,0.0005331786,0.001281385,0.001027369,0.001334273,0.003140181,0.001331188,0.001047663,0.002056784],"category_scores_gemma":[0.02344858,0.000853863,0.0003129379,0.001159015,0.001748625,0.003675808,0.001455568,0.001045205,0.0001488584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003334403,"about_ca_system_score_gemma":0.001363341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009425082,"about_ca_topic_score_gemma":0.006024275,"domain_scores_codex":[0.9983345,0.0007028263,0.00005451567,0.0001860632,0.00035971,0.0003625442],"domain_scores_gemma":[0.9902705,0.007048234,0.0007863335,0.0002817522,0.001092376,0.0005207307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000369533,0.00007905387,0.002747171,0.00007344419,0.00003794511,0.0002208268,0.0002641543,0.8154691,0.002365006,0.166666,0.001615976,0.0100918],"study_design_scores_gemma":[0.000009518368,0.00001248578,0.0002491811,0.00000459127,0.000008616007,0.00002034161,0.00003354347,0.9777385,0.0001242399,0.02162506,0.0001667808,0.000007144412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4627297,0.00219891,0.5265311,0.001856549,0.0002372717,0.0000678119,0.0001218374,0.0003426782,0.005914172],"genre_scores_gemma":[0.9924505,0.0003454715,0.005147687,0.00006760395,0.00008767218,0.00002422225,0.00003342374,0.00002821782,0.001815063],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009425082,"threshold_uncertainty_score":0.02419293,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Yaofei Xiong","is_ca":true},{"name":"Duncan J. Murdoch","is_ca":true},{"name":"David A. Stanford","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01995953751287879,"gpt":0.2243493321887933,"spread":0.2043897946759145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004416491,0.0007678852,0.001450726,0.0009717779,0.0008723876,0.001389705,0.002682131,0.0008573409,0.001156161],"category_scores_gemma":[0.01716593,0.0007554769,0.0007569058,0.0009589439,0.001111598,0.002133141,0.002159473,0.0009872378,0.0003277549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001463357,"about_ca_system_score_gemma":0.002001898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003449918,"about_ca_topic_score_gemma":0.002551123,"domain_scores_codex":[0.9977021,0.0007181844,0.0001515029,0.0003884038,0.0006810913,0.0003586687],"domain_scores_gemma":[0.9919928,0.004408392,0.0006567131,0.001614092,0.0008000133,0.0005279955],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001457616,0.0001538231,0.008286046,0.0002216354,0.0001366216,0.0003904023,0.0005013176,0.7449631,0.009154453,0.08972086,0.002158472,0.1428556],"study_design_scores_gemma":[0.00001852637,0.00003536583,0.000169341,0.000004551717,0.000007205644,0.00004800655,0.00001281179,0.9866799,0.001513321,0.01132623,0.0001782077,0.000006557824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04873324,0.0001610251,0.949658,0.00008699014,0.000024731,0.00005933089,0.00005223066,0.000617646,0.0006068705],"genre_scores_gemma":[0.7114355,0.0001469475,0.2866794,0.0001227214,0.00005590407,0.0001242097,0.0002794985,0.00009210258,0.001063778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004416491,"threshold_uncertainty_score":0.02335691,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Queueing theory; Statistical inference; Field (mathematics); Inference; Computer science; Econometrics; Statistics; Mathematics; Artificial intelligence","authors":[{"name":"Yiqiang Q. Zhao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02795936803819536,"gpt":0.2711436432138503,"spread":0.243184275175655,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01716257,0.0009983549,0.002417193,0.003551179,0.001300445,0.002783694,0.004310063,0.002547147,0.003962069],"category_scores_gemma":[0.08765914,0.001583107,0.002047072,0.002462291,0.003130218,0.005906481,0.002114588,0.00444692,0.0005059825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003120077,"about_ca_system_score_gemma":0.004079552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01032638,"about_ca_topic_score_gemma":0.006812437,"domain_scores_codex":[0.9927146,0.004161903,0.0002571671,0.001218955,0.001177782,0.0004696875],"domain_scores_gemma":[0.899919,0.09096097,0.002217432,0.003659186,0.002373383,0.0008699406],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001555486,0.0002514012,0.002971433,0.0001778507,0.0002724469,0.0001027819,0.0001593509,0.5380539,0.0008070666,0.4096158,0.003396465,0.04403598],"study_design_scores_gemma":[0.00001422481,0.00001368445,0.0002342013,0.00001283449,0.00001459443,0.00001401371,0.000009541076,0.8035117,0.0001336724,0.1957906,0.000239334,0.00001147467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01297972,0.0003738861,0.9848608,0.000504287,0.00008980231,0.00003003028,0.0001347807,0.0003017553,0.0007249441],"genre_scores_gemma":[0.7794098,0.001986896,0.2076367,0.0007322055,0.001194755,0.0003636119,0.001339459,0.0003181431,0.007018368],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01716257,"threshold_uncertainty_score":0.09076548,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Mathematics; Random walk; Kernel (algebra); Applied mathematics; Statistical physics; Layered queueing network; Discrete mathematics; Statistics; Physics","authors":[{"name":"Yiqiang Q. Zhao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0212725477293827,"gpt":0.2648443889072882,"spread":0.2435718411779055,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003740947,0.0008431319,0.001034288,0.002614939,0.0006468882,0.002179401,0.002168376,0.001210364,0.003753311],"category_scores_gemma":[0.02130195,0.0005232168,0.001035398,0.001544187,0.001945803,0.004500593,0.002091993,0.003186481,0.0009723122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002127938,"about_ca_system_score_gemma":0.002038976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003773608,"about_ca_topic_score_gemma":0.001607973,"domain_scores_codex":[0.998812,0.0004799017,0.00005022983,0.0001179625,0.0003950128,0.0001449384],"domain_scores_gemma":[0.9917268,0.005305468,0.000363572,0.000625006,0.001663422,0.0003158335],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005923882,0.0001285732,0.0008981522,0.0001476891,0.0000631528,0.0001262912,0.0002886521,0.1153954,0.003218159,0.8529091,0.00284539,0.0239202],"study_design_scores_gemma":[0.000004201329,0.000009403431,0.0002256414,0.00001283689,0.000008176967,0.00004165783,0.00002232247,0.9106044,0.0002751725,0.08794775,0.0008357111,0.00001262525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0131418,0.0007737937,0.9806231,0.0003435749,0.0001057552,0.00003118519,0.00004459841,0.0002481597,0.004687986],"genre_scores_gemma":[0.8256388,0.002621449,0.147333,0.0004138166,0.0008675052,0.0002345794,0.0003208045,0.0005709722,0.02199906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003773608,"threshold_uncertainty_score":0.01978427,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1593254397","doi":"10.1023/a:1020993322286","title":"Exact Asymptotics for k i -limited Exponential Polling Models","year":2002,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Polling system; Queue; Class (philosophy); Polling; Heuristics; Mathematics; Exponential function; Applied mathematics; Computer science; Discrete mathematics; Combinatorics; Mathematical optimization; Mathematical analysis; Computer network","authors":[{"name":"Woojin Chang","is_ca":false},{"name":"Douglas G. Down","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1805786110144647,"gpt":0.3364654264797178,"spread":0.1558868154652531,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00686227,0.001398377,0.002316368,0.002878169,0.001422096,0.00359378,0.004990034,0.003255368,0.008099406],"category_scores_gemma":[0.04598431,0.001556282,0.001526604,0.002345577,0.004390685,0.008380351,0.004156501,0.004370539,0.001055985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00480307,"about_ca_system_score_gemma":0.002666451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008338578,"about_ca_topic_score_gemma":0.00641437,"domain_scores_codex":[0.9978337,0.0008282162,0.0001077317,0.0003078205,0.0005247195,0.0003978841],"domain_scores_gemma":[0.9756968,0.01831691,0.001722355,0.001816995,0.001681369,0.000765534],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001287752,0.0001256511,0.001389691,0.0002534711,0.00006406833,0.0001854229,0.000307629,0.3869283,0.001045199,0.5964632,0.003158796,0.00994985],"study_design_scores_gemma":[0.00001337667,0.000007710839,0.0002405686,0.0000366996,0.00001368462,0.00004575683,0.00003698119,0.8440221,0.0001873423,0.1549834,0.0003887226,0.00002362334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07590324,0.003364465,0.8975968,0.002051223,0.0002654403,0.0001052105,0.0003752476,0.0008245285,0.01951384],"genre_scores_gemma":[0.933382,0.002471815,0.04868926,0.0005566436,0.0004647621,0.0002745689,0.0005621673,0.000470226,0.01312861],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008338578,"threshold_uncertainty_score":0.0362916,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yaofei Xiong","is_ca":true},{"name":"Duncan J. Murdoch","is_ca":true},{"name":"David A. Stanford","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04313021580250813,"gpt":0.2520830480932877,"spread":0.2089528322907795,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01068387,0.000991019,0.002714826,0.001511183,0.00170418,0.004244321,0.004551052,0.002245147,0.00240992],"category_scores_gemma":[0.06860367,0.001681525,0.001225862,0.001527346,0.005592627,0.005901981,0.004474496,0.002478826,0.0003573554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002645022,"about_ca_system_score_gemma":0.003625606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005419289,"about_ca_topic_score_gemma":0.003235352,"domain_scores_codex":[0.9938705,0.00247165,0.0002692458,0.001001166,0.001158289,0.001229174],"domain_scores_gemma":[0.9494497,0.03158558,0.003480276,0.00819601,0.003564669,0.003723789],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001271782,0.0001881555,0.005912573,0.0001284646,0.0001329132,0.0002785226,0.0005117163,0.3788173,0.003199365,0.5958585,0.002562725,0.01113792],"study_design_scores_gemma":[0.00005802641,0.00004874836,0.0009991963,0.00001849557,0.0000224179,0.00007927247,0.00007369625,0.8006676,0.0007299246,0.1970251,0.0002435276,0.00003402405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4546785,0.000689331,0.5345583,0.001244455,0.0001592639,0.0001150004,0.0005971506,0.0006598172,0.007298253],"genre_scores_gemma":[0.9774122,0.000215254,0.01892297,0.0002025931,0.0001138742,0.00006824828,0.0002412228,0.00007737727,0.00274624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01068387,"threshold_uncertainty_score":0.05650234,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}