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 "multiuser detection for random access bandwidth request in wimax"):
  Abstract: Random access is a multiple access communication protocol where the users simultaneously communicate with a base station (BS) in an uncoordinated fashion. In this work, we consider the problem of multiuser detection in a random access bandwidth request context. We propose an enhanced random access scheme where the fixed/low-mobility M2M devices pre-equalize their random access codes using the estimated frequency response of the slowly-varying wireless channel. Consequently, we have developed two different multiuser detection algorithms. The first algorithm works in a greedy fashion where it performs cross-correlation of the received signal with a set of decoder sequences and detects active users based on the correlation output. We derive the condition under which the algorithm can detect a given number of active users with high probability. Subsequently, we demonstrate an efficient decoder design procedure which enhances the user detection performance. A basis mismatched sparse recovery technique has been applied in the second algorithm which exploit an inherent structure of the random access protocol. The performance of the proposed schemes is demonstrated in a WiMAX network environment.

Includes members:
  Member "a scalable hybrid mac protocol for massive m2m networks":
    also connected through other hyperedges:
      (none)
  Member "on off random access channels a compressed sensing framework":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "random access in c ran for user activity detection with limited capacity fronthaul")

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)