{"id":"W2120024772","doi":"10.1109/infcom.2011.5935124","title":"Throughput-optimal random access with order-optimal delay","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Scheduling (production processes); Network packet; Throughput; Wireless network; Network topology; Wireless; Distributed computing; Mathematical optimization; 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.000250701,0.0002159565,0.0002495826,0.0000520529,0.0001588946,0.000346932,0.001603477,0.00008319636,0.00050834],"category_scores_gemma":[0.000006055382,0.0001413668,0.00005798541,0.0005183768,0.00007654288,0.001373172,0.0004539136,0.0001717989,0.00009256454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001380248,"about_ca_system_score_gemma":0.0001060471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002254327,"about_ca_topic_score_gemma":0.00005852415,"domain_scores_codex":[0.998487,0.00006388212,0.0002291818,0.000484359,0.000275725,0.0004598338],"domain_scores_gemma":[0.9989009,0.0000691828,0.00009310487,0.0006614548,0.0001370204,0.0001383643],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004506859,0.001831381,0.02385614,0.0001701381,0.0007124835,0.001217113,0.01201508,0.06075909,0.0001243838,0.5040601,0.05724612,0.3335011],"study_design_scores_gemma":[0.01572304,0.002631262,0.006244584,0.0001915076,0.00005754757,0.0003892927,0.0001164392,0.899659,0.009130344,0.00348915,0.05999679,0.002371042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006866471,0.00002255924,0.9479301,0.0001769027,0.0001188749,0.002346781,6.030079e-7,0.0003002733,0.04223743],"genre_scores_gemma":[0.3397584,0.0000119178,0.6559338,0.000942445,0.0001794705,0.001942928,0.000001868467,0.00002802994,0.001201162],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8388999,"threshold_uncertainty_score":0.5764771,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04282562874369684,"score_gpt":0.2749903120335904,"score_spread":0.2321646832898935,"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."}}