{"id":"W4414404930","doi":"10.1109/ton.2025.3605104","title":"Learning to Balance Utility and Delay in Bipartite Queueing Networks With Sample Path Constraints","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Queueing theory; Layered queueing network; Routing (electronic design automation); Bipartite graph; Regret; Quality of service; Path (computing); Constraint (computer-aided design); Range (aeronautics)","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.0005189681,0.0002061363,0.0002681346,0.0003366244,0.0003994299,0.0001580965,0.0001194777,0.00007029706,0.0000531154],"category_scores_gemma":[0.00002182752,0.0002044871,0.00005064829,0.001458493,0.0001001827,0.0003834595,0.000006528348,0.0004389773,0.000006436523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005030633,"about_ca_system_score_gemma":0.00001453807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002493176,"about_ca_topic_score_gemma":0.001358701,"domain_scores_codex":[0.9987349,0.00004639369,0.0002748384,0.0004278937,0.0001204828,0.0003954757],"domain_scores_gemma":[0.9992887,0.0003379911,0.00009862062,0.0002006636,0.00005199104,0.00002208003],"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.0001794432,0.00003811554,0.02029241,0.00003230699,0.00004716242,0.00001196992,0.00008119812,0.8757799,0.00003010597,0.0005134328,0.00001596905,0.102978],"study_design_scores_gemma":[0.0006309951,0.0000219885,0.001344904,0.000896856,0.0001087885,0.000002069637,0.0003892775,0.9895434,0.00005264865,0.001022316,0.00564259,0.0003441841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1504942,0.00006664905,0.8473862,0.0001604805,0.0002615521,0.0001955754,9.324552e-7,0.0001485356,0.001285835],"genre_scores_gemma":[0.9973908,0.00003186601,0.00127807,0.001017227,0.0001674295,0.0000383842,0.000002884888,0.00002234006,0.00005100428],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8468966,"threshold_uncertainty_score":0.8338742,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009794529342139794,"score_gpt":0.2280464038434332,"score_spread":0.2182518745012934,"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."}}