{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002250173,0.0001269412,0.0002199965,0.00007582099,0.001527711,0.0001173241,0.0001926034,0.0001905995,0.000163674],"category_scores_gemma":[0.0007565792,0.0000909292,0.00003618448,0.0004172119,0.00002148652,0.0003066048,0.00003111117,0.0006534503,0.0008268217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002390561,"about_ca_system_score_gemma":0.0002597221,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01599029,"about_ca_topic_score_gemma":0.0002328441,"domain_scores_codex":[0.9966106,0.001662494,0.0007965096,0.0002240867,0.0002196948,0.0004866386],"domain_scores_gemma":[0.9981746,0.0009287178,0.0002083999,0.0003398536,0.0002727955,0.00007561455],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002242084,0.0004348423,0.4359939,0.002513489,0.000087833,0.00003458839,0.1249107,0.09927485,0.006947679,0.292689,0.02632791,0.01076273],"study_design_scores_gemma":[0.0003712907,0.00002598784,0.01949132,0.0008421527,0.000007527522,0.000005678016,0.01484884,0.9598902,0.000004980472,0.0001519747,0.004146051,0.0002139449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.970984,0.0001493343,0.008287252,0.004972775,0.0006452932,0.002723138,0.00002039407,0.0001807815,0.012037],"genre_scores_gemma":[0.9970108,0.000003634222,0.0005909688,0.0002763205,0.0004475107,0.0005879305,0.00008628166,0.00001811115,0.000978439],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8606154,"threshold_uncertainty_score":0.9999511,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1587039046","doi":"10.1023/a:1010947911863","title":"Discrete Time Geo/G/1 Queue with Multiple Adaptive Vacations","year":2001,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":91,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Mathematics; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.01074630155693247,"gpt":0.2103868682623396,"spread":0.1996405667054071,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004226395,0.0002629131,0.0003441094,0.0002841669,0.0003939335,0.0002983753,0.0002986928,0.00007327776,0.0001296481],"category_scores_gemma":[0.0001375831,0.0002174192,0.0000912558,0.0008575774,0.0000751382,0.001398545,0.00008677187,0.0001603248,0.001403746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008217603,"about_ca_system_score_gemma":0.00002021037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002505404,"about_ca_topic_score_gemma":0.0003106893,"domain_scores_codex":[0.9985017,0.00004466887,0.0003425791,0.0004269317,0.0002924945,0.0003916687],"domain_scores_gemma":[0.9987606,0.0001432818,0.0003563658,0.0004916342,0.0002232793,0.00002483754],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008873951,0.0003599239,0.101788,0.0005201423,0.001205844,0.0003832717,0.0007622679,0.440336,0.004894066,0.4395098,0.005873119,0.003480161],"study_design_scores_gemma":[0.001469044,0.00005415412,0.003258229,0.0008080522,0.0004626533,0.000054025,0.002113206,0.8297257,0.00005940844,0.004351153,0.1563095,0.001334861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6024695,0.0007765549,0.2245319,0.001499013,0.0009694276,0.002073683,0.00002306994,0.002573604,0.1650832],"genre_scores_gemma":[0.990435,0.000003387434,0.0003586198,0.0002167772,0.001067209,0.00009064576,0.00004726926,0.00006492447,0.007716142],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4351586,"threshold_uncertainty_score":0.9993738,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009659465,0.000210531,0.0008017772,0.0007816128,0.0001978938,0.0002116816,0.0004703356,0.0001484846,0.00006349389],"category_scores_gemma":[0.0007258627,0.0001310322,0.0001811465,0.00142932,0.0001617895,0.0005228799,0.0001334399,0.0001638003,0.00003678435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004931655,"about_ca_system_score_gemma":0.00006501621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002161263,"about_ca_topic_score_gemma":0.001703051,"domain_scores_codex":[0.9958571,0.0004471469,0.00107251,0.000675004,0.001589649,0.0003585567],"domain_scores_gemma":[0.9957218,0.002295608,0.0004531961,0.0009188543,0.0003913254,0.000219177],"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.0001855477,0.00006198862,0.05950594,0.00003196536,0.0009417096,0.0000225953,0.004129821,0.9299724,0.0007644898,0.001603849,0.00008019572,0.002699509],"study_design_scores_gemma":[0.0003265017,0.00008956086,0.003650215,0.00006917518,0.0005467301,0.000008157737,0.0006115026,0.9902006,0.0002191325,0.00385653,0.0002040585,0.0002178338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7218581,0.001034858,0.275388,0.00001501469,0.00009205614,0.0002426198,0.0000751296,0.00003214968,0.001262103],"genre_scores_gemma":[0.9976362,0.00004782741,0.0007139993,0.00001542761,0.00004564,0.000009603632,0.000003490997,0.00001375726,0.001514047],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2757781,"threshold_uncertainty_score":0.5343337,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1593591280","doi":"10.1023/a:1019139405059","title":"An analytical solution for a tandem queue with blocking","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenvalues and eigenvectors; Mathematics; Simple (philosophy); Line (geometry); Poisson distribution; Applied mathematics; Combinatorics; Statistics; Physics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01689125562703021,"gpt":0.2540141036912759,"spread":0.2371228480642457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007188214,0.0002123374,0.0003312384,0.0002051899,0.0003806175,0.0004086899,0.0002298669,0.00008652206,0.0001132981],"category_scores_gemma":[0.00005519748,0.0001801376,0.00009309279,0.0005118741,0.00005539839,0.001200491,0.00001653981,0.0001085128,0.00009463153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007445413,"about_ca_system_score_gemma":0.00001859631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006972777,"about_ca_topic_score_gemma":0.0001536828,"domain_scores_codex":[0.9985689,0.00003218962,0.0003330899,0.000422141,0.0002440313,0.0003996633],"domain_scores_gemma":[0.9991872,0.00007129186,0.0001861603,0.0003743483,0.0001562688,0.00002478276],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009415651,0.0004561921,0.02407753,0.001069073,0.00066336,0.00009179632,0.000403624,0.4188848,0.002506127,0.5006118,0.001980124,0.04831405],"study_design_scores_gemma":[0.0005838054,0.00004142599,0.0002031304,0.0002397781,0.0002272296,0.00001028226,0.0002321971,0.9573215,0.00001820948,0.001926226,0.03882209,0.0003741481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7792865,0.0002003784,0.1990412,0.0004294695,0.0003393227,0.001014543,0.000004514309,0.0009936753,0.01869044],"genre_scores_gemma":[0.9961312,0.000001404644,0.0005315371,0.00026686,0.001653463,0.00007439367,0.00003072428,0.00005323429,0.001257167],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5384367,"threshold_uncertainty_score":0.7345797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131297116","doi":"10.1007/s11134-010-9201-2","title":"Dynamic control of a single-server system with abandonments","year":2010,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Markov decision process; Computer science; Scheduling (production processes); Abandonment (legal); Mathematical optimization; Markov chain; Operations research; Uniformization (probability theory); Counterexample; Markov process; Mathematics; Markov model; Statistics; Variable-order Markov model","retraction":null,"screen_n_in":null,"score":{"opus":0.005396278547896633,"gpt":0.1908203917151976,"spread":0.185424113167301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006032332,0.0002184192,0.0004640971,0.0002375983,0.0001244198,0.0001548421,0.0002857067,0.00008592958,0.00002333066],"category_scores_gemma":[0.00006674533,0.0001736693,0.00009784539,0.0003877991,0.00007750621,0.0006971805,0.00004687826,0.0001651188,0.00009361938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005444488,"about_ca_system_score_gemma":0.00001178014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008034549,"about_ca_topic_score_gemma":0.0002675802,"domain_scores_codex":[0.9985918,0.00002801535,0.0004395483,0.0003071075,0.0003507965,0.0002826648],"domain_scores_gemma":[0.9985947,0.00007608509,0.0006283962,0.0005012217,0.0001826991,0.00001690753],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008866144,0.0005249946,0.102314,0.006993052,0.001409131,0.000205103,0.0002870003,0.0679234,0.2738885,0.5439487,0.0001511942,0.001468418],"study_design_scores_gemma":[0.01031502,0.0001651376,0.00565334,0.004416114,0.001693369,0.0001347192,0.003704309,0.9506347,0.001174125,0.001078798,0.01872268,0.002307646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9627003,0.00008577137,0.02848393,0.00004174368,0.000778755,0.000442607,0.000004384232,0.0002885618,0.007173955],"genre_scores_gemma":[0.9990039,2.35103e-7,0.0001198459,0.00005566273,0.0002886179,0.00003727708,0.000008406717,0.00005077887,0.0004352078],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8827114,"threshold_uncertainty_score":0.7082028,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053028813","doi":"10.1023/b:ques.0000018028.16682.ef","title":"Vacation models in discrete time","year":2003,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Discrete time and continuous time; Computer science; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01263388078204098,"gpt":0.2199847940193971,"spread":0.2073509132373561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007916001,0.0001351124,0.0002178947,0.0002846032,0.00009126907,0.0001688497,0.0001435798,0.00005650164,0.00005576794],"category_scores_gemma":[0.0001377222,0.0001306377,0.00005404009,0.0005743548,0.00001747249,0.001404652,0.00002825487,0.00009292954,0.0005542071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006567127,"about_ca_system_score_gemma":0.000009390238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005492769,"about_ca_topic_score_gemma":0.00002636826,"domain_scores_codex":[0.9989877,0.00005126618,0.0003082361,0.0002538917,0.0001661994,0.000232699],"domain_scores_gemma":[0.9994267,0.00004569942,0.0001874254,0.0002727919,0.00005926876,0.000008163518],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008397586,0.00002067667,0.001548246,0.0001072276,0.00001836894,0.000008258176,0.00005771363,0.2586673,0.0007263141,0.7384265,0.0002232155,0.000187765],"study_design_scores_gemma":[0.0004243734,0.000003712521,0.0001440397,0.0002727248,0.00004933827,0.000003384445,0.0003608809,0.8826293,0.00005886431,0.09497189,0.02065874,0.000422783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5649545,0.0008340568,0.08762646,0.0003297986,0.001009034,0.0009098543,0.000002229182,0.0007175365,0.3436165],"genre_scores_gemma":[0.9963384,0.000001828974,0.0001185355,0.0001247678,0.0002452715,0.00003131869,0.00001130453,0.00002866325,0.003099856],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6434546,"threshold_uncertainty_score":0.7123396,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072709938","doi":"10.1023/a:1026097723093","title":"Analysis of Queueing Systems with Synchronous Single Vacation for Some Servers","year":2003,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Western Washington University","keywords":"Server; Idle; Computer science; Computer network; Queueing theory; Queue; Real-time computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01369276134957893,"gpt":0.2204369974851817,"spread":0.2067442361356028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001304617,0.0003197615,0.0008762332,0.001104024,0.000277606,0.0003319876,0.0002854766,0.000103022,0.00001594561],"category_scores_gemma":[0.0002631142,0.0002900088,0.0002768148,0.002209158,0.00006329858,0.001512725,0.00003360945,0.0001008375,0.00001881369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002126345,"about_ca_system_score_gemma":0.00004020904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002197997,"about_ca_topic_score_gemma":0.0001738057,"domain_scores_codex":[0.9977649,0.00009393733,0.0007672028,0.0005381553,0.00039419,0.0004415892],"domain_scores_gemma":[0.9975426,0.0002446063,0.001135652,0.0006121122,0.0004386239,0.00002637566],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006980544,0.0001186052,0.01270494,0.001599103,0.002225026,0.000008028247,0.0001336915,0.7086679,0.001919597,0.2722912,0.00007151395,0.0001905473],"study_design_scores_gemma":[0.00211502,0.0001565105,0.0008011677,0.001661315,0.01161758,0.00001488312,0.007473809,0.9486029,0.0009674068,0.001892357,0.02296972,0.001727393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8369384,0.001630047,0.1529504,0.00006653436,0.001085042,0.001522208,0.00001806246,0.0004649935,0.005324315],"genre_scores_gemma":[0.9984664,0.00000350422,0.0002571426,0.00006493098,0.0003923736,0.0001379875,0.0000724828,0.00007078686,0.0005343548],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2703989,"threshold_uncertainty_score":0.9999552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01263388078204098,"gpt":0.2199847940193971,"spread":0.2073509132373561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007916001,0.0001351124,0.0002178947,0.0002846032,0.00009126907,0.0001688497,0.0001435798,0.00005650164,0.00005576794],"category_scores_gemma":[0.0001377222,0.0001306377,0.00005404009,0.0005743548,0.00001747249,0.001404652,0.00002825487,0.00009292954,0.0005542071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006567127,"about_ca_system_score_gemma":0.000009390238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005492769,"about_ca_topic_score_gemma":0.00002636826,"domain_scores_codex":[0.9989877,0.00005126618,0.0003082361,0.0002538917,0.0001661994,0.000232699],"domain_scores_gemma":[0.9994267,0.00004569942,0.0001874254,0.0002727919,0.00005926876,0.000008163518],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008397586,0.00002067667,0.001548246,0.0001072276,0.00001836894,0.000008258176,0.00005771363,0.2586673,0.0007263141,0.7384265,0.0002232155,0.000187765],"study_design_scores_gemma":[0.0004243734,0.000003712521,0.0001440397,0.0002727248,0.00004933827,0.000003384445,0.0003608809,0.8826293,0.00005886431,0.09497189,0.02065874,0.000422783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5649545,0.0008340568,0.08762646,0.0003297986,0.001009034,0.0009098543,0.000002229182,0.0007175365,0.3436165],"genre_scores_gemma":[0.9963384,0.000001828974,0.0001185355,0.0001247678,0.0002452715,0.00003131869,0.00001130453,0.00002866325,0.003099856],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6434546,"threshold_uncertainty_score":0.7123396,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003945309,0.0002629425,0.0003474008,0.0003294882,0.0002695903,0.0003154653,0.0002686417,0.00007059353,0.00004006372],"category_scores_gemma":[0.0000795809,0.0002134738,0.00008463802,0.0006988095,0.0001048163,0.001269285,0.00006945068,0.0001797011,0.001161353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000159423,"about_ca_system_score_gemma":0.00003693721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003785253,"about_ca_topic_score_gemma":0.0002945076,"domain_scores_codex":[0.9985585,0.00002371071,0.0003025035,0.000402847,0.000324995,0.0003874935],"domain_scores_gemma":[0.9990204,0.0000563198,0.0003393587,0.0003788115,0.0001833942,0.00002171456],"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.0001463585,0.00008546024,0.001999698,0.0005247716,0.0002792213,0.0001844091,0.0004793323,0.3326881,0.0006242833,0.6619358,0.0004875752,0.0005649464],"study_design_scores_gemma":[0.01926539,0.0003837987,0.002193312,0.01001375,0.002587296,0.0002560619,0.04442457,0.07298601,0.002805791,0.1775802,0.658008,0.009495818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7662004,0.0007618595,0.06019986,0.00280523,0.002550484,0.002003757,0.000008939257,0.002804592,0.1626648],"genre_scores_gemma":[0.9968138,0.000001549714,0.0003917739,0.0004950807,0.0009538984,0.00005785848,0.00001024867,0.00006091918,0.001214817],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6575205,"threshold_uncertainty_score":0.9996164,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002503558,0.0004408479,0.000690084,0.0005564409,0.0003007141,0.001262751,0.0006114658,0.000138972,0.0000240694],"category_scores_gemma":[0.0004249979,0.0004138529,0.0001515317,0.0008278385,0.00007098423,0.002098457,0.0002692795,0.0002973392,0.001877784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003173393,"about_ca_system_score_gemma":0.00006643521,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01021066,"about_ca_topic_score_gemma":0.0001683755,"domain_scores_codex":[0.9967213,0.0001358521,0.0008767207,0.0006753908,0.0008672703,0.000723443],"domain_scores_gemma":[0.9977453,0.0001180463,0.0007390017,0.0007993234,0.0005157034,0.00008263084],"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.0001762206,0.0001688604,0.01633414,0.00154748,0.0004599756,0.0004365387,0.000742446,0.6963108,0.001355632,0.2705672,0.01041789,0.001482832],"study_design_scores_gemma":[0.002911079,0.00006460716,0.0002197034,0.001845475,0.000499891,0.0001110608,0.01340864,0.5840249,0.0001598834,0.01299491,0.3810559,0.00270393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7945815,0.006216415,0.05229669,0.000534308,0.01467056,0.002219057,0.00001857662,0.003913681,0.1255492],"genre_scores_gemma":[0.9897219,0.000006073378,0.00006127304,0.000241454,0.002755901,0.00009709143,0.00002491098,0.0001235983,0.006967794],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.370638,"threshold_uncertainty_score":0.9998313,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001193834,0.0003035482,0.0006052381,0.0002115703,0.0003536262,0.0002337187,0.0006271396,0.000142138,0.0006518178],"category_scores_gemma":[0.00034786,0.0002011433,0.000236299,0.00131537,0.0001926897,0.0008023147,0.0001037028,0.0002711118,0.0002682163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007635121,"about_ca_system_score_gemma":0.00005078405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003159632,"about_ca_topic_score_gemma":0.0001693123,"domain_scores_codex":[0.9977441,0.0001479161,0.0006585183,0.0004338661,0.0006260227,0.0003895168],"domain_scores_gemma":[0.9981818,0.0001865095,0.0006562715,0.0007612254,0.000193761,0.00002048204],"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.01083278,0.0009497891,0.05946642,0.003622868,0.002772989,0.0001772687,0.001558653,0.3304301,0.01389004,0.521991,0.03290736,0.0214008],"study_design_scores_gemma":[0.02425349,0.0003893981,0.005726566,0.008988244,0.00451972,0.0001195195,0.003438244,0.2655523,0.008001064,0.02891855,0.6440765,0.00601633],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9389156,0.0003094285,0.0008265403,0.0004029294,0.001622745,0.0008706885,0.00001037736,0.0003481957,0.05669351],"genre_scores_gemma":[0.9911523,0.000005016667,0.00004532266,0.0001861304,0.003301643,0.00002143276,0.0000100201,0.00005408189,0.005224095],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6111692,"threshold_uncertainty_score":0.8202387,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005321685,0.0001098527,0.0002041076,0.00002365084,0.0001275869,0.00002591286,0.0001110624,0.00005908433,0.000001158146],"category_scores_gemma":[0.001817864,0.00007767785,0.00005221726,0.0001204132,0.00002050362,0.00006248827,0.00001034683,0.00006994108,8.663804e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006020701,"about_ca_system_score_gemma":0.0000626516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008586861,"about_ca_topic_score_gemma":0.000001377605,"domain_scores_codex":[0.9990087,0.00002818687,0.0003731136,0.0001698909,0.0002454014,0.0001747048],"domain_scores_gemma":[0.9985447,0.0007116313,0.0002166282,0.0002231555,0.0002702209,0.00003368524],"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.0000609037,0.00008027499,0.000001830315,0.0005258544,0.00002852187,4.610951e-7,0.0003261568,0.006648373,0.0004203096,0.9858716,0.00234037,0.003695323],"study_design_scores_gemma":[0.000156584,0.0001282586,0.00002024666,0.0001645424,0.00005733212,0.000008929627,0.000223047,0.7602237,0.0001692989,0.2386773,0.00008767048,0.00008301198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004098078,0.0002073799,0.993752,0.0004907918,0.0003212425,0.0008499914,0.0001400654,0.00005225905,0.00008818442],"genre_scores_gemma":[0.9887297,0.00001128547,0.01059231,0.00001894646,0.0001617869,0.00008233647,0.00003134738,0.00001333105,0.0003589262],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9846317,"threshold_uncertainty_score":0.3167611,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002212837,0.0004310375,0.0007219244,0.0004329363,0.0004365287,0.0003570977,0.0005263879,0.0001539788,0.00004827352],"category_scores_gemma":[0.000325078,0.0004102552,0.0002962858,0.0005412172,0.00005608492,0.001323718,0.0001821853,0.0001855423,0.0001092379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009959087,"about_ca_system_score_gemma":0.00003546257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001644627,"about_ca_topic_score_gemma":0.0001019641,"domain_scores_codex":[0.9974356,0.00009924507,0.000783496,0.00068289,0.0003322779,0.0006664845],"domain_scores_gemma":[0.9980648,0.0001784814,0.0006930417,0.0006596693,0.0003634505,0.00004061546],"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.0001612717,0.00008114017,0.001029225,0.0007688865,0.0002997666,0.00001737748,0.0005461139,0.3307405,0.003041597,0.6615629,0.000850015,0.0009012583],"study_design_scores_gemma":[0.001086793,0.00001175348,0.00001297311,0.0002031405,0.0004525441,0.000006223562,0.0003910212,0.9426727,0.0004313683,0.05061946,0.003547815,0.0005641531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05360745,0.0003617331,0.9288614,0.00007401353,0.0007846894,0.0008194753,0.000006955144,0.0006201706,0.01486412],"genre_scores_gemma":[0.9378479,0.000006129183,0.05589198,0.0006459499,0.001737603,0.0002359545,0.00003109007,0.0001648099,0.003438654],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8842404,"threshold_uncertainty_score":0.999835,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001948977,0.0001821813,0.0002580645,0.0001172945,0.0006489746,0.0002335651,0.0003547924,0.00004783149,0.000004360794],"category_scores_gemma":[0.0002027394,0.0001186694,0.0000662849,0.000939923,0.00004688854,0.0004037342,0.00008130421,0.0001441577,0.000007617747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008238089,"about_ca_system_score_gemma":0.000008903936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007478579,"about_ca_topic_score_gemma":0.0003015791,"domain_scores_codex":[0.9984144,0.0001382656,0.0005536969,0.0003212929,0.0002362421,0.000336124],"domain_scores_gemma":[0.9973913,0.001480712,0.0004272829,0.0004360444,0.0002476772,0.00001699477],"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.00004140851,0.00004207907,0.001641405,0.0000718941,0.00005182892,7.965901e-7,0.0001981167,0.9302192,0.00003128257,0.05689097,0.00009450288,0.01071647],"study_design_scores_gemma":[0.0002720478,0.00002265669,0.0007345135,0.0001539727,0.00007272627,0.000001484335,0.001197508,0.9842708,0.000007140546,0.001009723,0.01208926,0.0001681826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02724216,0.0002405298,0.9702219,0.0005060765,0.0000831334,0.001434137,0.00001343829,0.00007526437,0.000183356],"genre_scores_gemma":[0.9952402,0.000005553255,0.003225354,0.000283416,0.0005248824,0.000469282,0.0001219205,0.0000330446,0.00009632846],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9679981,"threshold_uncertainty_score":0.4991453,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008773605,0.000278632,0.000407025,0.0002310942,0.0004445848,0.0005555142,0.0003131278,0.0001086,0.00001125644],"category_scores_gemma":[0.0001620288,0.0002768774,0.0002088424,0.0004291533,0.00003536108,0.001173197,0.00008547274,0.0001142483,0.0001428052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001209266,"about_ca_system_score_gemma":0.00001412935,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005490124,"about_ca_topic_score_gemma":0.0003734268,"domain_scores_codex":[0.9982184,0.0000333463,0.0005613936,0.0004640192,0.0002134849,0.00050939],"domain_scores_gemma":[0.9987811,0.0001323141,0.000510237,0.0003736092,0.0001888813,0.00001383156],"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.00007562778,0.000109982,0.009073325,0.0005290064,0.0001359843,0.00001868485,0.00004794224,0.5640516,0.005119284,0.4187878,0.001770517,0.0002803161],"study_design_scores_gemma":[0.001980497,0.00001080151,0.0005627641,0.0003371198,0.0001909617,0.000004845189,0.001022603,0.9451445,0.00008221364,0.00602767,0.04385804,0.0007779869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3058409,0.0007186896,0.6791576,0.0005823648,0.002252152,0.001949923,0.0000141065,0.001530679,0.007953521],"genre_scores_gemma":[0.9903556,7.9287e-7,0.003293663,0.0001814997,0.001997147,0.0001193631,0.00007564366,0.00007644896,0.003899806],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6845147,"threshold_uncertainty_score":0.9999683,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005858889,0.0002824457,0.0004758479,0.0002510028,0.0001912325,0.0001775529,0.0002779443,0.00006794597,0.0006793988],"category_scores_gemma":[0.00007903421,0.0002236611,0.00006997352,0.001194988,0.00007736452,0.0006682436,0.00004342577,0.0001772812,0.0004456521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004235041,"about_ca_system_score_gemma":0.00001578884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001123236,"about_ca_topic_score_gemma":0.00003807258,"domain_scores_codex":[0.9982476,0.00005009699,0.0005256812,0.000407866,0.0004070776,0.000361654],"domain_scores_gemma":[0.9986561,0.000113051,0.000452226,0.0005097006,0.00025278,0.00001614874],"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.0003655392,0.0002269808,0.003371047,0.001373739,0.0003732255,0.00005546443,0.0002116042,0.396164,0.0006226316,0.5869414,0.002910846,0.00738347],"study_design_scores_gemma":[0.01177584,0.000332068,0.0006381035,0.009979746,0.001602631,0.00005857724,0.003320688,0.2966322,0.0006927369,0.09891631,0.5707058,0.005345228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5921839,0.0003386611,0.009645846,0.0005267537,0.000876109,0.001121888,0.00001579696,0.0009492827,0.3943417],"genre_scores_gemma":[0.987588,0.000001485218,0.001312484,0.0003993842,0.0007989181,0.00004482481,0.00004642943,0.00008436656,0.009724061],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.567795,"threshold_uncertainty_score":0.9120636,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001476376,0.000172635,0.0002370009,0.0002923399,0.0003016513,0.000412827,0.0004176697,0.00005857148,0.0000262367],"category_scores_gemma":[0.0002185836,0.0001322927,0.00008699129,0.0009442322,0.00004578572,0.0009648224,0.00006444028,0.0001918606,0.0007543574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009301431,"about_ca_system_score_gemma":0.00001683916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002141599,"about_ca_topic_score_gemma":0.0001761341,"domain_scores_codex":[0.9986647,0.00006012665,0.0004072041,0.0002710448,0.0002839881,0.0003129749],"domain_scores_gemma":[0.9991457,0.0001182058,0.0002591236,0.0003947211,0.00007443642,0.00000777414],"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.000005883907,0.00005473334,0.0003865913,0.0001419429,0.00002546982,0.00002799503,0.0007951144,0.1351948,0.0007060855,0.8621596,0.0001374909,0.0003642207],"study_design_scores_gemma":[0.002548696,0.00002490304,0.0007732902,0.002099357,0.0003288305,0.00007327303,0.02017294,0.7420988,0.0001746684,0.1813041,0.04868202,0.001719091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8594115,0.0004238472,0.0189253,0.003209682,0.000572695,0.001179124,0.000003076478,0.0007580983,0.1155167],"genre_scores_gemma":[0.9979682,7.530515e-7,0.0001339662,0.0005726925,0.0008888788,0.00006730729,0.00001891388,0.00003013222,0.000319164],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6808555,"threshold_uncertainty_score":0.9695989,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005461684,0.0001706083,0.0003194861,0.0002205355,0.0001364638,0.0001084801,0.0003606653,0.00008096303,0.000006975839],"category_scores_gemma":[0.0002842365,0.0001358258,0.0001099772,0.0008650222,0.00004942424,0.000838373,0.00008542403,0.000174938,0.0000153206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000823505,"about_ca_system_score_gemma":0.00003707071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003701249,"about_ca_topic_score_gemma":0.00009175715,"domain_scores_codex":[0.9987161,0.00005731074,0.0004816202,0.0002504656,0.0002572013,0.0002373676],"domain_scores_gemma":[0.9988155,0.00005615758,0.0004988278,0.000457965,0.0001620566,0.000009465499],"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.00004598803,0.0002165185,0.02991734,0.0002808252,0.00005525478,0.00000552093,0.0006791026,0.5879827,0.01055217,0.3693383,0.00009311261,0.0008332034],"study_design_scores_gemma":[0.0003966716,0.00001018415,0.0187152,0.0006117249,0.00009819959,0.000001702341,0.0003878478,0.9623126,0.0002094392,0.01624024,0.0006986643,0.000317487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.966301,0.00008770175,0.02315903,0.0004751335,0.0003220031,0.0006014152,0.000007116113,0.0001399699,0.008906599],"genre_scores_gemma":[0.9987896,0.000003263846,0.0001199088,0.0002273778,0.0002309025,0.00001239558,0.000007670795,0.00001829445,0.0005905617],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.37433,"threshold_uncertainty_score":0.5538816,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004527008,0.0001381255,0.0001875476,0.0001193615,0.0006579189,0.0001408332,0.0002684905,0.00005497969,0.00002986398],"category_scores_gemma":[0.0002394493,0.00009820351,0.0001088493,0.000413541,0.00005786755,0.0005179883,0.00006069814,0.0000988156,0.0002610284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003676558,"about_ca_system_score_gemma":0.00001401778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003711297,"about_ca_topic_score_gemma":0.00003558574,"domain_scores_codex":[0.9990649,0.00001937866,0.0002732236,0.0002153541,0.0001871292,0.0002400367],"domain_scores_gemma":[0.9990028,0.0001779065,0.0002071512,0.0003596785,0.0002432276,0.000009204725],"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.0001644489,0.0002326812,0.0138977,0.001157205,0.0005568159,0.00002715534,0.0008265654,0.07993958,0.001000401,0.824743,0.07551667,0.00193773],"study_design_scores_gemma":[0.0005235324,0.000008913588,0.0003847664,0.0001202584,0.0001267232,0.00001742125,0.000494984,0.2472142,0.00002161036,0.002437672,0.7483267,0.0003232305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2690139,0.003304064,0.6153734,0.006266903,0.01092595,0.005695692,0.00004585358,0.002398893,0.08697537],"genre_scores_gemma":[0.9914179,0.000009429678,0.00024343,0.000503517,0.001658267,0.0001044042,0.00003147764,0.00003628031,0.005995302],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8223054,"threshold_uncertainty_score":0.5060247,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002112754,0.0003028298,0.0003181483,0.0001643854,0.0005879584,0.0006848109,0.0005682861,0.00007927287,0.00007196237],"category_scores_gemma":[0.000181137,0.0001514068,0.00005205305,0.001014928,0.00009651595,0.001163966,0.00002535952,0.0001844419,0.00002243099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003631989,"about_ca_system_score_gemma":0.0000437177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003214767,"about_ca_topic_score_gemma":0.0008028689,"domain_scores_codex":[0.9983189,0.0001528094,0.0003897907,0.0004266266,0.0003251128,0.000386721],"domain_scores_gemma":[0.9981417,0.0009414908,0.0002819251,0.0003882737,0.0002316143,0.00001500558],"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.01205388,0.0007096169,0.03445306,0.01996089,0.001260126,0.0001295257,0.02939853,0.4339736,0.0001902687,0.4049332,0.000670847,0.06226654],"study_design_scores_gemma":[0.003349412,0.0001337142,0.003537256,0.003235812,0.001124313,0.0001149356,0.07578182,0.8276445,0.0001172716,0.06857372,0.01464896,0.001738307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9762255,0.001047006,0.003249717,0.004148191,0.0002238316,0.003237167,0.000006697101,0.0003128959,0.01154898],"genre_scores_gemma":[0.9954437,0.00001304376,0.00002218552,0.001519085,0.0006575105,0.0005639222,0.00001842644,0.00005678991,0.001705352],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3936709,"threshold_uncertainty_score":0.6603647,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003434542,0.000197213,0.0003757052,0.0003293951,0.0001175807,0.00009915223,0.0002382281,0.00004429554,0.0001209226],"category_scores_gemma":[0.00003642795,0.0001619999,0.00009789649,0.0007255475,0.0001030903,0.0008003089,0.00002339047,0.0001086928,0.0001708159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003359198,"about_ca_system_score_gemma":0.000004708771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001514292,"about_ca_topic_score_gemma":0.00009772457,"domain_scores_codex":[0.9987718,0.00002918409,0.0003523645,0.0002715188,0.0002994458,0.0002756753],"domain_scores_gemma":[0.9992135,0.00005890604,0.0002474527,0.0003307544,0.0001348361,0.00001450742],"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.000232448,0.0003045806,0.01529662,0.002508195,0.0008528004,0.0001307893,0.00127569,0.3352849,0.008208753,0.6244211,0.002076018,0.009408089],"study_design_scores_gemma":[0.00765389,0.0002735747,0.0004453273,0.004071372,0.002050904,0.00007430663,0.01531128,0.8164186,0.002749055,0.004208098,0.1430156,0.003727962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8336644,0.0008226894,0.004248532,0.0003031011,0.000544193,0.0005194369,0.000004534442,0.0005819183,0.1593112],"genre_scores_gemma":[0.9982246,0.000008153886,0.00007762715,0.000124482,0.0004014201,0.00001902472,0.000004075672,0.00004414091,0.001096549],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.620213,"threshold_uncertainty_score":0.6606164,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000493651,0.0001830445,0.000249609,0.0001989828,0.000201207,0.0003578839,0.0002097923,0.00007596654,0.0001453797],"category_scores_gemma":[0.0001611246,0.0001764798,0.00009107177,0.0003009419,0.00001594385,0.001771073,0.00006806108,0.000173315,0.0006349364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009938228,"about_ca_system_score_gemma":0.000005667404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002030175,"about_ca_topic_score_gemma":0.0002669774,"domain_scores_codex":[0.9988159,0.00002961231,0.0003655114,0.0003011382,0.0002115748,0.000276289],"domain_scores_gemma":[0.9991913,0.0001185371,0.0002962544,0.0002883659,0.00009131865,0.00001417886],"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.0003954691,0.00048772,0.02342242,0.002154608,0.0008546382,0.00007501247,0.001993611,0.1612109,0.06346945,0.3379441,0.3055498,0.1024422],"study_design_scores_gemma":[0.0005067924,0.00001473234,0.00003366929,0.0005017326,0.0001177876,0.00001001971,0.001877528,0.2229138,0.002328789,0.001097209,0.769982,0.0006159376],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8417748,0.001445631,0.03392937,0.003216994,0.003144404,0.0005632272,0.000003525305,0.001709755,0.1142123],"genre_scores_gemma":[0.9935971,0.000005402646,0.00007870829,0.00128235,0.002685889,0.00002081455,0.00001823302,0.00003538174,0.002276089],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4644322,"threshold_uncertainty_score":0.8161035,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008793173,0.000233392,0.0003767577,0.0004880757,0.0001885923,0.0002719197,0.000365947,0.00007683691,0.0003538723],"category_scores_gemma":[0.00009562288,0.0002313847,0.0001765999,0.000947629,0.00004267864,0.001125479,0.0000693782,0.0001953543,0.0007537627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001388114,"about_ca_system_score_gemma":0.00002024992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001071555,"about_ca_topic_score_gemma":0.000366578,"domain_scores_codex":[0.9983513,0.00003932951,0.0005475363,0.0004272473,0.0002506224,0.0003839754],"domain_scores_gemma":[0.9991931,0.00006044655,0.0001786402,0.0004340476,0.0001094753,0.00002423355],"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.0001743683,0.0001742684,0.03407629,0.001029848,0.00003943347,0.00002189756,0.0001906548,0.9497208,0.0000986083,0.01044431,0.0002314313,0.003798077],"study_design_scores_gemma":[0.00199081,0.00009370391,0.01948111,0.007169394,0.0002060247,0.000004822241,0.0008537736,0.9400949,0.0002043444,0.001507601,0.02695109,0.001442358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9741035,0.0001995576,0.002355896,0.00024748,0.0002995334,0.0006417576,0.000003012183,0.0003157113,0.02183354],"genre_scores_gemma":[0.9965197,0.000005445033,0.0004064432,0.000314445,0.0004228898,0.0001410934,0.00001473717,0.00003722366,0.002138039],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02671966,"threshold_uncertainty_score":0.9688345,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007092941,0.0001892893,0.0002929686,0.0001287705,0.0006542312,0.0002349776,0.0001746761,0.00008723987,0.00003352955],"category_scores_gemma":[0.0000707231,0.0001433181,0.00008361965,0.0005367735,0.00009267295,0.0008061915,0.00007245713,0.0001155589,0.000007842725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004228054,"about_ca_system_score_gemma":0.00001292341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001090871,"about_ca_topic_score_gemma":0.0003114357,"domain_scores_codex":[0.9987304,0.00005395081,0.0004692663,0.0003015047,0.0002059239,0.0002389469],"domain_scores_gemma":[0.9985803,0.0004708706,0.0004125035,0.0002862875,0.0002350893,0.00001497132],"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.0001129364,0.0001489729,0.001655475,0.001074758,0.0001201917,0.000001222189,0.000493885,0.9052469,0.001437309,0.08742172,0.0001369834,0.002149639],"study_design_scores_gemma":[0.0005522147,0.000008936942,0.002737514,0.0003445136,0.0002157761,0.000002660765,0.001951752,0.9901547,0.00001992221,0.002620382,0.001207196,0.0001843719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8515635,0.0003882754,0.1455385,0.0007257587,0.0002673284,0.0009670195,0.00001339659,0.0001374043,0.0003988447],"genre_scores_gemma":[0.9985732,0.00001960511,0.0001205608,0.0002346118,0.0005630765,0.0001456823,0.0001154986,0.0000287155,0.0001990105],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1470098,"threshold_uncertainty_score":0.5844343,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001285967,0.0002791592,0.0004555091,0.0002830253,0.0002273589,0.0001297607,0.0002949199,0.00009911923,0.000006759178],"category_scores_gemma":[0.0001640969,0.0001982986,0.0001043654,0.001047536,0.00007794467,0.0007631573,0.00002047988,0.0002830429,0.00003899777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002731571,"about_ca_system_score_gemma":0.00003978754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002107825,"about_ca_topic_score_gemma":0.0002724189,"domain_scores_codex":[0.9980339,0.000158538,0.0006183689,0.0003891684,0.000450487,0.0003494799],"domain_scores_gemma":[0.9986672,0.0002864891,0.0004078911,0.0004115162,0.0002098635,0.00001701341],"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.0002822358,0.0001909165,0.002519827,0.0006964305,0.00008225551,0.00004526955,0.000385854,0.1678277,0.0008249626,0.8261304,0.00009850578,0.0009157241],"study_design_scores_gemma":[0.003943341,0.0002169043,0.0169068,0.00735933,0.0003767845,0.00002472474,0.01667798,0.9472335,0.0004898479,0.001993163,0.003288531,0.001489122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.956911,0.0001178935,0.03707403,0.0005321639,0.0002365832,0.0009757019,0.00002047362,0.0002712614,0.003860902],"genre_scores_gemma":[0.999442,0.000002928054,0.00003504994,0.0001419624,0.0001516558,0.00004807631,0.00004651808,0.00002867004,0.0001031651],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8241372,"threshold_uncertainty_score":0.808638,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001175385,0.0002747126,0.0004371015,0.0002552638,0.0003730675,0.0003324244,0.0003251523,0.00009653356,0.00001821695],"category_scores_gemma":[0.0002497278,0.0002570882,0.0002057586,0.0002681747,0.00003820112,0.0008179454,0.00004167498,0.0001143196,0.0001204794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004784162,"about_ca_system_score_gemma":0.00001811322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003616482,"about_ca_topic_score_gemma":0.0001177406,"domain_scores_codex":[0.998336,0.00003616025,0.0004885443,0.0004508513,0.0002202961,0.000468159],"domain_scores_gemma":[0.9988416,0.000244709,0.0003485064,0.0003758568,0.0001637896,0.00002548494],"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.00008648923,0.00004313119,0.001098901,0.001025741,0.0001084947,0.000004187083,0.0001607569,0.3703773,0.002136335,0.6219305,0.001209974,0.0018182],"study_design_scores_gemma":[0.0004501649,0.000006773828,0.000007684526,0.0003152152,0.0001618194,0.000002587373,0.000130854,0.9768594,0.00006790373,0.01146861,0.01018334,0.0003456415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.136076,0.0001935279,0.8491479,0.0003753277,0.000566842,0.0007323597,0.00001470766,0.0007496458,0.01214365],"genre_scores_gemma":[0.9946321,0.000001842223,0.0009522913,0.0005439486,0.001843574,0.0001498801,0.00005120713,0.00007876183,0.001746398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.858556,"threshold_uncertainty_score":0.9999881,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009725913,0.0001700849,0.0002851954,0.0001412967,0.0005276969,0.000183322,0.0003001774,0.00008161585,0.00001345561],"category_scores_gemma":[0.0003519977,0.0001303291,0.0001435219,0.0005405404,0.00009442004,0.0007768897,0.00008443515,0.0001236375,0.00001293606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000539888,"about_ca_system_score_gemma":0.00001184697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001231326,"about_ca_topic_score_gemma":0.0001073435,"domain_scores_codex":[0.9987117,0.00004318506,0.0004813687,0.0002686561,0.0002217792,0.0002732983],"domain_scores_gemma":[0.9982268,0.000489643,0.0005952582,0.0004012391,0.0002756196,0.00001149324],"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.000138403,0.0001706476,0.02887612,0.0007393374,0.0002220111,0.000005239411,0.0002822589,0.4044761,0.002671796,0.5551132,0.0003912227,0.00691365],"study_design_scores_gemma":[0.0003971303,0.000007376834,0.0019141,0.0002411419,0.0001605153,0.000004133401,0.0007220895,0.9883818,0.00002318575,0.002935832,0.005029975,0.0001827033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.373621,0.0004269778,0.6223381,0.000220275,0.0006619134,0.001105273,0.000004146854,0.0002081645,0.001414204],"genre_scores_gemma":[0.9978889,0.00001869748,0.0004456777,0.00009377755,0.0009863565,0.0001378966,0.00003597295,0.00002915276,0.0003635565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6242679,"threshold_uncertainty_score":0.5314665,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007775599,0.0001163353,0.0003929902,0.0003929865,0.00003905251,0.00002612083,0.0001230705,0.00006815462,0.0000123876],"category_scores_gemma":[0.0001236842,0.0001196348,0.00008968599,0.0005882075,0.00005681546,0.0005770616,0.00001154534,0.00007678709,0.000007334745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003831847,"about_ca_system_score_gemma":0.0000170853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006598897,"about_ca_topic_score_gemma":0.0005667616,"domain_scores_codex":[0.9987124,0.00003892608,0.0007016142,0.0001760187,0.0002024865,0.0001685132],"domain_scores_gemma":[0.9988939,0.0001687619,0.0005793922,0.0002018987,0.0001512722,0.000004754325],"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.0000741113,0.00009668136,0.0720748,0.0005891569,0.00004682179,0.000007951303,0.00005954298,0.4250384,0.03697621,0.4647597,0.0000186925,0.000257881],"study_design_scores_gemma":[0.00267888,0.0000224988,0.02521485,0.00165126,0.0003917316,0.000002162401,0.0007313759,0.9439033,0.000614121,0.02264548,0.001646746,0.0004976284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9228112,0.0002231595,0.06971041,0.000098078,0.0002117371,0.0003042335,0.000005429466,0.00007368041,0.006562098],"genre_scores_gemma":[0.9994957,5.673975e-7,0.00006160974,0.0000198383,0.0002449511,0.00001486603,0.00002325609,0.00001870218,0.0001205498],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5188649,"threshold_uncertainty_score":0.9975603,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002135915,0.0002759528,0.0002827642,0.0002147797,0.0006179611,0.000624361,0.0004137917,0.00008001389,0.00001789651],"category_scores_gemma":[0.0003468769,0.0001424954,0.00004707807,0.001219727,0.00007582793,0.001201199,0.00003046524,0.0001866613,0.00001023557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005181994,"about_ca_system_score_gemma":0.00004018013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000452536,"about_ca_topic_score_gemma":0.001749842,"domain_scores_codex":[0.9984479,0.0001486885,0.0003592208,0.0003975882,0.0003019938,0.0003446191],"domain_scores_gemma":[0.9979327,0.001017602,0.000386321,0.0003208432,0.0003291226,0.00001342913],"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.01509377,0.0008152085,0.1270552,0.0137357,0.00120762,0.0001567617,0.02624436,0.5278677,0.0004153503,0.2417833,0.001267509,0.04435753],"study_design_scores_gemma":[0.001567225,0.00008295802,0.002912936,0.001642955,0.0005720127,0.0001435993,0.07093344,0.895857,0.00007689187,0.01973144,0.005658735,0.0008208126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9560931,0.0008668717,0.02547433,0.003880991,0.001081981,0.003751752,0.000003417191,0.000414548,0.008432957],"genre_scores_gemma":[0.9962369,0.00001396404,0.00001349202,0.0008722194,0.0008034352,0.0005460913,0.00001871508,0.00005070156,0.001444446],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3679893,"threshold_uncertainty_score":0.6020727,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001039853,0.0002179192,0.0002357372,0.000134307,0.0008207479,0.0008008558,0.0004479756,0.00004475607,0.00004344918],"category_scores_gemma":[0.0001258383,0.0001326982,0.00005754938,0.0005366799,0.0001993899,0.0007669145,0.0001235748,0.0001495118,0.001100986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006666292,"about_ca_system_score_gemma":0.00002378397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002168535,"about_ca_topic_score_gemma":0.001355791,"domain_scores_codex":[0.9984434,0.00004711258,0.0003343772,0.0003491622,0.0003951528,0.0004307552],"domain_scores_gemma":[0.9985662,0.0001314927,0.0003541209,0.0005942673,0.0003368469,0.00001711268],"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.001112494,0.0002012163,0.02406111,0.0008117114,0.001274163,0.000286388,0.001218981,0.038158,0.003379329,0.8987345,0.01395807,0.01680399],"study_design_scores_gemma":[0.001649628,0.0001489114,0.0007652019,0.0009138134,0.0003860448,0.00006341337,0.004991816,0.1026912,0.0009618013,0.02736693,0.858349,0.001712299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8550835,0.001004304,0.03721721,0.001268137,0.00331396,0.001186875,0.000004873064,0.001483131,0.09943803],"genre_scores_gemma":[0.9891136,0.000005000243,0.0000452575,0.0003160709,0.002037994,0.00004640185,0.000003787972,0.00005616925,0.008375718],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8713676,"threshold_uncertainty_score":0.9996768,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000382833,0.0001801835,0.0002809445,0.00005976481,0.0001088366,0.0002926009,0.0003173512,0.00008132027,0.000009867603],"category_scores_gemma":[0.000005179775,0.0001492321,0.00002428391,0.000450682,0.00003065953,0.0003469421,0.00003448686,0.0001615081,0.00002662845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004349054,"about_ca_system_score_gemma":0.00008607049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002464305,"about_ca_topic_score_gemma":0.0001766412,"domain_scores_codex":[0.9985412,0.0001657521,0.0002664748,0.0004174982,0.0002165312,0.0003925197],"domain_scores_gemma":[0.9992819,0.0001362583,0.00006751058,0.0003748602,0.00003495485,0.0001044697],"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.0001750417,0.0002400457,0.06782828,0.0002814564,0.0002187828,0.0008250832,0.004374135,0.4111469,0.00001543165,0.1282195,0.006695953,0.3799794],"study_design_scores_gemma":[0.001201294,0.0001689291,0.00321796,0.0005811277,0.00001264406,0.0001894143,0.0000395228,0.9602574,0.000002279652,0.0002118563,0.03374324,0.0003743626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.842855,0.01236119,0.1209773,0.001988969,0.001156151,0.001563928,0.000002842835,0.001710498,0.0173841],"genre_scores_gemma":[0.9958882,0.0001060624,0.002720393,0.0002792349,0.0003196842,0.0000559909,6.500665e-7,0.00001408458,0.0006156938],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5491105,"threshold_uncertainty_score":0.6085508,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001089325,0.0004036941,0.0005723679,0.0003469718,0.0004696049,0.0005849627,0.0003741417,0.0001069822,0.0000261248],"category_scores_gemma":[0.00009337749,0.0003236961,0.0001649789,0.0008028779,0.00009448289,0.001213416,0.00009751067,0.000152006,0.0001213787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001008745,"about_ca_system_score_gemma":0.00003405847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003015618,"about_ca_topic_score_gemma":0.00197964,"domain_scores_codex":[0.9978355,0.00004443207,0.0006092729,0.000632079,0.0002808481,0.0005978885],"domain_scores_gemma":[0.9983195,0.000237385,0.0005242598,0.0005666538,0.0003276092,0.00002458148],"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.0004352841,0.000257485,0.01720235,0.001053061,0.0002862188,0.00008842708,0.00007951252,0.2378362,0.005419839,0.7317654,0.004706282,0.0008700237],"study_design_scores_gemma":[0.005752003,0.0001766099,0.003249706,0.002664873,0.00162499,0.00005117221,0.002148377,0.5693327,0.002093082,0.03888298,0.3701015,0.00392199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5639663,0.0009450358,0.3794633,0.001640806,0.001683223,0.003073848,0.00004321043,0.001948425,0.04723586],"genre_scores_gemma":[0.9906939,0.000001561704,0.0004516898,0.0002141704,0.003293188,0.0002980358,0.0001470019,0.0001215557,0.004778931],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6928824,"threshold_uncertainty_score":0.9999215,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001645772,0.0001419192,0.0002888474,0.0001574137,0.0001114602,0.0001362216,0.0003134862,0.00006396949,0.00004312998],"category_scores_gemma":[0.0003340954,0.0001074241,0.00009027933,0.0007449427,0.00005835977,0.0006527731,0.00005943289,0.0001571247,0.0002505356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007387302,"about_ca_system_score_gemma":0.00001018512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007310369,"about_ca_topic_score_gemma":0.0000488886,"domain_scores_codex":[0.9986437,0.00007882019,0.0005073473,0.0002174789,0.0002880382,0.0002646449],"domain_scores_gemma":[0.9990978,0.0001932757,0.0003052322,0.0003069411,0.00008934491,0.000007404972],"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.00004712151,0.0001624298,0.008207616,0.0003460656,0.00007761188,0.0000242715,0.0002539592,0.1030581,0.0009279976,0.8802307,0.00212716,0.004536984],"study_design_scores_gemma":[0.000262196,0.000005670052,0.0008865364,0.0002306964,0.00008498981,0.000005680567,0.0007352319,0.9602425,0.0000428822,0.001149524,0.03615038,0.0002037787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9790226,0.0001884771,0.002842137,0.001149777,0.0001214122,0.0002935904,0.000005867627,0.000122866,0.01625324],"genre_scores_gemma":[0.9983815,9.787371e-7,0.00001746094,0.0001868647,0.000988242,0.00001462457,0.00005795136,0.00001576015,0.0003365939],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8790812,"threshold_uncertainty_score":0.4380629,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006202382,0.0002434129,0.0003252922,0.0002205942,0.000247225,0.0003241121,0.0003305427,0.00009483298,0.0001327398],"category_scores_gemma":[0.0001650077,0.0001739525,0.0001535872,0.0003900272,0.00007584338,0.001396065,0.000144848,0.0000846735,0.0008949407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001014254,"about_ca_system_score_gemma":0.000008398233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007346194,"about_ca_topic_score_gemma":0.00007920777,"domain_scores_codex":[0.9984108,0.00004357174,0.0004086415,0.0004182858,0.0002888548,0.0004298132],"domain_scores_gemma":[0.9988728,0.00009095077,0.000355031,0.0005263886,0.0001319631,0.00002292157],"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.0002172416,0.0002306583,0.4193263,0.001683063,0.000994178,0.0005494465,0.0002955841,0.07251037,0.02130958,0.4605314,0.004374502,0.01797763],"study_design_scores_gemma":[0.009312436,0.0001294802,0.03020451,0.01434137,0.002020727,0.0002390247,0.001954965,0.2906118,0.007923161,0.08015026,0.5531396,0.009972695],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.980192,0.0002307763,0.01058286,0.0001731103,0.001139083,0.0002243929,0.000001489534,0.0005847955,0.006871508],"genre_scores_gemma":[0.9948729,0.000003571217,0.00003394896,0.0002494164,0.002048868,0.00002728805,0.000003782809,0.00006662074,0.002693598],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5487651,"threshold_uncertainty_score":0.999883,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009085078,0.0001810822,0.0003898274,0.0001502896,0.0003201582,0.0005577781,0.0003834343,0.0001018775,0.000006661243],"category_scores_gemma":[0.002905999,0.0001548299,0.00002147118,0.0002473323,0.00006937296,0.000512137,0.0001467361,0.000147408,0.00001527551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003998059,"about_ca_system_score_gemma":0.00009464126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005203706,"about_ca_topic_score_gemma":0.002353809,"domain_scores_codex":[0.9986454,0.00006133158,0.0004027695,0.0002983976,0.0002727926,0.0003192555],"domain_scores_gemma":[0.9983418,0.0005106397,0.0003730396,0.0004850962,0.0002132995,0.00007612477],"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.0001458724,0.0003828089,0.121762,0.06938586,0.000152689,0.0002875012,0.04949623,0.00004754711,0.0002281915,0.7545182,0.001353567,0.002239478],"study_design_scores_gemma":[0.01193998,0.001346348,0.04328125,0.045659,0.0004386274,0.001337012,0.1498879,0.03040898,0.004852394,0.6314042,0.07170599,0.007738309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9854982,0.001199354,0.0004296844,0.0003781831,0.0002540979,0.000277777,0.00001199615,0.0000938493,0.01185685],"genre_scores_gemma":[0.9973198,0.00007396685,0.00056971,0.00006010639,0.0001708104,0.00003563852,0.000001387201,0.00002180885,0.001746782],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.123114,"threshold_uncertainty_score":0.7866481,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001202452,0.0002499027,0.0003982215,0.0000701349,0.0008247832,0.000621432,0.0006024945,0.00006644645,0.00004500802],"category_scores_gemma":[0.0002620812,0.0001118585,0.0001261727,0.0004843101,0.0003083186,0.0006681136,0.0002309839,0.000157452,0.00004858213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002220332,"about_ca_system_score_gemma":0.00002343561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003983765,"about_ca_topic_score_gemma":0.0002206779,"domain_scores_codex":[0.9985205,0.0001106349,0.0004399741,0.000279889,0.0003293564,0.0003196442],"domain_scores_gemma":[0.9975684,0.0007259976,0.0006589161,0.0005769226,0.0004582724,0.00001147905],"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.001010295,0.0001792144,0.009766467,0.003733115,0.002835248,0.000005572128,0.005928345,0.1938444,0.009065246,0.7633588,0.004534468,0.005738773],"study_design_scores_gemma":[0.001335824,0.00001386899,0.000456914,0.0005119676,0.0006504304,0.00001327913,0.006039764,0.9827073,0.0001508367,0.002783739,0.005004638,0.0003314383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9826469,0.0009432885,0.002663912,0.008150577,0.0004744353,0.002462422,0.000007797144,0.0001822291,0.00246848],"genre_scores_gemma":[0.9968516,0.000004317197,0.000075843,0.0005400332,0.0007991208,0.0001645333,0.00000626822,0.00005221464,0.001506028],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7888629,"threshold_uncertainty_score":0.6343648,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004662451,0.0001644928,0.0002863927,0.0002890285,0.0001139244,0.0002904454,0.0002317684,0.00005752943,0.000258764],"category_scores_gemma":[0.0001034545,0.0001537531,0.00006580095,0.0006700903,0.00002412414,0.000862235,0.0001137739,0.00006202256,0.0006241428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001062196,"about_ca_system_score_gemma":0.00001733092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002232187,"about_ca_topic_score_gemma":0.00002463774,"domain_scores_codex":[0.9986452,0.0000302673,0.0004413765,0.000286274,0.0003589,0.0002380081],"domain_scores_gemma":[0.9988349,0.00003818383,0.0003606094,0.0003474271,0.0003963658,0.00002251824],"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.00004827097,0.0001420731,0.004555154,0.0006445358,0.0001885096,0.0000056115,0.001770908,0.8955896,0.02213226,0.03947744,0.03420775,0.001237855],"study_design_scores_gemma":[0.001571653,0.0001393902,0.001610259,0.001359975,0.0004030356,0.000003251317,0.02037334,0.7909292,0.00655485,0.002346738,0.1731082,0.001600117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9614335,0.00008404505,0.03068848,0.00132196,0.0006068081,0.000902846,0.000005425344,0.0001532414,0.004803704],"genre_scores_gemma":[0.9969223,5.768405e-7,0.000674494,0.0006096593,0.000351968,0.00009284403,0.000012783,0.00002649797,0.001308901],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1389004,"threshold_uncertainty_score":0.8022302,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001167989,0.0002370061,0.0004122906,0.0002064397,0.0003379931,0.0003825156,0.000345945,0.0001399248,0.00001040739],"category_scores_gemma":[0.0006754074,0.0002231536,0.0001429158,0.0003787359,0.00005636146,0.0006004444,0.00008662683,0.0002652844,0.0001164806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002615379,"about_ca_system_score_gemma":0.00001149854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004183138,"about_ca_topic_score_gemma":0.0001551714,"domain_scores_codex":[0.9983222,0.00002071224,0.0005998724,0.0004315199,0.0002026777,0.0004230411],"domain_scores_gemma":[0.9984481,0.0002812483,0.0004916176,0.0005321632,0.0002230003,0.0000239055],"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.0003634531,0.0001046535,0.001742595,0.0002346972,0.0001392451,0.000006008328,0.00009903536,0.8308704,0.003171488,0.1502867,0.01018325,0.002798457],"study_design_scores_gemma":[0.0007808867,0.00001186289,0.0001515916,0.0001181447,0.0001287076,0.000002897836,0.0001713445,0.9777456,0.00001807149,0.001586885,0.01893468,0.0003493516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3383585,0.0003370731,0.6482197,0.000283549,0.005672627,0.001484419,0.00002034404,0.0009420826,0.004681694],"genre_scores_gemma":[0.9944682,4.445446e-7,0.0002944801,0.0001534767,0.00424945,0.0001062819,0.0001020461,0.00005519528,0.0005704899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6561096,"threshold_uncertainty_score":0.9099941,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00123135,0.0002087724,0.000368214,0.0001319267,0.0003470333,0.0001142705,0.0003609533,0.00008506204,0.0001845091],"category_scores_gemma":[0.001096376,0.0001570754,0.0002170175,0.0007939655,0.0001965388,0.0007231493,0.00009900736,0.0001833476,0.00008113227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009413699,"about_ca_system_score_gemma":0.00004029735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000952116,"about_ca_topic_score_gemma":0.0001233432,"domain_scores_codex":[0.9982598,0.0002036648,0.0005503786,0.000369855,0.0003296995,0.0002865502],"domain_scores_gemma":[0.9979844,0.0002055202,0.0006101681,0.0008714269,0.0003139877,0.00001451476],"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.0000231402,0.0001246948,0.04565937,0.0005456108,0.0001626773,0.000006297431,0.0003227507,0.009142824,0.0040063,0.9391039,0.0008346734,0.00006776771],"study_design_scores_gemma":[0.006222646,0.0001470547,0.03791754,0.005979093,0.003256575,0.0001374454,0.04072953,0.06170092,0.05035724,0.3673629,0.4205087,0.005680358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8965073,0.0003913059,0.004972006,0.0002098587,0.001533405,0.001005942,0.00002347191,0.0002725155,0.0950842],"genre_scores_gemma":[0.9983623,0.00000143973,0.00004625101,0.0001384977,0.000263437,0.00005505179,0.000008835386,0.00003076958,0.00109344],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.571741,"threshold_uncertainty_score":0.6405348,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008983808,0.0002988555,0.0003815477,0.0002763029,0.0003850127,0.0002873789,0.0003442988,0.0001176062,0.00004928965],"category_scores_gemma":[0.00005250463,0.000268159,0.0001150099,0.0007559608,0.0000521057,0.002004938,0.00007520164,0.0001421612,0.00006940111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001310587,"about_ca_system_score_gemma":0.00002709096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003493912,"about_ca_topic_score_gemma":0.0006212979,"domain_scores_codex":[0.9982986,0.00003308835,0.0004237797,0.0004917035,0.0002301679,0.0005226862],"domain_scores_gemma":[0.9986101,0.00007018378,0.0004807814,0.0005054109,0.0003086193,0.00002494098],"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.0004366771,0.0001151449,0.0133514,0.001397678,0.0004367541,0.00001893027,0.0003596238,0.7071667,0.0003449885,0.2747144,0.0005390518,0.001118705],"study_design_scores_gemma":[0.0009459064,0.00004145679,0.0007194254,0.0007197611,0.0003451515,0.000006741168,0.001553566,0.9813622,0.00009142414,0.003530695,0.009956657,0.000727005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2603448,0.0006049133,0.7152056,0.0001444951,0.001367879,0.001710718,0.000003612631,0.001397698,0.01922026],"genre_scores_gemma":[0.9946168,0.000005048823,0.001615463,0.0002618094,0.000412612,0.0001676595,0.0000638419,0.0001005093,0.002756245],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.734272,"threshold_uncertainty_score":0.9999771,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001150113,0.0003033254,0.0008280609,0.001745536,0.0002497679,0.000257064,0.0003065305,0.000102832,0.00006606239],"category_scores_gemma":[0.0001099663,0.000250574,0.0002677485,0.003831144,0.00009186805,0.001947394,0.0001040497,0.0001848075,0.000179063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001210591,"about_ca_system_score_gemma":0.00001608898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006500753,"about_ca_topic_score_gemma":0.0002137366,"domain_scores_codex":[0.9978941,0.00008453599,0.0006999782,0.0003519763,0.0004381298,0.0005312768],"domain_scores_gemma":[0.998002,0.0001528351,0.0008539631,0.0006239349,0.0003289612,0.00003830377],"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.00008658935,0.0002037425,0.3212754,0.0009808599,0.005454947,0.00001124647,0.0006384994,0.4748378,0.001049884,0.1947449,0.0004308392,0.0002853395],"study_design_scores_gemma":[0.001426356,0.00005956383,0.01585,0.002341998,0.02220194,0.00004962692,0.0207088,0.8280708,0.000197447,0.0001733406,0.1063502,0.00256995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.857517,0.002004146,0.0757357,0.00007773337,0.002635279,0.0008052314,0.00001127006,0.0008344832,0.06037914],"genre_scores_gemma":[0.9972958,0.000003760958,0.00005846559,0.00006034201,0.00111748,0.00006785595,0.00003067107,0.0000597475,0.001305857],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.353233,"threshold_uncertainty_score":0.9999946,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002010547,0.0001759792,0.0004344855,0.0001522828,0.0004397056,0.0001899579,0.0006618132,0.0001015171,0.00000585186],"category_scores_gemma":[0.0002486699,0.00009711445,0.00006075788,0.0009338428,0.0001869349,0.0003795798,0.00009032402,0.0001550876,0.00001204141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004786003,"about_ca_system_score_gemma":0.0001911259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002720214,"about_ca_topic_score_gemma":0.0007648371,"domain_scores_codex":[0.997263,0.0003356281,0.0007998093,0.0005204222,0.000845474,0.0002356663],"domain_scores_gemma":[0.997503,0.000430575,0.0004279264,0.000896114,0.0006174903,0.0001249277],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0001489532,0.0002033119,0.8855559,0.0002740001,0.00006130537,0.000001919942,0.01524881,0.03726745,0.0004094427,0.060065,0.0001804095,0.0005835001],"study_design_scores_gemma":[0.00508198,0.0004992965,0.8284383,0.004141326,0.0003137546,0.0003605054,0.05991689,0.05874339,0.00094792,0.03623811,0.003469789,0.001848747],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.877328,0.0009135947,0.1163163,0.0001575296,0.0002096707,0.002391497,0.00005167186,0.00006505473,0.002566625],"genre_scores_gemma":[0.9983996,0.000006469881,0.000332073,0.0000302005,0.00003941509,0.0006025433,9.319855e-7,0.0000162802,0.0005724948],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1210716,"threshold_uncertainty_score":0.4112168,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002260398,0.0003945227,0.001080048,0.001975158,0.0001036555,0.00005626757,0.0006760078,0.0002295383,0.00008757392],"category_scores_gemma":[0.0006945712,0.0003943678,0.0002678055,0.003272902,0.0002130642,0.001353218,0.0002799591,0.000384395,0.0001132383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001955956,"about_ca_system_score_gemma":0.00007416707,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02483277,"about_ca_topic_score_gemma":0.0007078946,"domain_scores_codex":[0.9968658,0.0001616306,0.001248383,0.0006062762,0.0005611978,0.0005567038],"domain_scores_gemma":[0.9970434,0.0002313072,0.001408564,0.0007794948,0.0005008184,0.0000363568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.001146038,0.002017096,0.7082294,0.01398126,0.001106091,0.0002271513,0.005897789,0.01450174,0.009611359,0.2365425,0.0004213176,0.00631825],"study_design_scores_gemma":[0.02725594,0.001160906,0.4668324,0.0288885,0.004810196,0.00007788623,0.07900402,0.240749,0.05220418,0.0503378,0.03295868,0.01572051],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9808553,0.0006597575,0.002900525,0.00002361362,0.0008132457,0.0007130874,0.00001419466,0.0001617047,0.01385856],"genre_scores_gemma":[0.9989159,0.00001653238,0.0002641677,0.00003874146,0.0003136867,0.00003892071,0.00001147042,0.00005742703,0.000343209],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2413969,"threshold_uncertainty_score":0.9998508,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005630629,0.0001614472,0.0002088478,0.00008746392,0.0003114132,0.0002144244,0.0004722892,0.00006091032,0.000002003654],"category_scores_gemma":[0.00002175914,0.0001266951,0.00008558101,0.0002299354,0.00002853509,0.0003889701,0.00002200903,0.00008770967,0.00001719326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000412917,"about_ca_system_score_gemma":0.00005412966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008297613,"about_ca_topic_score_gemma":0.00001795281,"domain_scores_codex":[0.9986968,0.00009643425,0.0002412455,0.000344996,0.00018762,0.0004328925],"domain_scores_gemma":[0.9991769,0.0001180285,0.00008758364,0.0004268494,0.00009080228,0.00009987176],"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.00005601553,0.0002417932,0.00004860308,0.0001851051,0.00007172566,0.00003225151,0.003360818,0.03417527,0.0008246156,0.9501963,0.0008545177,0.009952953],"study_design_scores_gemma":[0.001302836,0.0004807386,0.0002897655,0.0002812596,0.00002012034,0.00003735549,0.0002042679,0.9845188,0.0004072607,0.001209015,0.01084126,0.0004072783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005708474,0.0004409919,0.9914587,0.0004864677,0.0005148266,0.0005341761,0.000008181722,0.0003247054,0.0005235234],"genre_scores_gemma":[0.977083,0.000005483421,0.02125134,0.0001678309,0.0001454854,0.00006502806,0.000004065993,0.00001143092,0.001266342],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9713745,"threshold_uncertainty_score":0.5166477,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001261297,0.0001649672,0.0002680818,0.0002236439,0.0001157601,0.0001349756,0.0001475265,0.00009362308,0.0000349622],"category_scores_gemma":[0.000143169,0.000159179,0.00005624525,0.0005503112,0.00001936195,0.0014498,0.00007027777,0.0001649677,0.0002719363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006892235,"about_ca_system_score_gemma":0.000003647452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006000657,"about_ca_topic_score_gemma":0.00008824822,"domain_scores_codex":[0.9987483,0.00005264264,0.0003285312,0.00020711,0.0001434366,0.0005199949],"domain_scores_gemma":[0.9993687,0.0000632871,0.0002473308,0.0002430619,0.00006096827,0.00001667098],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003531698,0.00009763414,0.7453711,0.0001241631,0.00004200816,0.000008109026,0.00008629539,0.1437829,0.0003467407,0.1089308,0.0003171384,0.0008578133],"study_design_scores_gemma":[0.001302869,0.000005170183,0.09388734,0.0004568404,0.00008781023,0.000005454082,0.0005774911,0.8850251,0.00001863684,0.000533682,0.01743072,0.0006689054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9638143,0.001200707,0.02684031,0.00006983857,0.001750335,0.0004175753,0.000001575882,0.0003839931,0.005521324],"genre_scores_gemma":[0.997264,0.000005213906,0.00004320198,0.0002523893,0.001971153,0.00004023125,0.00003028945,0.00003276488,0.0003607066],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7412422,"threshold_uncertainty_score":0.6491132,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001246681,0.0002923334,0.0006055249,0.0003494792,0.0002285441,0.0002972756,0.0003331038,0.00009211902,0.00005541807],"category_scores_gemma":[0.000379402,0.0002417595,0.0001460914,0.0006391588,0.00009734361,0.00084223,0.00009130684,0.0001487907,0.0001011119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006598082,"about_ca_system_score_gemma":0.00001692602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001574518,"about_ca_topic_score_gemma":0.000142748,"domain_scores_codex":[0.9981786,0.00008529177,0.0005154603,0.0004388351,0.0003976224,0.0003842124],"domain_scores_gemma":[0.9982982,0.0001852732,0.0006547579,0.0005902291,0.0002485034,0.00002302025],"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.0006494831,0.0004986894,0.1169703,0.007183878,0.0009230327,0.00004624928,0.001447539,0.256805,0.1263287,0.4813889,0.0004390193,0.007319211],"study_design_scores_gemma":[0.0112905,0.001259161,0.01575983,0.0227137,0.004201175,0.000207309,0.01355957,0.5215089,0.01327462,0.02848963,0.3583107,0.009424884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9606615,0.0002212353,0.02892807,0.0001108487,0.0003347249,0.0002935724,0.000001407448,0.0002960037,0.009152601],"genre_scores_gemma":[0.9979075,0.000001203283,0.0004043074,0.0001605815,0.0009669143,0.00002442078,0.00001227568,0.00007271747,0.000450078],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4528992,"threshold_uncertainty_score":0.9858667,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001149937,0.000219477,0.0003730701,0.0002816156,0.0007770142,0.0003155141,0.0004268342,0.00005077436,0.0001778345],"category_scores_gemma":[0.0004297101,0.000230908,0.0001137188,0.0004601733,0.00002968668,0.001032512,0.000310889,0.0002491846,0.00004502349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001212682,"about_ca_system_score_gemma":0.00003449435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001990219,"about_ca_topic_score_gemma":0.00007931476,"domain_scores_codex":[0.9981646,0.0000625398,0.0004762369,0.0004509009,0.00040897,0.0004367301],"domain_scores_gemma":[0.9984203,0.0007026352,0.0003240754,0.0003859126,0.000146151,0.0000209211],"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.00006024932,0.00003089118,0.0003206177,0.0002169928,0.00004623277,0.00001234105,0.0001150519,0.2306389,0.0001884201,0.7657389,0.001428313,0.001203068],"study_design_scores_gemma":[0.0003845465,0.00003302504,0.0000102811,0.00007057347,0.0001034955,0.000004230354,0.001522585,0.8477293,0.0000231952,0.1114533,0.03826957,0.0003959615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03152108,0.0002550116,0.9512194,0.0003697182,0.001268405,0.0007352181,0.00002944038,0.000502865,0.0140988],"genre_scores_gemma":[0.9960406,0.000001602525,0.0008892468,0.0008843946,0.0007930909,0.0004074774,0.00005589914,0.00005601025,0.0008716318],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9645196,"threshold_uncertainty_score":0.9416153,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.005053149,0.0003088881,0.0006215208,0.0003518534,0.001427819,0.0003235506,0.0005952111,0.00005530068,0.00001485762],"category_scores_gemma":[0.0004685633,0.000254878,0.00027143,0.0008637931,0.0001239468,0.0006169084,0.0003455349,0.000253816,0.000005893739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000217424,"about_ca_system_score_gemma":0.0001017838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001802584,"about_ca_topic_score_gemma":0.00002601381,"domain_scores_codex":[0.9967421,0.0003695277,0.001034465,0.0005551183,0.0008141763,0.0004846336],"domain_scores_gemma":[0.9962696,0.001439585,0.001129993,0.0006162566,0.0005220937,0.00002240205],"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.00006457428,0.000053861,0.0006714255,0.0007831167,0.0002036068,0.000001962303,0.0001429049,0.6768579,0.000165744,0.3204405,0.0004111183,0.0002032891],"study_design_scores_gemma":[0.0005147649,0.00002780723,0.00002417159,0.00009885394,0.0002632907,0.00001336501,0.01000495,0.9691885,0.00001449478,0.01183368,0.007695583,0.000320605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2360905,0.008963697,0.7256966,0.0009178731,0.005989207,0.008868503,0.0002402854,0.001195917,0.01203744],"genre_scores_gemma":[0.9912239,0.000001447338,0.004047418,0.0001202866,0.0007732295,0.0008244389,0.0001415454,0.00008400864,0.00278369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7551335,"threshold_uncertainty_score":0.9999903,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001019586,0.0002454791,0.0004717617,0.000135662,0.0001833138,0.0001312735,0.0002102509,0.000182778,0.00001403423],"category_scores_gemma":[0.0003755655,0.0002268902,0.0002145725,0.0001401588,0.00002423364,0.0001625593,0.00004090373,0.0001372596,6.220828e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009007084,"about_ca_system_score_gemma":0.00001306608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006765701,"about_ca_topic_score_gemma":0.000007188626,"domain_scores_codex":[0.9981333,0.0001994737,0.0005797531,0.0003397848,0.0002900283,0.0004576856],"domain_scores_gemma":[0.9981952,0.0007939092,0.0002395811,0.0004941598,0.0001480495,0.0001291523],"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.00008781262,0.0004486136,0.0001221129,0.003196776,0.0004734932,0.00004486966,0.007598838,0.007426014,0.0156184,0.9243665,0.0324331,0.008183506],"study_design_scores_gemma":[0.000957451,0.00009876933,6.607211e-7,0.000406016,0.00009753866,0.00002997596,0.0007198285,0.9801779,0.001229186,0.004763385,0.01108116,0.0004380976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07236476,0.00127598,0.9091935,0.0001040054,0.001908314,0.001101221,0.00003207307,0.0003506183,0.01366955],"genre_scores_gemma":[0.943179,0.00004250463,0.04804053,0.00004685268,0.0008839718,0.000134594,0.000006853621,0.00009951861,0.007566193],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9727519,"threshold_uncertainty_score":0.9252313,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001665277,0.0002378592,0.0004893322,0.0003252127,0.0001744834,0.0003579412,0.0002409126,0.00008937967,0.0000145618],"category_scores_gemma":[0.0006324713,0.000221754,0.00009807206,0.0006377481,0.00009235177,0.001022896,0.000187334,0.0001598959,0.00006016321],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000541369,"about_ca_system_score_gemma":0.00002736723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002995036,"about_ca_topic_score_gemma":0.00005825941,"domain_scores_codex":[0.9984888,0.00007545378,0.0004568517,0.0003696371,0.0002910336,0.0003182051],"domain_scores_gemma":[0.9987221,0.0001857354,0.0004137693,0.0003810009,0.0002632168,0.00003416492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006606487,0.0002212118,0.6434557,0.004980024,0.0008821271,0.00009519073,0.004425636,0.1037924,0.01004774,0.2145018,0.002496359,0.01444117],"study_design_scores_gemma":[0.009747614,0.0004574099,0.02764314,0.01742625,0.003336916,0.0002058263,0.04564546,0.6722018,0.001901544,0.03825905,0.175086,0.008088906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9867595,0.002065295,0.003824856,0.000108717,0.0005063582,0.0002381948,0.000001085695,0.0002566524,0.006239338],"genre_scores_gemma":[0.9982319,0.0000063193,0.0004274462,0.0001061604,0.0007807825,0.00001661704,0.000005908511,0.00004979832,0.0003751016],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6158126,"threshold_uncertainty_score":0.9042867,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}