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 "spatially coupled mackay neal codes universally achieve the symmetric information rate of arbitrary generalized erasure channels with memory"):
  Abstract: This paper investigates the belief propagation decoding of spatially-coupled MacKay-Neal (SC-MN) codes over erasure channels with memory. We show that SC-MN codes with bounded degree universally achieve the symmetric information rate (SIR) of arbitrary erasure channels with memory. We mean by universality the following sense: the sender does not need to know the whole channel statistics but needs to know only the SIR, while the receiver estimates the transmitted codewords from channel statistics and received words. The proof is based on potential function.

Includes members:
  Member "a simple proof of maxwell saturation for coupled scalar recursions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "spatially coupled mackay neal codes with no bit nodes of degree two achieve the capacity of bec":
    also connected through other hyperedges:
      (none)
  Member "a simple proof of threshold saturation for coupled scalar recursions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "peeling close to the orientability threshold spatial coupling in hashing based data structures")
  Member "spatially coupled ensembles universally achieve capacity under belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "a phenomenological study on threshold improvement via spatial coupling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "peeling close to the orientability threshold spatial coupling in hashing based data structures")
  Member "threshold saturation on channels with memory via spatial coupling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spatially coupled ldpc codes constructed from protographs")
  Member "spatially coupled mackay neal codes and hsu anastasopoulos codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finite length scaling based on belief propagation for spatially coupled ldpc codes")
  Member "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec":
    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)