{"id":"W2468432040","doi":"10.1109/tcomm.2016.2582873","title":"Source-Interference Recovery Over Broadcast Channels: Asymptotic Bounds and Analog Codes","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Upper and lower bounds; Encoder; Algorithm; Gaussian; Mathematics; Fading; Decoding methods; Dirty paper coding; Distortion (music); Computer science; Topology (electrical circuits); Telecommunications; Channel (broadcasting); Precoding; MIMO; Statistics; Bandwidth (computing); Combinatorics","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.0001853408,0.0002244587,0.0002257891,0.0002874363,0.0003821853,0.0001039291,0.0009574473,0.0001403287,0.0001225999],"category_scores_gemma":[0.00001278754,0.0002051177,0.00009203101,0.0002840689,0.0003324354,0.000376769,0.00001931553,0.0003881844,0.00007136853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001528758,"about_ca_system_score_gemma":0.00002436481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007094807,"about_ca_topic_score_gemma":0.0003047384,"domain_scores_codex":[0.9989153,0.0001513056,0.0003497504,0.0002055509,0.0001350316,0.0002431246],"domain_scores_gemma":[0.996756,0.0006691749,0.00005589196,0.002325454,0.00008213027,0.0001113542],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007413093,0.0008091487,0.0001942667,0.000118326,0.0005912003,0.000001214057,0.003121905,0.007314535,0.03853502,0.005625059,0.003585561,0.9400296],"study_design_scores_gemma":[0.005821356,0.001593936,0.00324657,0.006398134,0.0007323854,0.0002818559,0.00138214,0.3321184,0.2401155,0.0282246,0.3738253,0.006259878],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01828195,0.001124766,0.9742087,0.001189717,0.000206584,0.0002553933,0.0001067991,0.001278551,0.003347598],"genre_scores_gemma":[0.980201,0.0153156,0.003638484,0.00008653035,0.0000158112,0.0001969654,0.000007212598,0.00005398361,0.0004844245],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9705701,"threshold_uncertainty_score":0.8364457,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02450506105799535,"score_gpt":0.2561437748499788,"score_spread":0.2316387137919834,"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."}}