{"id":"W2964307264","doi":"10.1109/isit.2011.6033717","title":"On the capacity of the K-user cyclic Gaussian interference channel","year":2011,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Interference (communication); Channel (broadcasting); Gaussian; Topology (electrical circuits); Channel capacity; Dimension (graph theory); Constant (computer programming); Power (physics); Upper and lower bounds; Telecommunications; Computer science; Mathematics; Physics; Combinatorics; Mathematical analysis; Quantum mechanics","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.0001084636,0.00006964862,0.00006778265,0.00002319811,0.00003466805,0.000006087695,0.0006927648,0.00004009682,0.0002082006],"category_scores_gemma":[0.00002541012,0.00003606544,0.00003843672,0.0000956128,0.00007849998,0.00004176109,0.00009570063,0.0001886997,0.00002055916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001474824,"about_ca_system_score_gemma":0.000002841887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001133548,"about_ca_topic_score_gemma":0.0001140885,"domain_scores_codex":[0.9996368,0.00004158626,0.0001174836,0.00005164308,0.00007049454,0.00008198642],"domain_scores_gemma":[0.9990947,0.00006070346,0.00002505359,0.0007848854,0.00001965133,0.00001501087],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000005641782,0.00008009524,0.0004458354,0.00003025444,0.00004011921,1.368515e-7,0.008883154,0.00004426489,0.009836629,0.9740334,0.005829626,0.0007708129],"study_design_scores_gemma":[0.00006593471,0.00003392967,0.01412997,0.0001162732,0.000006501023,0.00000176191,0.0003008623,0.004094388,0.950622,0.0293335,0.001129416,0.0001654687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7299045,0.00002371043,0.008744852,0.0006082001,0.0001040606,0.0002354043,0.000004391465,0.0004555853,0.2599193],"genre_scores_gemma":[0.9993228,0.00002404822,0.0003907048,0.0001326115,0.000004801883,0.00002383142,1.911701e-7,0.00001048365,0.00009055419],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9446999,"threshold_uncertainty_score":0.227965,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05032718656413263,"score_gpt":0.2200281588524418,"score_spread":0.1697009722883092,"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."}}