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 "multiple preambles for high success rate of grant free random access with massive mimo"):
  Abstract: Grant-free random access (RA) with massive MIMO is a promising RA technique with low signaling overhead that provides significant benefits in increasing the channel reuse efficiency. Since user equipment (UE) detection and channel estimation in grant-free RA rely solely on the received preambles, preamble designs that enable high success rate of UE detection and channel estimation are very much in need to ensure the performance gain of grant-free RA with massive MIMO. In this paper, a super preamble consisting of multiple consecutive preambles is proposed for high success rate of grant-free RA with massive MIMO. With the proposed approach, the success of UE detection and channel estimation for a RA UE depends on two conditions: 1) it is a solvable UE; 2) its super preamble is detected. Accordingly, we theoretically analyze the solvable rate of RA UEs with multiple preambles and propose a reliable UE detection algorithm to obtain the super preambles of RA UEs by exploiting the quasi-orthogonality characteristic of massive MIMO. Theoretical analysis and simulation results show that turning a preamble into a super preamble consisting of two or three shorter preambles, the success rate of UE detection and channel estimation could be significantly increased using the proposed approach.

Includes members:
  Member "grant free massive mtc enabled massive mimo a compressive sensing approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "faster activity and data detection in massive random access a multi armed bandit approach")
  Member "success probability of grant free random access with massive mimo":
    also connected through other hyperedges:
      (none)
  Member "sparse signal processing for grant free massive connectivity a future paradigm for random access protocols in the internet of things":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sparse optimization for green edge ai inference")
  Member "a random access protocol for pilot allocation in crowded massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "massive mimo asymptotics for ray based propagation channels")
  Member "frameless aloha with reliability latency guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reliability latency performance of frameless aloha with and without feedback")
  Member "random pilot and data access in massive mimo for machine type communications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on throughput of compressive random access for one short message delivery in iot")
  Member "random access protocols for massive mimo":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "massive mimo for internet of things iot connectivity")

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)