{"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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001160906,0.0002271962,0.0006563496,0.001031023,0.0004170873,0.0003683024,0.00799884,0.00009544119,0.000005999627],"category_scores_gemma":[0.00007978042,0.0002353834,0.0001560563,0.006599704,0.0002946767,0.0008555041,0.00366617,0.0003709509,0.00000737212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002077416,"about_ca_system_score_gemma":0.0002493398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002667897,"about_ca_topic_score_gemma":0.002663783,"domain_scores_codex":[0.9968196,0.001417387,0.0009002278,0.0003594204,0.0002464309,0.0002569047],"domain_scores_gemma":[0.9920295,0.0009761263,0.0004644183,0.005743298,0.0006929598,0.00009372014],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003390183,0.001516021,0.009644902,0.00003054554,0.001084529,0.00000260403,0.01362615,0.3058797,0.0002804735,0.6412773,0.0003096848,0.02631427],"study_design_scores_gemma":[0.0022175,0.00003466686,0.03451183,0.0001864964,0.00009541153,0.000002087582,0.0001521563,0.9601371,0.00007481706,0.000357626,0.001936228,0.0002940902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008064406,0.008298536,0.9778289,0.003292644,0.000123709,0.0007785128,0.00002234948,0.0001651685,0.001425781],"genre_scores_gemma":[0.8195759,0.006182693,0.1737351,0.0001844209,0.000009512918,0.0001628733,0.0001149308,0.00001091396,0.00002370864],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8115115,"threshold_uncertainty_score":0.9973683,"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."}}