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 "fundamental limits of many user mac with finite payloads and fading"):
  Abstract: Consider a (multiple-access) wireless communication system where users are connected to a unique base station over a shared-spectrum radio links. Each user has a fixed number $k$ of bits to send to the base station, and his signal gets attenuated by a random channel gain (quasi-static fading). In this paper we consider the many-user asymptotics of Chen-Chen-Guo'2017, where the number of users grows linearly with the blocklength. In addition, we adopt a per-user probability of error criterion of Polyanskiy'2017 (as opposed to classical joint-error probability criterion). Under these two settings we derive bounds on the optimal required energy-per-bit for reliable multi-access communication. We confirm the curious behaviour (previously observed for non-fading MAC) of the possibility of perfect multi-user interference cancellation for user densities below a critical threshold. Further we demonstrate the suboptimality of standard solutions such as orthogonalization (i.e., TDMA/FDMA) and treating interference as noise (i.e. pseudo-random CDMA without multi-user detection).

Includes members:
  Member "on the fundamental limits of mimo massive multiple access channels":
    also connected through other hyperedges:
      (none)
  Member "compressed neighbour discovery using sparse kerdock matrices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "kerdock codes determine unitary 2 designs")
  Member "capacity of gaussian many access channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "unsourced multiuser sparse regression codes achieve the symmetric mac capacity")
  Member "quasi static simo fading channels at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint power control and rate allocation enabling ultra reliability and energy efficiency in simo wireless networks")
  Member "quasi static multiple antenna fading channels at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust urllc packet scheduling of ofdm systems")
  Member "approximate sparsity pattern recovery information theoretic lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "understanding phase transitions via mutual information and mmse")
  Member "the sampling rate distortion tradeoff for sparsity pattern recovery in compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "unsourced multiuser sparse regression codes achieve the symmetric mac capacity")

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)