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 "a random access protocol for pilot allocation in crowded massive mimo systems"):
  Abstract: The massive multiple-input multiple-output (MIMO) technology has great potential to manage the rapid growth of wireless data traffic. Massive MIMO achieves tremendous spectral efficiency by spatial multiplexing many tens of user equipments (UEs). These gains are only achieved in practice if many more UEs can connect efficiently to the network than today. As the number of UEs increases, while each UE intermittently accesses the network, the random access functionality becomes essential to share the limited number of pilots among the UEs. In this paper, we revisit the random access problem in the Massive MIMO context and develop a reengineered protocol, termed  strongest-user collision resolution  (SUCRe). An accessing UE asks for a dedicated pilot by sending an uncoordinated random access pilot, with a risk that other UEs send the same pilot. The favorable propagation of massive MIMO channels is utilized to enable distributed collision detection at each UE, thereby determining the strength of the contenders’ signals and deciding to repeat the pilot if the UE judges that its signal at the receiver is the strongest. The SUCRe protocol resolves the vast majority of all pilot collisions in crowded urban scenarios and continues to admit UEs efficiently in overloaded networks.

Includes members:
  Member "random access in uplink massive mimo systems how to exploit asynchronicity and excess antennas":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "timing advance estimation and beamforming of random access response in crowded tdd massive mimo systems")
  Member "massive mimo ten myths and one critical question":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deep learning for massive mimo channel state acquisition and feedback")
  Member "random access for massive mimo systems with intra cell pilot contamination":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient pilot allocation for urllc traffic in 5g industrial iot networks")
  Member "random access protocol for massive mimo strongest user collision resolution sucr":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient pilot allocation for urllc traffic in 5g industrial iot networks")
  Member "massive mimo for crowd scenarios a solution based on random access":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient pilot allocation for urllc traffic in 5g industrial iot networks")
  Member "three practical aspects of massive mimo intermittent user activity pilot synchronism and asymmetric deployment":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "asynchronous downlink massive mimo networks a stochastic geometry approach")
  Member "coded random access applying codes on graphs to design random access protocols":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "massive unsourced random access based on uncoupled compressive sensing another blessing of massive mimo")
  Member "massive mimo systems with non ideal hardware energy efficiency estimation and capacity limits":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the pilot contamination attack in multi cell multiuser massive mimo 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)