{"id":"W3128553668","doi":"10.1287/opre.2020.2027","title":"On the Optimal Design of a Bipartite Matching Queueing System","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":41,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Queueing theory; Matching (statistics); Computer science; Mathematical optimization; Queueing system; Layered queueing network; Mathematics; Theoretical computer science; Statistics; Computer network; Graph","routes":{"ca_aff":true,"ca_fund":false,"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.002431047,0.00007252355,0.0001183299,0.0002353607,0.0007841226,0.0003970587,0.0002407636,0.00002823265,0.0003549496],"category_scores_gemma":[0.000933029,0.00005261206,0.00004883612,0.001254672,0.00007507338,0.0004605788,0.0001797919,0.0002336735,0.000354268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004860953,"about_ca_system_score_gemma":0.00006370024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002346228,"about_ca_topic_score_gemma":0.00007712096,"domain_scores_codex":[0.9987279,0.0002371036,0.0001990533,0.0001984031,0.0004163734,0.0002212271],"domain_scores_gemma":[0.9984409,0.0005174785,0.00002793916,0.0003938626,0.0006118288,0.000008018964],"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.00001216985,0.00002349141,0.000009150081,0.0000298833,0.00001968948,0.00001041854,0.00007061437,0.4968891,0.009144517,0.4934445,0.0002034047,0.0001431031],"study_design_scores_gemma":[0.000170046,0.00001251989,0.00002911199,0.0002693555,0.00003013516,0.000003239006,0.005249667,0.9798812,0.00691131,0.006023644,0.001284658,0.0001350861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6988533,0.0001220223,0.2765917,0.003968457,0.0001054998,0.0005078011,0.000003056017,0.0001012548,0.01974697],"genre_scores_gemma":[0.9960209,0.000003770406,0.002297473,0.00013882,0.0001872657,0.00006082547,0.000007131652,0.00001627992,0.001267528],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4874209,"threshold_uncertainty_score":0.6030917,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08790752156144246,"score_gpt":0.3437397158320938,"score_spread":0.2558321942706514,"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."}}