{"id":"W3194645875","doi":"10.1109/tit.2021.3104847","title":"Uplink-Downlink Duality Between Multiple-Access and Broadcast Channels With Compressing Relays","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Hong Kong Polytechnic University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Telecommunications link; Relay; Computer science; Duality (order theory); Beamforming; Channel (broadcasting); Computer network; Mathematical optimization; Mathematics; Power (physics); Telecommunications; Discrete mathematics","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.0004488875,0.0001511793,0.0001696172,0.0001425462,0.0006380094,0.0006074759,0.0004297296,0.00006800026,0.00004151813],"category_scores_gemma":[0.00001556679,0.0001365708,0.00004333595,0.0004750305,0.00009157486,0.002940784,0.00002210348,0.0003231084,0.0000305664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004169335,"about_ca_system_score_gemma":0.0000744042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003162866,"about_ca_topic_score_gemma":0.000007419133,"domain_scores_codex":[0.9988643,0.0002474558,0.0003426481,0.0001816493,0.0001868211,0.0001771268],"domain_scores_gemma":[0.998526,0.0004317548,0.0001136357,0.0005776992,0.0002525786,0.00009837901],"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.00006550726,0.00009033736,0.0001745424,0.00005556724,0.00009643959,0.000002842406,0.007006702,0.04054008,0.0001578423,0.02199279,0.00008502589,0.9297323],"study_design_scores_gemma":[0.005762824,0.0003487814,0.006300436,0.0008388876,0.0001194516,0.0002301061,0.001259687,0.8633127,0.09188072,0.00605288,0.02212939,0.001764082],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009035875,0.00007371909,0.9880829,0.0006859326,0.0002304881,0.0002042858,0.00001248108,0.0001847124,0.001489555],"genre_scores_gemma":[0.9923896,0.0002336552,0.006486553,0.0006877667,0.00002748873,0.0000433494,0.00001677272,0.000006623355,0.0001081565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9833537,"threshold_uncertainty_score":0.5857904,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0421963491770048,"score_gpt":0.2839745709020353,"score_spread":0.2417782217250305,"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."}}