{"id":"W2017737452","doi":"10.1016/j.comcom.2004.08.015","title":"Markov chain analysis of collaborative codes in random multi access communication systems","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Aloha; Computer science; Asynchronous communication; Markov chain; Random access; Transmission (telecommunications); Computer network; Synchronizing; Throughput; Real-time computing; Telecommunications; Wireless","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.004081577,0.0009592071,0.001755495,0.002217842,0.001128916,0.002189978,0.002176153,0.00222716,0.005905675],"category_scores_gemma":[0.02164852,0.001238998,0.001085752,0.001720216,0.003278223,0.004109508,0.002034446,0.002733951,0.0007393062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003055287,"about_ca_system_score_gemma":0.002514697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009176007,"about_ca_topic_score_gemma":0.007155014,"domain_scores_codex":[0.997331,0.0010082,0.00009292812,0.0002963135,0.0007169238,0.0005545947],"domain_scores_gemma":[0.9669493,0.02580893,0.00193612,0.001362472,0.003160869,0.0007822815],"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.0001098052,0.0000589333,0.0009682008,0.0000753152,0.00005162341,0.0001545356,0.0002385548,0.5338998,0.001074774,0.4564653,0.001946315,0.004956769],"study_design_scores_gemma":[0.00001326341,0.00001289342,0.0002011071,0.00001446384,0.00001020181,0.00002771233,0.00002582787,0.9196728,0.0001700306,0.07957063,0.0002625629,0.00001846021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.123234,0.001224421,0.8596272,0.001683403,0.0001344346,0.0001641097,0.0004432561,0.0003341755,0.01315501],"genre_scores_gemma":[0.9626133,0.001183319,0.02444768,0.0002754401,0.0002037838,0.0002460037,0.0004070547,0.0001757026,0.01044776],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009176007,"threshold_uncertainty_score":0.0221678,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06039066101143298,"score_gpt":0.3395680111710763,"score_spread":0.2791773501596433,"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."}}