{"id":"W3133256763","doi":"10.1109/globecom42002.2020.9348193","title":"Throughput Maximization via Joint Optimization of Fronthaul and Access Links in C- RANs","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Orthogonal frequency-division multiple access; Computer network; Optimization problem; Throughput; Telecommunications link; Radio access network; Access network; Convex optimization; C-RAN; Resource allocation; Bandwidth (computing); Interference (communication); Orthogonal frequency-division multiplexing; Wireless; Telecommunications; Algorithm; Regular polygon; Base station; Mathematics","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.00005018463,0.0001122534,0.0002052518,0.00007505771,0.00001363049,0.00002001543,0.00007033684,0.000126131,0.00006709673],"category_scores_gemma":[0.00003913728,0.0001160444,0.00001584161,0.0003219634,0.00001552084,0.0005186166,0.00003175117,0.000106799,0.000002330958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003178989,"about_ca_system_score_gemma":0.000006920834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003561467,"about_ca_topic_score_gemma":0.00003168064,"domain_scores_codex":[0.9993078,0.00001844481,0.0003404023,0.0001516832,0.0000741171,0.0001076253],"domain_scores_gemma":[0.9997476,0.00001662257,0.00005219378,0.00009563149,0.00004177193,0.00004617897],"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.000007022161,0.000006185796,0.0006673178,0.0001311072,0.000007027737,7.461596e-7,0.0004592875,0.9968491,0.0009640455,0.00006011873,0.0001011078,0.0007469011],"study_design_scores_gemma":[0.0005166291,0.00001711184,0.0003184338,0.00002992818,0.000006327403,0.000001123745,0.00006203005,0.9951936,0.003657422,0.00003980205,0.00004264912,0.0001149354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001237168,0.0001996204,0.9955556,0.0001536111,0.00008913239,0.0003012305,0.000005102902,0.0001771569,0.002281366],"genre_scores_gemma":[0.9006721,0.0002748924,0.09880052,0.00008582274,0.00004470778,0.00001420189,0.00005544454,0.00003816936,0.00001419115],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8994349,"threshold_uncertainty_score":0.4732155,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02127488636910312,"score_gpt":0.2292237350891085,"score_spread":0.2079488487200054,"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."}}