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 "performance improvement of iterative multiuser detection for large sparsely spread cdma systems by spatial coupling"):
  Abstract: Kudekar  et al.  proved that the belief-propagation (BP) performance for low-density parity check codes can be boosted up to the maximum  a posteriori  (MAP) performance by spatial coupling. In this paper, spatial coupling is applied to sparsely spread code-division multiple-access systems to improve the performance of iterative multiuser detection based on BP. Two iterative receivers based on BP are considered: 1) one receiver is based on exact BP and 2) the other on an approximate BP with Gaussian approximation. The performance of the two BP receivers is evaluated via density evolution (DE) in the dense limit after taking the large-system limit, in which the number of users and the spreading factor tend to infinity while their ratio is kept constant. The two BP receivers are shown to achieve the same performance as each other in these limits. Furthermore, taking a continuum limit for the obtained DE equations implies that the performance of the two BP receivers can be improved up to the performance achieved by the symbol-wise MAP detection, called individually optimal detection, via spatial coupling. Numerical simulations show that spatial coupling can provide a significant improvement in bit-error rate for finite-sized systems especially in the region of high system loads.

Includes members:
  Member "iterative multiuser detection and decoding with spatially coupled interleaving":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "iterative lmmse channel estimation multiuser detection and decoding via spatial coupling")
  Member "thresholds of spatially coupled systems via lyapunov s method":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "peeling close to the orientability threshold spatial coupling in hashing based data structures")
  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 "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 "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")
  Member "information theoretically optimal compressed sensing via spatial coupling and approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")

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)