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 "non uniformly coupled ldpc codes better thresholds smaller rate loss and less complexity"):
  Abstract: We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing the amount of coupling between spatial positions, we show that we can construct codes with excellent thresholds and small rate loss, even with the lowest possible smoothing parameter and large variable node degrees, which are required for low error floors. We also establish that the decoding convergence speed is faster with non-uniformly coupled codes, which we verify by density evolution of windowed decoding with a finite number of iterations. We also show that by only slightly increasing the smoothing parameter, practical codes with potentially low error floors and thresholds close to capacity can be constructed. Finally, we give some indications on protograph designs.

Includes members:
  Member "the velocity of the decoding wave for spatially coupled codes on bms channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "spatially coupled ldpc codes with non uniform coupling for improved decoding speed")
  Member "spatially coupled ldpc codes constructed from protographs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "a scaling law to predict the finite length performance of spatially coupled ldpc codes":
    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 "efficient termination of spatially coupled codes":
    also connected through other hyperedges:
      (none)
  Member "on the convergence speed of spatially coupled ldpc ensembles":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spatially coupled ldpc codes with non uniform coupling for improved decoding speed")
  Member "spatially coupled ensembles universally achieve capacity under belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  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")

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)