{"id":"W4221143742","doi":"10.48550/arxiv.2202.06439","title":"Communication and Computation O-RAN Resource Slicing for URLLC Services Using Deep Reinforcement Learning","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Slicing; Reinforcement learning; Radio access network; Ran; Distributed computing; Computer network; Shared resource; Markov decision process; Service (business); Base station; Artificial intelligence; Markov process; World Wide Web","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004296975,0.0002170832,0.0002435686,0.000201861,0.0008186051,0.000202642,0.000951421,0.0001315477,0.000009697188],"category_scores_gemma":[0.00001626463,0.000278657,0.00009719095,0.0003672929,0.00004357646,0.0003046304,0.002660613,0.0004910541,0.000001108258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002120984,"about_ca_system_score_gemma":0.00004938925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004031154,"about_ca_topic_score_gemma":0.00004401861,"domain_scores_codex":[0.9985824,0.0001850387,0.0002158112,0.0006583894,0.00009737663,0.0002610317],"domain_scores_gemma":[0.9984383,0.0003612335,0.0003949236,0.0006216915,0.0001003661,0.00008350431],"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.00002356826,0.00001364968,0.002091128,0.0001043026,0.00003923581,0.000005645471,0.001272061,0.9852845,0.000005343879,0.009669271,0.00001768707,0.001473615],"study_design_scores_gemma":[0.0004565151,0.00005841237,0.000381999,0.0001223877,0.00005969139,0.000002903843,0.0006194171,0.9911954,0.000004859317,0.005514393,0.001303302,0.0002806727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1793917,0.0002428636,0.8192912,0.00005208083,0.0001134742,0.0003521806,0.000001171202,0.0001970013,0.0003583219],"genre_scores_gemma":[0.9868376,0.0001563169,0.01250388,0.0001475683,0.0000377906,0.000002944738,0.0001102037,0.00001956814,0.0001840855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8074459,"threshold_uncertainty_score":0.9999666,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06587675014918982,"score_gpt":0.2151502468179641,"score_spread":0.1492734966687743,"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."}}