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 new insight into gamp and amp"):
  Abstract: A concise expectation propagation (EP)-based message passing algorithm (MPA) is derived for the general measurement channel. By neglecting some high-order infinitesimal terms, the EP-MPA is proven to be equivalent to the generalized approximate message passing (GAMP), which exploits central limit theorem and Taylor expansion to simplify the belief propagation process. Furthermore, for additive white Gaussian noise measurement channels, EP-MPA is proven to be equivalent to the AMP. Such intrinsic equivalence between EP and GAMP/AMP offers a new insight into GAMP and AMP via a unified message passing rule for non-linear processing and may provide clues toward building new MPAs in solving more general non-linear problems.

Includes members:
  Member "capacity achieving mimo noma iterative lmmse detection":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity optimality of amp in coded systems")
  Member "capacity optimality of amp in coded systems":
    also connected through other hyperedges:
      (none)
  Member "a unified bayesian inference framework for generalized linear models":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "expectation propagation line spectral estimation")
  Member "bilinear adaptive generalized vector approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "expectation propagation line spectral estimation")
  Member "gaussian message passing for overloaded massive mimo noma":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "code domain noma in massive mimo when is it needed")
  Member "massive connectivity with massive mimo part i device activity detection and channel estimation":
    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 "beam on graph simultaneous channel estimation for mmwave mimo systems with multiple users":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "bandit inspired beam searching scheme for mmwave high speed train communications")
  Member "rigorous dynamics of expectation propagation based signal recovery from unitarily invariant measurements":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "inference in multi layer networks with matrix valued unknowns")

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)