{"id":"W2918735386","doi":"10.1109/tvt.2020.2985289","title":"A Two-Timescale Approach for Network Slicing in C-RAN","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reservation; Quality of service; Resource allocation; Optimization problem; Radio access network; Mathematical optimization; Computer network; Stochastic programming; Distributed computing; Base station; Algorithm; Mathematics","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.0001698193,0.0002046475,0.0003164083,0.0002338215,0.0001830597,0.00004287642,0.0007488231,0.0002724682,0.0000055964],"category_scores_gemma":[0.00001147266,0.0002064656,0.000142505,0.001773496,0.00006987952,0.0001365561,0.00000817403,0.0005145245,0.00001805782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004526647,"about_ca_system_score_gemma":0.00003841116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001549452,"about_ca_topic_score_gemma":0.00001841657,"domain_scores_codex":[0.9983907,0.00004163362,0.0002892746,0.0006218152,0.0001409807,0.0005156018],"domain_scores_gemma":[0.9991878,0.0001154346,0.00006019193,0.0005047374,0.00004228503,0.00008954322],"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.00004232285,0.0002108727,0.0001932434,0.00003234686,0.00005570424,0.00002465044,0.0002623155,0.9072703,0.0008254799,0.0100982,0.0005098744,0.08047469],"study_design_scores_gemma":[0.001573146,0.0003784004,0.00002940011,0.00003405257,0.00002270033,0.00003089444,0.0000647506,0.9868612,0.005540092,0.002936179,0.002185626,0.0003436129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005726766,0.0002315439,0.988127,0.004130064,0.0002222993,0.0005040174,0.000003300083,0.0009243928,0.0001306185],"genre_scores_gemma":[0.8115446,0.00001732402,0.1869617,0.001095077,0.00007635498,0.0002583933,0.000001900976,0.00002365678,0.00002096685],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8058178,"threshold_uncertainty_score":0.8419423,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01746769104127589,"score_gpt":0.2305630394962698,"score_spread":0.2130953484549939,"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."}}