{"id":"W2170295971","doi":"10.1109/wcl.2012.051112.120277","title":"Utility-Optimal Random Access for Wireless Multimedia Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Random access; Wireless network; Quality of service; Computer network; Telecommunications link; Wireless; Transmission (telecommunications); Convex optimization; Optimization problem; Access network; Mathematical optimization; Regular polygon; Algorithm; 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":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001215725,0.0004175543,0.000546744,0.0001768346,0.000894608,0.0005728822,0.007306852,0.0002185038,0.00001453274],"category_scores_gemma":[0.00003170512,0.0004137075,0.0003003162,0.0007346823,0.0003810519,0.002059401,0.001133532,0.0006108268,0.00003359683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007435281,"about_ca_system_score_gemma":0.00007323876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000715088,"about_ca_topic_score_gemma":0.00003841952,"domain_scores_codex":[0.996737,0.000533747,0.000713778,0.0005263702,0.0003503431,0.001138764],"domain_scores_gemma":[0.9930301,0.001804578,0.000370397,0.004249523,0.0001836423,0.0003617168],"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.0005361009,0.0022534,0.02758078,0.0002591534,0.0006107072,0.000007172629,0.00492302,0.02967088,0.006238023,0.04077768,0.1158973,0.7712458],"study_design_scores_gemma":[0.002185843,0.00002698869,0.002214127,0.00009014364,0.0000328002,0.00001114325,0.00002326479,0.9594235,0.001196946,0.00005906526,0.03414081,0.0005953314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02557559,0.0004761904,0.9602115,0.006625876,0.001081073,0.00530787,0.00001837517,0.0004334191,0.0002701173],"genre_scores_gemma":[0.9291221,0.0001731298,0.05915033,0.003014171,0.0006670553,0.007701162,0.00006541146,0.00005796711,0.00004861887],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9297526,"threshold_uncertainty_score":0.9998315,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0533881653453624,"score_gpt":0.3216632795835048,"score_spread":0.2682751142381424,"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."}}