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 "bayesian receiver design for grant free noma with message passing based structured signal estimation"):
  Abstract: Grant-free non-orthogonal multiple access (NOMA) is promising to achieve low latency massive access in Internet of Things (IoT) applications. In grant-free NOMA, pilot signals are often used for user activity detection (UAD) and channel estimation (CE) prior to multiuser detection (MUD) of active users. However, the pilot overhead makes the communications inefficient for IoT devices with sporadic transmissions and short data packets, or when the channel coherence time is short. Hence, it is desirable to improve the efficiency by avoiding the use of pilot signals, which can also further achieve lower latency. This work focuses on Bayesian receiver design for grant-free low density signature orthogonal frequency division multiplexing (LDS-OFDM), where each user is allocated a unique low density spreading sequence. We propose to use the low density spreading sequences for active user detection, thereby avoiding the use of pilot signals. Firstly, the task of joint UAD, CE and MUD is formulated as a structured signal estimation problem. Then message passing based Bayesian approach is developed to solve the structured signal estimation problem. In particular, belief propagation (BP), expectation propagation (EP) and mean field (MF) message passing are used to develop efficient hybrid message passing algorithms to achieve trade-off between performance and complexity. Simulation results demonstrate the effectiveness of the proposed receiver for grant-free LDS-OFDM without the use of pilot signals.

Includes members:
  Member "joint activity detection and channel estimation for iot networks phase transition and computation estimation tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (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-3 (induced by source paper "sparse optimization for green edge ai inference")
  Member "massive non orthogonal multiple access for cellular iot potentials and limitations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mimo noma networks relying on reconfigurable intelligent surface a signal cancellation based design")
  Member "massive machine type communications in 5g physical and mac layer solutions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "five disruptive technology directions for 5g":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deep learning enabled optimization of downlink beamforming under per antenna power constraints algorithms and experimental demonstration")
  Member "expectation propagation for approximate bayesian inference":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "bayesian deep learning and a probabilistic perspective of generalization")
  Member "a generalized mean field algorithm for variational inference in exponential families":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "variational template machine for data to text generation")

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)