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 "finite length scaling based on belief propagation for spatially coupled ldpc codes"):
  Abstract: The equivalence of peeling decoding (PD) and Belief Propagation (BP) for low-density parity-check (LDPC) codes over the binary erasure channel is analyzed. Modifying the scheduling for PD, it is shown that exactly the same variable nodes (VNs) are resolved in every iteration than with BP. The decrease of erased VNs during the decoding process is analyzed instead of resolvable equations. This quantity can also be derived with density evolution, resulting in a drastic decrease in complexity. Finally, a scaling law using this quantity is established for spatially coupled LDPC codes.

Includes members:
  Member "spatially coupled ldpc codes constructed from protographs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")
  Member "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  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 "exact free distance and trapping set growth rates for ldpc convolutional codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "probabilistic mimo symbol detection with expectation consistency approximate inference")
  Member "spatially coupled mackay neal codes and hsu anastasopoulos codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "performance improvement of iterative multiuser detection for large sparsely spread cdma systems by spatial coupling")
  Member "finite length scaling for iteratively decoded ldpc ensembles":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")

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)