{"id":"W2161062743","doi":"10.1109/tmc.2011.58","title":"Distributed Throughput Maximization in Wireless Networks via Random Power Allocation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Throughput; Distributed algorithm; Distributed computing; Wireless network; Mathematical optimization; Gossip; Wireless; Utility maximization; Maximization; Power (physics); Resource allocation; Power control; Computer network; Mathematics; Telecommunications","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.0004459555,0.0002075215,0.0002345708,0.0001772828,0.0003745291,0.00009284416,0.0006943055,0.0001041319,0.00005418295],"category_scores_gemma":[0.000005336955,0.000218399,0.00008950897,0.001084304,0.0000513982,0.0004180197,0.00001645323,0.0003931898,0.00002300619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001314043,"about_ca_system_score_gemma":0.00003824197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002401625,"about_ca_topic_score_gemma":0.00006594612,"domain_scores_codex":[0.9983047,0.0003005726,0.0004652219,0.0004298323,0.0001771869,0.000322509],"domain_scores_gemma":[0.998728,0.000225679,0.0001379639,0.0006768638,0.0001538267,0.00007762636],"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.00004937634,0.0004181503,0.000144153,0.000005663761,0.00002726866,0.000005129305,0.002354577,0.739493,0.0003747851,0.001437341,0.00004260967,0.255648],"study_design_scores_gemma":[0.0009973521,0.00009151902,0.0009185929,0.00007957948,0.00000636011,0.000008350994,0.00004571739,0.9948793,0.002562817,0.00008123016,0.00008978781,0.0002394171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01732876,0.000103873,0.9806384,0.00006564786,0.0007340739,0.0004620423,0.000001493197,0.0002822465,0.0003834115],"genre_scores_gemma":[0.9910567,0.0002231069,0.008435328,0.0001511993,0.00002460797,0.00006337756,0.000009449063,0.00001778711,0.00001837826],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.973728,"threshold_uncertainty_score":0.8906053,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02631982935332525,"score_gpt":0.2507683484782509,"score_spread":0.2244485191249256,"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."}}