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 "on the convergence speed of spatially coupled ldpc ensembles"):
  Abstract: Spatially coupled low-density parity-check codes show an outstanding performance under the low-complexity belief propagation (BP) decoding algorithm. They exhibit a peculiar convergence phenomenon above the BP threshold of the underlying non-coupled ensemble, with a wave-like convergence propagating through the spatial dimension of the graph, allowing to approach the MAP threshold. We focus on this particularly interesting regime in between the BP and MAP thresholds. #R##N#On the binary erasure channel, it has been proved that the information propagates with a constant speed toward the successful decoding solution. We derive an upper bound on the propagation speed, only depending on the basic parameters of the spatially coupled code ensemble such as degree distribution and the coupling factor $w$. We illustrate the convergence speed of different code ensembles by simulation results, and show how optimizing degree profiles helps to speed up the convergence.

Includes members:
  Member "a proof of threshold saturation for spatially coupled ldpc codes on bms channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analysis of coupled scalar systems by displacement convexity")
  Member "spatial coupling as a proof technique":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "concentration to zero bit error probability for regular ldpc codes on the binary symmetric channel proof by loop calculus")
  Member "a simple proof of threshold saturation for coupled scalar recursions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "wave like solutions of general one dimensional spatially coupled systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the velocity of the propagating wave for spatially coupled systems with applications to 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-6 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "windowed decoding of spatially coupled codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "non uniform windowed decoding for multi dimensional spatially coupled ldpc codes")
  Member "asymptotically regular ldpc codes with linear distance growth and thresholds close to capacity":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "spatially coupled ldpc codes constructed from protographs")

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)