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 "compressed coding amp based decoding and analog spatial coupling"):
  Abstract: This paper considers a compressed coding (CC) scheme that combines compressed sensing with forward error control coding. Approximate message passing (AMP) is used to decode the message. Based on the state evolution analysis of AMP, we derive the performance limit of the CC scheme. We show that the CC scheme can approach Gaussian capacity at a very high compression ratio. Further, the results are extended to systems involving non-linear effects such as clipping. We show that the capacity approaching property can still be maintained when generalized AMP is used to decode the message.  To approach the capacity, a low-rate underlying code should be designed according to the curve matching principle, which is complicated in practice. Instead, analog spatial coupling (ASC) is used to avoid sophisticated low-rate code design. In the end, we study ASC-CC in a multiuser environment, where ASC can be realized in a distributive way. The overall block length can be shared by many users, which reduces block length per-user.

Includes members:
  Member "analysis of approximate message passing with non separable denoisers and markov random field priors":
    also connected through other hyperedges:
      (none)
  Member "approximate message passing decoder and capacity achieving sparse superposition codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "capacity achieving sparse superposition codes via approximate message passing decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "universal sparse superposition codes with spatial coupling and gamp decoding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "state evolution for approximate message passing with non separable functions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "unsourced multiuser sparse regression codes achieve the symmetric mac capacity")
  Member "generalized approximate message passing decoder for universal sparse superposition codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a new insight into gamp and amp")
  Member "threshold saturation of spatially coupled sparse superposition codes for all memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sparse regression codes")
  Member "spatially coupled ldpc codes constructed from protographs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")

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)