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 "many access for small packets based on precoding and sparsity aware recovery"):
  Abstract: Modern mobile terminals produce massive small data packets. For these short-length packets, it is inefficient to follow the current multiple access schemes to allocate transmission resources due to heavy signaling overhead. We propose a non-orthogonal many-access scheme that is well suited for the future communication systems equipped with many receive antennas. The system is modeled as having a block-sparsity pattern with unknown sparsity level (i.e., unknown number of transmitted messages). Block precoding is employed at each single-antenna transmitter to enable the simultaneous transmissions of many users. The number of simultaneously served active users is allowed to be even more than the number of receive antennas. Sparsity-aware recovery is designed at the receiver for joint user detection and symbol demodulation. To reduce the effects of channel fading on signal recovery, normalized block orthogonal matching pursuit (BOMP) algorithm is introduced, and based on its approximate performance analysis, we develop interference cancellation based BOMP (ICBOMP) algorithm. The ICBOMP performs error correction and detection in each iteration of the normalized BOMP. Simulation results demonstrate the effectiveness of the proposed scheme in small packet services, as well as the advantages of ICBOMP in improving signal recovery accuracy and reducing computational cost.

Includes members:
  Member "capacity of gaussian many access channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "unsourced multiuser sparse regression codes achieve the symmetric mac capacity")
  Member "a novel uplink data transmission scheme for small packets in massive mimo system":
    also connected through other hyperedges:
      (none)
  Member "many access channels the gaussian case with random user activities":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "gaussian multiple and random access in the finite blocklength regime")
  Member "scma codebook design":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "design of scma codebooks using differential evolution")
  Member "massive mimo for next generation wireless systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint power control and lsfd for wireless powered cell free massive mimo")
  Member "scaling up mimo opportunities and challenges with very large arrays":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "downlink secrecy rate of one bit massive mimo system with active eavesdropping")
  Member "near oracle performance of greedy block sparse estimation techniques from noisy measurements":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "improved support recovery guarantees for the group lasso with applications to structural health monitoring")
  Member "structured compressed sensing from theory to applications":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "serial quantization for sparse time sequences")

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)