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 "the complexity rate tradeoff of centralized radio access networks"):
  Abstract: In a centralized radio access network (RAN), the signals from multiple radio access points (RAPs) are centrally processed in a data center. A centralized RAN enables advanced interference coordination strategies while leveraging the elastic provisioning of data processing resources. It is particularly well suited for dense deployments, such as within a large building where the RAPs are connected via fiber and where many cells are underutilized. This paper considers the computational requirements of a centralized RAN with the goal of illuminating the benefits of pooling computational resources. A new analytical framework is proposed for quantifying the computational load associated with the centralized processing of uplink signals in the presence of block Rayleigh fading, a distance-dependent path loss, and fractional power control. Several new performance metrics are defined, including the computational outage probability, the outage complexity, the computational gain, the computational diversity, and the complexity–rate tradeoff. The validity of the analytical framework is confirmed by numerically comparing it with a simulator compliant with the 3GPP LTE standard. Using the developed metrics, it is shown that centralizing computing resources provides a higher net throughput per computational resource as compared with local processing.

Includes members:
  Member "the role of computational outage in dense cloud based centralized radio access networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "complexity aware scheduling for an ldpc encoded c ran uplink")
  Member "towards a communication theoretic understanding of system level power consumption":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy efficient beam coordination strategies with rate dependent processing power")
  Member "fundamental rate reliability complexity limits in outage limited mimo communications":
    also connected through other hyperedges:
      (none)

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)