{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002823139,0.000953564,0.001207593,0.000882188,0.0007894841,0.001826452,0.001307947,0.0007768528,0.001383094],"category_scores_gemma":[0.009915392,0.0004828594,0.0005204873,0.001214239,0.001943934,0.002353165,0.0009521777,0.001203923,0.0003001266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002550149,"about_ca_system_score_gemma":0.002489235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001507599,"about_ca_topic_score_gemma":0.001635178,"domain_scores_codex":[0.9976321,0.0007022756,0.000138454,0.0004101582,0.0006473252,0.000469711],"domain_scores_gemma":[0.9921625,0.004948222,0.001078703,0.0008204965,0.0007007224,0.0002893395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004404805,0.0001904757,0.0008849535,0.0001726632,0.00005439288,0.0001957403,0.000221893,0.6633325,0.01595109,0.29376,0.001033077,0.02376273],"study_design_scores_gemma":[0.00005919886,0.0001237695,0.0001457545,0.000008167031,0.00001963711,0.000080309,0.00002863702,0.9322603,0.004095778,0.06235449,0.0008027488,0.00002118835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09407971,0.0005999049,0.8988844,0.000356644,0.0001002112,0.0001279768,0.000098538,0.0003806611,0.005371918],"genre_scores_gemma":[0.925805,0.0004287492,0.07101162,0.0001129422,0.0001017031,0.0001088221,0.00005057954,0.00006592734,0.002314602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002823139,"threshold_uncertainty_score":0.01850277,"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."}}