human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "achieving large sum rate and good fairness in miso broadcast communication"):
  Abstract: A tradeoff between sum rate and fairness for MISO broadcast communication employing dirty paper coding or zero-forcing dirty paper coding at physical layer is investigated in this paper. The tradeoff is based on a new design objective termed "tri-stage" approach as well as a new L1-based fairness measure that is much more robust than the well-known Jain's index for comparing fairness levels achieved by various design objectives at a much finer resolution in high SNR regime. The newly proposed tri-stage design also introduces a new concept of statistical power allocation that randomly allocates powers to users based on an optimal probability distribution derived from the tradeoff between sum rate and fairness. Simulation results show that the proposed approach can simultaneously achieve a larger sum rate and better fairness than the reputable proportional fairness criterion. A performance upper bound is also given in the paper to show that the excellent performance of the proposed approach at moderate and high SNR regimes as well as some potential for further improvement in low SNR regime.

Includes members:
  Member "a generalized zero forcing precoder with successive dirty paper coding in miso broadcast channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a high diversity transceiver design for k user miso broadcast channels")
  Member "improving the performance of the zero forcing multiuser miso downlink precoder through user grouping":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a generalized zero forcing precoder with successive dirty paper coding in miso broadcast channels")
  Member "a low complexity channel shortening receiver with diversity support for evolved 2g device":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "beyond massive mimo the potential of data transmission with large intelligent surfaces")
  Member "an alternative proof for the capacity region of the degraded gaussian mimo broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "piggybacking codes for network coding the high low snr regime")
  Member "an axiomatic theory of fairness in network resource allocation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fair resource allocation in federated learning")
  Member "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coexistence mechanism between embb and urllc in 5g wireless networks")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)