{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003312653,0.0001207262,0.00009130211,0.0001424371,0.0002576296,0.00008829095,0.0003294144,0.00008048855,0.00004439458],"category_scores_gemma":[0.000007684526,0.00009884317,0.00007907436,0.0001485015,0.00005712264,0.0007952858,6.165681e-7,0.0002578593,0.00004900857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007432503,"about_ca_system_score_gemma":0.0000107973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003057485,"about_ca_topic_score_gemma":0.000005775268,"domain_scores_codex":[0.9994137,0.00002928201,0.0002631932,0.0000493583,0.00009964652,0.0001448458],"domain_scores_gemma":[0.9992226,0.0002057228,0.00004371349,0.000423235,0.0000682246,0.00003645203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001690884,0.0001081889,2.709913e-7,0.0001022503,0.0001177705,8.247618e-8,0.01565024,0.1106131,0.0008484594,0.1783775,0.002944502,0.6910685],"study_design_scores_gemma":[0.001182682,0.0004559861,0.0002517491,0.0001995579,0.00009275619,0.00002423136,0.002175397,0.5821549,0.2509549,0.1160705,0.04551071,0.0009266047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008550455,0.00002519136,0.9915543,0.000529199,0.0002730726,0.0003550279,0.00004832701,0.0007273623,0.005632489],"genre_scores_gemma":[0.9980506,0.0001160287,0.001031616,0.0005413071,0.00001709729,0.0001871856,0.000006622665,0.000008748274,0.00004083743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9971955,"threshold_uncertainty_score":0.4030707,"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."}}