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 "on the fundamental limits of mimo massive access communication"):
  Abstract: The multiple access channel (MAC) with many-user is a general model for massive machine type communications. In this paradigm, the number of users may be comparable or even larger than the coding blocklength $n$. In contrast, classical MAC often assumes fixed and small number of the users. In this paper, we consider the massive access channel with multiple antennas system, where the base station (BS) with multiple receiving antennas serves the users in a single cell. The magnitude of users is assumed to grow unbounded with $n$. We investigate the achievable region of MIMO massive access channel, where among the total users, an unknown subset referred to active users may transmit data periodically. The asymptotic active user identification cost is also quantified. With the theoretical analysis, it was shown that given finite number of the receiving antennas, the individual rate for each user can be formulated as the sum rate multiplied by some specific factors, which correspond to the allocation of sum capacity. The successive decoding does not apply due to the interferences from growing unbounded users. Theoretical analysis shows that successive decoding works only when the number of receiving antennas goes to infinity with the increasing codelength.

Includes members:
  Member "fundamental limits of many user mac with finite payloads and fading":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gaussian multiple and random access in the finite blocklength regime")
  Member "massive mimo unsourced random access":
    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 "sparse activity detection for massive connectivity":
    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 "massive connectivity with massive mimo part ii achievable rate characterization":
    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 "a new scaling law for activity detection in massive mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a dimension reduction based joint activity detection and channel estimation algorithm for massive access")
  Member "massive connectivity with massive mimo part i device activity detection and channel estimation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "faster activity and data detection in massive random access a multi armed bandit approach")
  Member "fundamental limits of low density spreading noma with fading":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "non orthogonal multiple access with orthogonal time frequency space signal transmission")

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)