{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003014445,0.001460674,0.001326054,0.001812197,0.0007723332,0.002959145,0.001865242,0.001162266,0.003466343],"category_scores_gemma":[0.02234848,0.0006325657,0.0006432174,0.001983525,0.003812242,0.004682073,0.00246826,0.002322319,0.000467774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002344121,"about_ca_system_score_gemma":0.001432159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002830752,"about_ca_topic_score_gemma":0.00126073,"domain_scores_codex":[0.9979658,0.000759268,0.00007412553,0.0002073753,0.0004885943,0.0005048413],"domain_scores_gemma":[0.9741715,0.02202496,0.001046661,0.0009712329,0.001401317,0.0003842733],"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.0003064078,0.00008003675,0.0006485305,0.000351804,0.00007914836,0.0003377942,0.0003940291,0.431893,0.00387317,0.5469205,0.002963204,0.01215234],"study_design_scores_gemma":[0.00001747337,0.00002971476,0.0002394303,0.0001155464,0.00002150338,0.00006784286,0.00005523891,0.7741016,0.001089047,0.2233494,0.0008803401,0.00003291597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2913657,0.011605,0.6374626,0.003928633,0.0003555138,0.0000874738,0.001080859,0.0004492302,0.05366498],"genre_scores_gemma":[0.97922,0.004125617,0.01216145,0.0002270167,0.0003903321,0.0001578804,0.0002298871,0.00008368326,0.003404056],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003466343,"threshold_uncertainty_score":0.01700783,"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."}}