{"id":"W2107484830","doi":"10.1109/allerton.2011.6120305","title":"On the capacity of memoryless finite-state multiple access channels with asymmetric noisy state information at the encoders","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Independent and identically distributed random variables; Encoder; State information; Upper and lower bounds; State (computer science); Finite state; Computer science; Information theory; Channel capacity; Process (computing); Encoding (memory); Topology (electrical circuits); Mathematics; Algorithm; Channel (broadcasting); Computer network; Random variable; Combinatorics; Statistics; Markov chain; Mathematical analysis; Artificial intelligence","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.0003872745,0.0001505839,0.0001416179,0.0001808485,0.0001149207,0.00005332138,0.0007924443,0.00004162233,0.00008339781],"category_scores_gemma":[0.0001102199,0.000082209,0.00003875675,0.0005282155,0.0001257987,0.0005987292,0.0001606269,0.0002261899,0.00003221353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000633137,"about_ca_system_score_gemma":0.00001137307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007159993,"about_ca_topic_score_gemma":0.0006926834,"domain_scores_codex":[0.9991329,0.00007356988,0.0002901309,0.00007631812,0.0002493763,0.0001776935],"domain_scores_gemma":[0.9983198,0.0006234088,0.000127363,0.0007621481,0.0001320052,0.00003526767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008017846,0.00062824,0.008375674,0.0009733371,0.0009832216,0.000006421165,0.2226239,0.6470108,0.001903912,0.0316809,0.01838657,0.06662522],"study_design_scores_gemma":[0.0006259091,0.000143845,0.004791705,0.00008880722,0.00002091221,0.000004138335,0.0009548262,0.2465768,0.7415724,0.002779455,0.001979218,0.0004620064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9009684,0.00002108443,0.07542174,0.000165531,0.00006521247,0.0006627212,0.0000447103,0.0004392462,0.02221134],"genre_scores_gemma":[0.998841,0.0001139536,0.0006840278,0.0001784971,0.00000307161,0.00009903031,0.0000102619,0.00001814802,0.00005204758],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7396685,"threshold_uncertainty_score":0.3352386,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04512741354612344,"score_gpt":0.2239311796126126,"score_spread":0.1788037660664891,"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."}}