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 dimension reduction based joint activity detection and channel estimation algorithm for massive access"):
  Abstract: Grant-free random access is a promising protocol to support massive access in beyond fifth-generation (B5G) cellular Internet-of-Things (IoT) with sporadic traffic. Specifically, in each coherence interval, the base station (BS) performs joint activity detection and channel estimation (JADCE) before data transmission. Due to the deployment of a large-scale antennas array and the existence of a huge number of IoT devices, JADCE usually has high computational complexity and needs long pilot sequences. To solve these challenges, this paper proposes a dimension reduction method, which projects the original device state matrix to a low-dimensional space by exploiting its sparse and low-rank structure. Then, we develop an optimized design framework with a coupled full column rank constraint for JADCE to reduce the size of the search space. However, the resulting problem is non-convex and highly intractable, for which the conventional convex relaxation approaches are inapplicable. To this end, we propose a logarithmic smoothing method for the non-smoothed objective function and transform the interested matrix to a positive semidefinite matrix, followed by giving a Riemannian trust-region algorithm to solve the problem in complex field. Simulation results show that the proposed algorithm is efficient to a large-scale JADCE problem and requires shorter pilot sequences than the state-of-art algorithms which only exploit the sparsity of device state matrix.

Includes members:
  Member "design of non orthogonal beamspace multiple access for cellular internet of things":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "random access for massive machine type communications")
  Member "multi cell sparse activity detection for massive random access massive mimo versus cooperative mimo":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "phase transition analysis for covariance based massive random access with massive mimo")
  Member "improved scaling law for activity detection in massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "faster activity and data detection in massive random access a multi armed bandit approach")
  Member "grant free massive mtc enabled massive mimo a compressive sensing approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "faster activity and data detection in massive random access a multi armed bandit approach")
  Member "sparse activity detection for massive connectivity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "faster activity and data detection in massive random access a multi armed bandit approach")
  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-6 (induced by source paper "sparse optimization for green edge ai inference")
  Member "a new scaling law for activity detection in massive mimo systems":
    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 connectivity with massive mimo part i device activity detection and channel estimation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "faster activity and data detection in massive random access a multi armed bandit 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)