{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092109,0.0007524026,0.000833147,0.0003009691,0.0003896887,0.0007827317,0.001092848,0.0007443357,0.001785324],"category_scores_gemma":[0.002241216,0.0003100129,0.000406968,0.0002911124,0.0007610549,0.0009911696,0.00105863,0.001385418,0.0001982405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001440766,"about_ca_system_score_gemma":0.002056062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01156927,"about_ca_topic_score_gemma":0.0136668,"domain_scores_codex":[0.9995615,0.0001024843,0.00001822647,0.0001044967,0.00008692542,0.0001263371],"domain_scores_gemma":[0.9991599,0.000417736,0.0001133487,0.00005968099,0.000147673,0.0001015175],"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.00007051502,0.00005299681,0.0008855651,0.00003130711,0.00002188136,0.0000475685,0.00003167685,0.9641912,0.00119611,0.004871746,0.0007107332,0.02788864],"study_design_scores_gemma":[0.00000274244,0.000007701977,0.00002644382,0.000001372223,0.000002095607,0.000002665039,0.000002293281,0.9987754,0.0001353085,0.000981915,0.000060858,0.000001172023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05260443,0.0003538116,0.9427536,0.0003771983,0.00004539707,0.00005128096,0.0000453717,0.000553378,0.003215466],"genre_scores_gemma":[0.9501347,0.0001065543,0.04797984,0.0001451338,0.00002090828,0.0000457986,0.00006413414,0.00003479293,0.001468005],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01156927,"threshold_uncertainty_score":0.02300382,"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."}}