{"id":"W2062610219","doi":"10.1109/tit.2008.2009807","title":"Capacity Bounds for the Gaussian Interference Channel","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":469,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Gaussian; Gaussian random field; Mathematics; Topology (electrical circuits); Range (aeronautics); Interference (communication); Gaussian noise; Upper and lower bounds; Channel (broadcasting); Channel capacity; Algorithm; Gaussian function; Combinatorics; Computer science; Physics; Telecommunications; Mathematical analysis; Engineering","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.002627486,0.001600455,0.001141431,0.001985133,0.0009770385,0.00313116,0.001626702,0.0009339676,0.008903166],"category_scores_gemma":[0.01239864,0.0004823364,0.0008172149,0.002052431,0.002189124,0.003838337,0.003038947,0.002480283,0.001648862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003384129,"about_ca_system_score_gemma":0.00184563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005097008,"about_ca_topic_score_gemma":0.002766867,"domain_scores_codex":[0.9975851,0.0005126205,0.00008652682,0.0002616874,0.0009657447,0.0005882925],"domain_scores_gemma":[0.987653,0.007512302,0.0009079862,0.00121712,0.002386453,0.0003231469],"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.0003054754,0.00007752555,0.0006115282,0.0005764106,0.0001040431,0.0002882814,0.0004649713,0.3882209,0.006935594,0.5253878,0.01982208,0.05720542],"study_design_scores_gemma":[0.00001868237,0.00006481454,0.0006168742,0.0001840968,0.00005440885,0.0003640664,0.0001433939,0.7314339,0.005556625,0.2509314,0.01053352,0.00009821082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03309005,0.009430734,0.8739548,0.001874779,0.0003468505,0.0000974529,0.00102491,0.0009113202,0.07926905],"genre_scores_gemma":[0.9060059,0.01037859,0.06812173,0.0009507249,0.00108423,0.0005150446,0.001247769,0.0003200447,0.01137595],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008903166,"threshold_uncertainty_score":0.02978408,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01790983207713149,"score_gpt":0.2350918578325372,"score_spread":0.2171820257554058,"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."}}