{"id":"W2940662702","doi":"10.2139/ssrn.3345302","title":"On the Optimal Design of a Bipartite Matching Queueing System","year":2019,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Queueing theory; Matching (statistics); Layered queueing network; Computer science; Mathematics; Mathematical optimization; Statistics; Theoretical computer science","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.003670507,0.000153199,0.0002280641,0.0002132951,0.000239583,0.0001236527,0.0004000408,0.00003903119,0.00007769019],"category_scores_gemma":[0.0000958478,0.0001027521,0.0001435542,0.0003850044,0.00002723849,0.0005786198,0.00006387378,0.0008970123,0.0002991795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002906133,"about_ca_system_score_gemma":0.0001524485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005903227,"about_ca_topic_score_gemma":0.00002030011,"domain_scores_codex":[0.9981112,0.00007477992,0.0003134521,0.0001670085,0.0002866785,0.001046824],"domain_scores_gemma":[0.9989645,0.0002129109,0.0004740503,0.0002472873,0.00009319496,0.000008042937],"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.0001047812,0.00001612286,0.0001488421,0.00002747102,0.0001320067,0.000002021191,0.00003439775,0.1515665,0.001410137,0.8459602,0.00001661615,0.0005808834],"study_design_scores_gemma":[0.0008680511,0.0001319098,0.00005449081,0.0005341215,0.0002905986,0.00009824242,0.00961546,0.1222423,0.0003839155,0.8647569,0.0005822246,0.0004417131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.792869,0.000246033,0.2037489,0.0004159492,0.0001698547,0.0001960266,2.078498e-7,0.00006337925,0.002290603],"genre_scores_gemma":[0.9987986,0.00002794012,0.0001471217,0.0002068764,0.0003501254,0.000004171178,6.369783e-7,0.00003040271,0.0004341369],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2059296,"threshold_uncertainty_score":0.4190111,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008238001044069283,"score_gpt":0.2078086886748367,"score_spread":0.1995706876307674,"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."}}