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 "adaptive pilot clustering in heterogeneous massive mimo networks"):
  Abstract: We consider the uplink of a cellular massive multiple-input multiple-output network. Acquiring channel state information at the base stations (BSs) requires uplink pilot signaling. Since the number of orthogonal pilot sequences is limited by the channel coherence, pilot reuse across cells is necessary to achieve high spectral efficiency. However, finding efficient pilot reuse patterns is non-trivial, especially in practical asymmetric BS deployments. We approach this problem using the coalitional game theory. Each BS has a few unique pilots and can form coalitions with other BSs to gain access to more pilots. The BSs in a coalition, thus, benefit from serving more users in their cells at the expense of higher pilot contamination and interference. Given that a cell’s average spectral efficiency depends on the overall pilot reuse pattern, the suitable coalitional game model is in the partition form. We develop a low-complexity distributed coalition formation based on individual stability. By incorporating a BS intercommunication budget constraint, we are able to control the overhead in message exchange between the BSs and ensure the algorithm’s convergence to a solution of the game called individually stable coalition structure. Simulation results reveal fast algorithmic convergence and substantial performance gains over the baseline schemes with no pilot reuse, full pilot reuse, or random pilot reuse pattern.

Includes members:
  Member "pilot clustering in asymmetric massive mimo networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "channel coherence classification with frame shifting in massive mimo systems")
  Member "massive mimo with non ideal arbitrary arrays hardware scaling laws and circuit aware design":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint power control and lsfd for wireless powered cell free massive mimo")
  Member "coalitional games in miso interference channels epsilon core and coalition structure stable set":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed clustering for multiuser networks through coalition formation")
  Member "blind pilot decontamination":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the pilot contamination attack in multi cell multiuser massive mimo networks")
  Member "massive mimo for maximal spectral efficiency how many users and pilots should be allocated":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "massive mimo for internet of things iot connectivity")
  Member "scaling up mimo opportunities and challenges with very large arrays":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "a coordinated approach to channel estimation in large scale multiple antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the pilot contamination attack in multi cell multiuser massive mimo networks")
  Member "coalitional games in partition form for joint spectrum sensing and access in cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "shipper cooperation in stochastic drone delivery a dynamic bayesian game approach")

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)