{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002525064,0.001215657,0.0009653258,0.001560122,0.0006731761,0.002543388,0.00161371,0.001034481,0.003339488],"category_scores_gemma":[0.01647421,0.0005316723,0.0005151766,0.001677691,0.003680741,0.004226491,0.002395769,0.002114206,0.0003995944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002265104,"about_ca_system_score_gemma":0.001235887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002715493,"about_ca_topic_score_gemma":0.0012617,"domain_scores_codex":[0.9985042,0.0005520016,0.00005209668,0.0001727667,0.0003671036,0.0003519074],"domain_scores_gemma":[0.9838848,0.01355926,0.0007096234,0.0006751801,0.0008948607,0.0002762469],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00034284,0.00008799409,0.0008948619,0.0003442751,0.00007619576,0.0003719086,0.0004473518,0.3871354,0.004902437,0.5865284,0.003938532,0.01492987],"study_design_scores_gemma":[0.00001559034,0.00002688997,0.0002537026,0.00009040225,0.00001876556,0.00006724855,0.00005870117,0.7983368,0.001100102,0.1990769,0.0009276407,0.0000272099],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3474912,0.01081326,0.5752709,0.004662523,0.0003955002,0.00008373956,0.001021564,0.0003929774,0.0598684],"genre_scores_gemma":[0.9793722,0.003790712,0.01148523,0.0002267318,0.000402468,0.000138166,0.0002126315,0.00007369437,0.004298219],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003339488,"threshold_uncertainty_score":0.01643461,"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."}}