{"id":"W4300856996","doi":"10.48550/arxiv.1103.3054","title":"On the Capacity of Memoryless Finite-State Multiple Access Channels with\\n Asymmetric Noisy State Information at the Encoders","year":2011,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Independent and identically distributed random variables; Encoder; State (computer science); State information; Upper and lower bounds; Channel (broadcasting); Finite state; Channel capacity; Computer science; Information theory; Topology (electrical circuits); Mathematics; Computer network; Algorithm; Combinatorics; Random variable; Statistics; Mathematical analysis; Markov chain","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001190192,0.0008212571,0.0007452241,0.0009807931,0.000631733,0.0002226291,0.004650956,0.0003965066,0.0001677931],"category_scores_gemma":[0.0003800266,0.000644263,0.0003511595,0.00226779,0.0009044601,0.0014902,0.002813033,0.00189934,0.0001382455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007481013,"about_ca_system_score_gemma":0.000154837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002807719,"about_ca_topic_score_gemma":0.00116207,"domain_scores_codex":[0.9968063,0.0006581885,0.0008452633,0.0006704066,0.0003650698,0.0006548089],"domain_scores_gemma":[0.9915724,0.002505254,0.001357714,0.003625002,0.0007490883,0.0001905034],"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.0004029223,0.000147442,0.0009547733,0.0003806306,0.0004476627,0.00001322213,0.008808743,0.976837,0.00003554147,0.01088399,0.0001857337,0.0009022706],"study_design_scores_gemma":[0.001687271,0.0002758078,0.002419601,0.0008618469,0.0003403551,0.000007496727,0.001439322,0.9130451,0.054881,0.02221047,0.001176008,0.001655699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8138415,0.00004760651,0.1773198,0.0001204172,0.0003008768,0.001883432,0.000292916,0.0003228293,0.005870715],"genre_scores_gemma":[0.9968182,0.002445658,0.000146921,0.0001224953,0.00001574055,0.00002586878,0.00007358044,0.00007312378,0.0002783978],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1829768,"threshold_uncertainty_score":0.9996009,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09174483541347649,"score_gpt":0.1892858028300396,"score_spread":0.09754096741656308,"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."}}