{"id":"W2100036317","doi":"10.1109/twc.2009.071359","title":"Utility-optimal random access: Reduced complexity, fast convergence, and robust performance","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Subgradient method; Asynchronous communication; Distributed algorithm; Distributed coordination function; Robustness (evolution); Wireless ad hoc network; Convergence (economics); Random access; Wireless network; Distributed computing; Wireless; Mathematical optimization; Algorithm; Computer network; IEEE 802.11; 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":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003382953,0.0002849975,0.0003567585,0.000198308,0.001313915,0.0004282196,0.003085611,0.0001318827,0.00005366393],"category_scores_gemma":[0.000003088335,0.0002862457,0.0001195048,0.0008154361,0.0004024609,0.001205045,0.00004557248,0.0006388996,0.00003031066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003802827,"about_ca_system_score_gemma":0.0001099033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004618729,"about_ca_topic_score_gemma":0.00007967472,"domain_scores_codex":[0.9980532,0.0002765537,0.0004875055,0.0004855582,0.0002925585,0.0004046543],"domain_scores_gemma":[0.9966449,0.0002833339,0.0001574045,0.002549301,0.0001632276,0.0002018395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003395467,0.00198681,0.0003689528,0.00008154867,0.0001417685,0.000004581195,0.001881661,0.07611555,0.001228091,0.03065993,0.001176836,0.8860148],"study_design_scores_gemma":[0.001564666,0.0002274813,0.005277704,0.0001456772,0.00002595139,0.00002966707,0.00003672836,0.9857917,0.004120541,0.0006478531,0.00168089,0.0004511511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03597477,0.0001030321,0.9555134,0.003797557,0.0002083138,0.00206271,0.00002096857,0.0003615361,0.001957786],"genre_scores_gemma":[0.976786,0.0010667,0.0207814,0.0004330162,0.00002802424,0.0007066145,0.000007894897,0.0000149508,0.0001754455],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9408112,"threshold_uncertainty_score":0.9999862,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07501901322174132,"score_gpt":0.3077144191367041,"score_spread":0.2326954059149627,"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."}}