{"id":"W2516324260","doi":"10.1109/tcomm.2016.2602342","title":"Approximation of Achievable Rates in Additive Gaussian Mixture Noise Channels","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Entropy (arrow of time); Gaussian noise; Gaussian; Amplitude; Upper and lower bounds; Differential entropy; Piecewise; Binary entropy function; Control theory (sociology); Algorithm; Principle of maximum entropy; Mathematical analysis; Computer science; Statistics; Physics","routes":{"ca_aff":true,"ca_fund":true,"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.0001743535,0.0001604166,0.0001992952,0.000337789,0.000146131,0.00001540945,0.0007485097,0.0001051577,0.0001159114],"category_scores_gemma":[0.00001286892,0.0001358642,0.00008693219,0.0005421787,0.0001420998,0.000291904,0.000006799909,0.0002783881,0.00006351803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001015032,"about_ca_system_score_gemma":0.00003276196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003035815,"about_ca_topic_score_gemma":0.0002355472,"domain_scores_codex":[0.9990516,0.0001249901,0.0003931539,0.0001309614,0.0001080257,0.0001912163],"domain_scores_gemma":[0.9975668,0.0004254603,0.00006351635,0.00179808,0.0000842338,0.00006192894],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002884269,0.006212731,0.0002906398,0.0003272777,0.0007628635,0.0000035092,0.01081003,0.1026583,0.3891046,0.01981482,0.005470857,0.4642559],"study_design_scores_gemma":[0.004563652,0.0003286172,0.003789448,0.001746376,0.000176111,0.00001849905,0.001109139,0.1761499,0.765131,0.005022385,0.04039888,0.001565999],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04627461,0.001328008,0.9210177,0.00466246,0.0006175301,0.001110454,0.0008527954,0.0006204473,0.02351599],"genre_scores_gemma":[0.9919792,0.003112076,0.004208197,0.00002163652,0.00001116312,0.0002825022,0.0000242272,0.00003237751,0.0003286475],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9457046,"threshold_uncertainty_score":0.5540381,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0205449356752734,"score_gpt":0.2573660085841491,"score_spread":0.2368210729088757,"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."}}