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 "low complexity antenna selection for low target rate users in dense cloud radio access networks"):
  Abstract: We propose a low complexity antenna selection algorithm for low target rate users in cloud radio access networks. The algorithm consists of two phases: In the first phase, each remote radio head (RRH) determines whether to be included in a candidate set by using a predefined selection threshold. In the second phase, RRHs are randomly selected within the candidate set made in the first phase. To analyze the performance of the proposed algorithm, we model RRHs and users locations by a homogeneous Poisson point process, whereby the signal-to-interference ratio (SIR) complementary cumulative distribution function is derived. By approximating the derived expression, an approximate optimum selection threshold that maximizes the SIR coverage probability is obtained. Using the obtained threshold, we characterize the performance of the algorithm in an asymptotic regime where the RRH density goes to infinity. The obtained threshold is then modified depending on various algorithm options. A distinguishable feature of the proposed algorithm is that the algorithm complexity keeps constant independent to the RRH density, so that a user is able to connect to a network without heavy computation at baseband units.

Includes members:
  Member "cooperative base station coloring for pair wise multi cell coordination":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "large scale convex optimization for dense wireless cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "large scale beamforming for massive mimo via randomized sketching")
  Member "the complexity rate tradeoff of centralized radio access networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "complexity aware scheduling for an ldpc encoded c ran uplink")
  Member "a stochastic geometry framework for analyzing pairwise cooperative cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "spectral efficiency of dynamic coordinated beamforming a stochastic geometry approach":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "the role of computational outage in dense cloud based centralized radio access networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "complexity aware scheduling for an ldpc encoded c ran uplink")
  Member "user centric intercell interference nulling for downlink small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "modeling analysis and optimization of caching in multi antenna small cell networks")
  Member "joint power and antenna selection optimization in large cloud radio access networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "stochastic successive convex optimization for two timescale hybrid precoding in massive mimo")

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)