human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "spatially coupled ldpc codes with non uniform coupling for improved decoding speed"):
  with members:
    - "avoiding burst like error patterns in windowed decoding of spatially coupled ldpc codes"
    - "non uniformly coupled ldpc codes better thresholds smaller rate loss and less complexity"
    - "the velocity of the decoding wave for spatially coupled codes on bms channels"
    - "spatially coupled ldpc codes constructed from protographs"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "windowed decoding of spatially coupled codes"

Connected through hyperedge HE-2 (induced by source paper "design of irregular sc ldpc codes with non uniform degree distributions by linear programing"):
  with members:
    - "on the design of fast convergent ldpc codes for the bec an optimization approach"
    - "spatially coupled ldpc codes constructed from protographs"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "spatially coupled sparse codes on graphs theory and practice"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "spatially coupled repeat accumulate codes"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Connected through hyperedge HE-3 (induced by source paper "the velocity of the propagating wave for spatially coupled systems with applications to ldpc codes"):
  with members:
    - "analysis of coupled scalar systems by displacement convexity"
    - "the velocity of the propagating wave for general coupled scalar systems"
    - "the velocity of the decoding wave for spatially coupled codes on bms channels"
    - "finite length scaling based on belief propagation for spatially coupled ldpc codes"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "approaching the rate distortion limit with spatial coupling belief propagation and decimation"

Connected through hyperedge HE-4 (induced by source paper "continuous transmission of spatially coupled ldpc code chains"):
  with members:
    - "spatially coupled ldpc codes constructed from protographs"
    - "triggering wave like convergence of tail biting spatially coupled ldpc codes"
    - "triggering wave like convergence of tail biting spatially coupled ldpc codes single and dual channel setup"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"
    - "terminated and tailbiting spatially coupled codes with optimized bit mappings for spectrally efficient fiber optical systems"
    - "new codes on graphs constructed by connecting spatially coupled chains"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"

Connected through hyperedge HE-5 (induced by source paper "the velocity of the propagating wave for general coupled scalar systems"):
  with members:
    - "analysis of coupled scalar systems by displacement convexity"
    - "the velocity of the decoding wave for spatially coupled codes on bms channels"
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "threshold saturation in spatially coupled constraint satisfaction problems"
    - "displacement convexity a useful framework for the study of spatially coupled codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "chains of mean field models"
    - "approaching capacity at high rates with iterative hard decision decoding"

Connected through hyperedge HE-6 (induced by source paper "the velocity of the decoding wave for spatially coupled codes on bms channels"):
  with members:
    - "analysis of coupled scalar systems by displacement convexity"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "displacement convexity a useful framework for the study of spatially coupled codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "chains of mean field models"
    - "wave like solutions of general one dimensional spatially coupled systems"

Connected through hyperedge HE-7 (induced by source paper "non uniformly coupled ldpc codes better thresholds smaller rate loss and less complexity"):
  with members:
    - "the velocity of the decoding wave for spatially coupled codes on bms channels"
    - "spatially coupled ldpc codes constructed from protographs"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "efficient termination of spatially coupled codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "windowed decoding of spatially coupled codes"
    - "threshold saturation on bms channels via spatial coupling"

Connected through hyperedge HE-8 (induced by source paper "advances in detection and error correction for coherent optical communications regular irregular and spatially coupled ldpc code designs"):
  with members:
    - "spatially coupled sparse codes on graphs theory and practice"
    - "improving soft fec performance for higher order modulations via optimized bit channel mappings"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "a pragmatic coded modulation scheme for high spectral efficiency fiber optic communications"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "staircase codes fec for 100 gb s otn"
    - "analysis and design of binary message passing decoders"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Question: Please tell me which class the center node 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)