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 "success probability of grant free random access with massive mimo"):
  Abstract: Massive MIMO opens up new avenues for enabling highly efficient random access (RA) by offering abundance of spatial degrees of freedom. In this paper, we investigate the grant-free RA with massive MIMO and derive the analytic expressions of success probability of the grant-free RA for conjugate beamforming and zero-forcing beamforming techniques.With the derived analytic expressions, we further shed light on the impact of system parameters on the success probability. Simulation results verify the accuracy of the analyses. It is confirmed that the grant-free RA with massive MIMO is an attractive RA technique with low signaling overhead that could simultaneously accommodate a number of RA users, which is multiple times the number of RA channels, with close-to-one success probability. In addition, when the number of antennas in massive MIMO is sufficiently large, we show that the number of orthogonal preambles would dominate the success probability.

Includes members:
  Member "massive multiple access based on superposition raptor codes for cellular m2m communications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hybrid resource scheduling for aggregation in massive machine type communication networks")
  Member "random pilot and data access in massive mimo for machine type communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on throughput of compressive random access for one short message delivery in iot")
  Member "random access preamble design and detection for 3gpp narrowband iot systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "nb iot uplink receiver design and performance study")
  Member "rrh based massive mimo with on the fly pilot contamination control":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "random access for massive machine type communications")
  Member "random access protocols for massive mimo":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online estimation and adaptation for random access with successive interference cancellation")
  Member "a high throughput pilot allocation for m2m communication in crowded massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "massive mimo for internet of things iot connectivity")
  Member "random access protocol for massive mimo strongest user collision resolution sucr":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient pilot allocation for urllc traffic in 5g industrial iot networks")
  Member "massive mimo for next generation wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "joint power control and lsfd for wireless powered cell free 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)