{"id":"W2120968943","doi":"10.1109/tcomm.2013.042313.120770","title":"Throughput Upper-Bound of Slotted CSMA Systems with Unsaturated Finite Population","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Upper and lower bounds; Throughput; Exponential backoff; Computer science; Population; Algorithm; Markov process; Markov chain; Protocol (science); Computer network; Mathematics; Statistics","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.001763403,0.0007253754,0.001092469,0.0007983598,0.0009027765,0.002009169,0.001487628,0.0008746123,0.001165469],"category_scores_gemma":[0.007770743,0.0004095149,0.0005579006,0.0007327414,0.002063064,0.002767514,0.001132953,0.001634532,0.0002043884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003059476,"about_ca_system_score_gemma":0.002129078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004715544,"about_ca_topic_score_gemma":0.002001116,"domain_scores_codex":[0.9984972,0.0003220125,0.00005060031,0.000302999,0.0004846277,0.0003425545],"domain_scores_gemma":[0.9950925,0.003304254,0.0005707845,0.0004145787,0.0004877069,0.0001301261],"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.000128975,0.00004443006,0.0009310781,0.00009919951,0.00004263996,0.0001780279,0.0002266159,0.8856795,0.009102144,0.09517692,0.0005695823,0.007820839],"study_design_scores_gemma":[0.000004413663,0.00002636576,0.0001656029,0.000007455836,0.000009638388,0.00003500372,0.00002026227,0.9876895,0.001272213,0.01050455,0.0002552579,0.000009759306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08120304,0.0006785169,0.9139857,0.000307908,0.00005221189,0.00003590877,0.00009023781,0.0003113301,0.003335189],"genre_scores_gemma":[0.9821504,0.000463237,0.0155926,0.00007548123,0.00004123293,0.0000715671,0.00004909222,0.00004513311,0.00151133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004715544,"threshold_uncertainty_score":0.02219814,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02820872018376837,"score_gpt":0.2619949986034854,"score_spread":0.233786278419717,"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."}}