{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001453544,0.001034186,0.0007426278,0.001059291,0.0006783705,0.001654577,0.000896565,0.0006023788,0.003757835],"category_scores_gemma":[0.008717126,0.0003299856,0.0004545799,0.00144515,0.003134898,0.002320684,0.001955262,0.001599009,0.0008177863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001594405,"about_ca_system_score_gemma":0.001140844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002735113,"about_ca_topic_score_gemma":0.0008255911,"domain_scores_codex":[0.9988538,0.0003875647,0.0000278108,0.0001092935,0.0003146389,0.0003068958],"domain_scores_gemma":[0.9930593,0.005362849,0.0003339613,0.0003685474,0.0007214623,0.0001539775],"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.0003848895,0.00004194241,0.0005378576,0.0003248261,0.00005219414,0.0003589489,0.0004836304,0.329076,0.009482933,0.6305659,0.003968915,0.02472189],"study_design_scores_gemma":[0.00002317068,0.00007915071,0.0005070181,0.0001771466,0.00003030766,0.0003000118,0.0001662433,0.7066758,0.006948687,0.2797234,0.00530702,0.0000619956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.1587757,0.009359634,0.7193974,0.002339942,0.0001932637,0.00007273845,0.0006197864,0.00038867,0.1088529],"genre_scores_gemma":[0.9743239,0.004150079,0.01706857,0.0002429595,0.0002246817,0.0001359316,0.0001755762,0.00008739346,0.003591036],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.003757835,"threshold_uncertainty_score":0.01257122,"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."}}