{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001982823,0.001410987,0.00101178,0.0003940608,0.0006513198,0.001195742,0.001544265,0.000889901,0.002901178],"category_scores_gemma":[0.002766793,0.0005583783,0.001058804,0.0006068138,0.001016657,0.001464061,0.001529565,0.001933087,0.0002760873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001419954,"about_ca_system_score_gemma":0.002203113,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005248231,"about_ca_topic_score_gemma":0.004572525,"domain_scores_codex":[0.9984993,0.0004271595,0.00007734338,0.0003642592,0.0004293535,0.0002025536],"domain_scores_gemma":[0.9988489,0.0005466833,0.0001838209,0.000106729,0.0002060452,0.0001078121],"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.00009608104,0.00005453996,0.0004274015,0.0001313325,0.00003603434,0.0001871596,0.00009717978,0.909045,0.006007872,0.05960824,0.001256309,0.02305295],"study_design_scores_gemma":[0.000004713389,0.00002360221,0.00004769674,0.00000592476,0.000005358959,0.00001857238,0.000006678389,0.9934639,0.0005270141,0.005327555,0.0005619699,0.000006994368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003081223,0.0002326613,0.9946149,0.0001273964,0.00004093882,0.00004012739,0.00003322772,0.00009299536,0.001736595],"genre_scores_gemma":[0.6547198,0.0009878532,0.3398743,0.0002547126,0.0001773483,0.0002877715,0.0001866667,0.0001475248,0.003363974],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005248231,"threshold_uncertainty_score":0.0104863,"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."}}