{"id":"W2106432474","doi":"10.1109/pacrim.1993.407215","title":"Analysis of the capacity for a Markovian multiple access channel","year":2002,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Channel (broadcasting); Markov process; Channel capacity; Computer science; Set (abstract data type); Transmission (telecommunications); Computer network; Gaussian; Process (computing); Information transmission; Theoretical computer science; Mathematics; Telecommunications; Statistics; Programming language","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.0003155961,0.00005804927,0.0001394504,0.0001610903,0.0001365508,0.00009875502,0.003591925,0.00003344648,0.00006729254],"category_scores_gemma":[0.0001180763,0.00003838904,0.0001658192,0.002109968,0.00006657645,0.0002648049,0.0008807994,0.00008442863,0.000002924485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002242496,"about_ca_system_score_gemma":0.000009482286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001593731,"about_ca_topic_score_gemma":0.0006686307,"domain_scores_codex":[0.9991177,0.0001154686,0.0001678713,0.0001740395,0.0002419692,0.0001829838],"domain_scores_gemma":[0.997793,0.0004641922,0.00007839956,0.001456891,0.0001623699,0.00004514267],"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.00004337989,0.001962335,0.1690772,0.0001752333,0.003925863,0.000001227786,0.007953376,0.1738336,0.0014297,0.1274426,0.05848439,0.4556711],"study_design_scores_gemma":[0.0001177835,0.000006753486,0.02338604,0.000002908784,0.00001683179,1.613879e-7,0.00000548594,0.9742781,0.0006190997,0.0001771062,0.001341729,0.00004802335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02618126,0.00005841171,0.9641844,0.004981044,0.00006767651,0.0003709474,0.00000811076,0.00005563372,0.004092528],"genre_scores_gemma":[0.988237,0.00002124966,0.01069987,0.0001717587,0.00001061732,0.00005406342,9.489789e-7,0.000003305103,0.0008011344],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9620558,"threshold_uncertainty_score":0.667475,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1316455939631461,"score_gpt":0.3139514121863388,"score_spread":0.1823058182231927,"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."}}