{"id":"W2804391341","doi":"10.1186/s13638-018-1138-x","title":"Network utility optimization-based joint user association and content placement in heterogeneous networks","year":2018,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"National Science and Technology Planning Project; Special Fund of Chongqing Key Laboratory; Chongqing Municipal Education Commission; Chongqing Science and Technology Commission; National Natural Science Foundation of China","keywords":"Backhaul (telecommunications); Computer science; Cache; Subgradient method; Optimization problem; Lagrange multiplier; Mathematical optimization; Lagrangian relaxation; Heterogeneous network; Computer network; Quality of service; Convex optimization; Wireless network; Wireless; Base station; Algorithm; Regular polygon","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.001548291,0.0001721671,0.0002453749,0.0001114821,0.0008911755,0.0004674228,0.0005043451,0.0000902306,0.000005352993],"category_scores_gemma":[0.0000229947,0.0001626531,0.00005713061,0.0003096834,0.00008367255,0.0002081881,0.0003245059,0.0005281115,0.00000128395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001619785,"about_ca_system_score_gemma":0.00004188059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002870071,"about_ca_topic_score_gemma":0.0001064402,"domain_scores_codex":[0.998071,0.0005735325,0.000498253,0.0002609346,0.0002335235,0.0003627801],"domain_scores_gemma":[0.9981461,0.0004884652,0.0003880725,0.0006655722,0.0001819544,0.0001298296],"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.0001169725,0.0002779305,0.1174752,0.000008025458,0.0001054031,0.00001816656,0.0004501925,0.763068,0.00002764246,0.002035744,0.0009915046,0.1154253],"study_design_scores_gemma":[0.000637845,0.0001584279,0.004590984,0.0002544852,0.00001168147,0.00002701318,0.00002493068,0.9925058,0.000003835386,0.00008142152,0.001534253,0.0001693492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1285302,0.006208454,0.8587022,0.004359787,0.001062864,0.0003370334,0.000001577311,0.0001041784,0.0006936148],"genre_scores_gemma":[0.9909934,0.002980474,0.004248321,0.001385899,0.0003309092,0.00001160183,0.000004793831,0.0000126259,0.00003197188],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8624632,"threshold_uncertainty_score":0.6854292,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06073362375891907,"score_gpt":0.2555730323554755,"score_spread":0.1948394085965564,"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."}}