{"id":"W2068769043","doi":"10.1214/aoap/1019487511","title":"Strong approximations for multiclass feedforward queueing networks","year":2000,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Queue; Layered queueing network; FIFO (computing and electronics); Heavy traffic approximation; Approximation algorithm; Mathematics; Computer science; Mathematical optimization; Discrete mathematics; Computer network","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001641461,0.0001756035,0.0002909594,0.00006108768,0.0003287057,0.00007905091,0.0004167767,0.00006296884,0.0001760093],"category_scores_gemma":[0.0001179416,0.0001321568,0.0001912016,0.0004557477,0.0002089123,0.0003936206,0.00008326543,0.0001356083,0.00002755562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001302566,"about_ca_system_score_gemma":0.00001069521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005528002,"about_ca_topic_score_gemma":0.00004209199,"domain_scores_codex":[0.9987441,0.00001828643,0.0004255662,0.0003043959,0.0001653901,0.0003422299],"domain_scores_gemma":[0.9986881,0.0002481149,0.0002637542,0.0005922252,0.0001947928,0.00001298304],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005426278,0.0001569529,0.0001391963,0.000219184,0.0001006513,8.385089e-8,0.0001132779,0.5373537,0.0001051483,0.3997854,0.0004384485,0.06104531],"study_design_scores_gemma":[0.0003802775,0.000009309029,0.0005046069,0.00002191926,0.0001134056,1.179904e-7,0.0001650618,0.3481603,0.0004336966,0.6356159,0.01436009,0.0002352623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8425331,0.00009480085,0.08927714,0.004273931,0.00008954987,0.002942183,0.00001707223,0.000365738,0.06040648],"genre_scores_gemma":[0.9960519,0.000005536202,0.002419919,0.0008018203,0.0003437641,0.0001959675,0.00002407971,0.0000232254,0.0001337612],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2358305,"threshold_uncertainty_score":0.5389199,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05819194216930973,"score_gpt":0.2881690900799763,"score_spread":0.2299771479106666,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}