{"id":"W2949886575","doi":"","title":"Throughput-Optimal Random Access with Order-Optimal Delay","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Network topology; Scheduling (production processes); Network packet; Computer network; Network congestion; Wireless network; Random access; Topology (electrical circuits); Distributed computing; Wireless; Mathematical optimization; 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"],"consensus_categories":[],"category_scores_codex":[0.0003811622,0.0006186069,0.0006731394,0.0002173206,0.0003467833,0.0007856418,0.004900445,0.000673659,0.0001225183],"category_scores_gemma":[0.00001749899,0.0005744584,0.0002467883,0.0009840961,0.0002554875,0.0011774,0.004213242,0.001816283,0.00007504022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001026838,"about_ca_system_score_gemma":0.0005768873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003150044,"about_ca_topic_score_gemma":0.0002247093,"domain_scores_codex":[0.9967928,0.0001917757,0.000296043,0.00177824,0.0002098001,0.0007313568],"domain_scores_gemma":[0.9965888,0.0001965424,0.0004411192,0.002084708,0.0003827406,0.0003060777],"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.0004262202,0.0001363467,0.001488256,0.00007747307,0.0001695006,0.0008486956,0.0002022024,0.9562324,0.000008540312,0.03794164,0.0007831722,0.001685516],"study_design_scores_gemma":[0.003295549,0.000199161,0.0004013747,0.0001939652,0.00009879132,0.00003677471,0.00001859213,0.9834004,0.0001585962,0.004426602,0.006691033,0.00107918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1398266,0.00002531438,0.8529081,0.0001490788,0.0005453685,0.00329861,0.00001173348,0.0003866712,0.002848461],"genre_scores_gemma":[0.9655097,0.00008588439,0.03252492,0.0002100173,0.0003476309,0.00009245492,0.00002296044,0.00005247989,0.001153925],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8256831,"threshold_uncertainty_score":0.9996707,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05865531833255154,"score_gpt":0.2175011538165315,"score_spread":0.1588458354839799,"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."}}