{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00135072,0.0007144943,0.0007773779,0.0004572935,0.0004849998,0.001940227,0.0005708389,0.0006182536,0.002172249],"category_scores_gemma":[0.00363484,0.0003484556,0.0005674001,0.0006955125,0.001509474,0.001714634,0.001721813,0.0015308,0.0003883149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0011053,"about_ca_system_score_gemma":0.001244078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001032926,"about_ca_topic_score_gemma":0.0007299195,"domain_scores_codex":[0.99865,0.0005294685,0.00003729654,0.0001854892,0.0004073152,0.000190551],"domain_scores_gemma":[0.9974756,0.001648396,0.0002777125,0.0001467258,0.0003361816,0.0001154246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001614196,0.0001054904,0.0006561467,0.0001428071,0.00003332267,0.0003248469,0.0002889719,0.2103225,0.004632369,0.7546333,0.002503064,0.0261958],"study_design_scores_gemma":[0.00003883668,0.0001262914,0.0004815022,0.00003364363,0.00002454037,0.0005578666,0.0001672528,0.7421905,0.005334875,0.245105,0.005910351,0.00002934741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03153399,0.0005422777,0.9438791,0.0003363024,0.00005207909,0.00004500893,0.0001794803,0.00008372327,0.02334808],"genre_scores_gemma":[0.9088069,0.0008934921,0.08238123,0.0002743184,0.0001199469,0.0002014452,0.0002359829,0.00007130286,0.007015434],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002172249,"threshold_uncertainty_score":0.008019507,"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."}}