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 ensembles universally achieve capacity under belief propagation"):
  Abstract: We investigate spatially coupled code ensembles. For transmission over the binary erasure channel, it was recently shown that spatial coupling increases the belief propagation threshold of the ensemble to essentially the maximum a-priori threshold of the underlying component ensemble. This explains why convolutional LDPC ensembles, originally introduced by Felstrom and Zigangirov, perform so well over this channel. We show that the equivalent result holds true for transmission over general binary-input memoryless output-symmetric channels. More precisely, given a desired error probability and a gap to capacity, we can construct a spatially coupled ensemble which fulfills these constraints universally on this class of channels under belief propagation decoding. In fact, most codes in that ensemble have that property. The quantifier universal refers to the single ensemble/code which is good for all channels but we assume that the channel is known at the receiver. The key technical result is a proof that under belief propagation decoding spatially coupled ensembles achieve essentially the area threshold of the underlying uncoupled ensemble. We conclude by discussing some interesting open problems.

Includes members:
  Member "a simple proof of threshold saturation for coupled scalar recursions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "peeling close to the orientability threshold spatial coupling in hashing based data structures")
  Member "universal bounds on the scaling behavior of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polar codes simplicity random codes durability")
  Member "windowed decoding of protograph based ldpc convolutional codes over erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")
  Member "chains of mean field models":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "universal sparse superposition codes with spatial coupling and gamp decoding")
  Member "a phenomenological study on threshold improvement via spatial coupling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "peeling close to the orientability threshold spatial coupling in hashing based data structures")
  Member "wave like solutions of general one dimensional spatially coupled systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the velocity of the propagating wave for spatially coupled systems with applications to ldpc codes")
  Member "extended extremes of information combining":
    also connected through other hyperedges:
      (none)
  Member "threshold saturation on channels with memory via spatial coupling":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)