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 "new codes on graphs constructed by connecting spatially coupled chains"):
  Abstract: A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are described by protographs, comprised of several protograph-based chains characterizing individual SC-LDPC codes. We demonstrate that code ensembles obtained by connecting appropriately chosen SC-LDPC code chains at specific points have improved iterative decoding thresholds compared to those of single SC-LDPC coupled chains. In addition, it is shown that the improved decoding properties of the connected ensembles result in reduced decoding complexity required to achieve a specific bit error probability. The constructed ensembles are also asymptotically good, in the sense that the minimum distance grows linearly with the block length. Finally, we show that the improved asymptotic properties of the connected chain ensembles also translate into improved finite length performance.

Includes members:
  Member "a proof of threshold saturation for spatially coupled ldpc codes on bms channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analysis of coupled scalar systems by displacement convexity")
  Member "spatially coupled quasi cyclic quantum ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "constructions of quasi twisted quantum codes")
  Member "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "universality for the noisy slepian wolf problem via spatial coupling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "performance improvement of iterative multiuser detection for large sparsely spread cdma systems by spatial coupling")
  Member "multiple access demodulation in the lifted signal graph with spatial coupling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "universal sparse superposition codes with spatial coupling and gamp decoding")
  Member "coupled graphical models and their thresholds":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "rank one matrix estimation analysis of algorithmic and information theoretic limits by the spatial coupling method")
  Member "bilayer ldpc convolutional codes for half duplex relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "spatially coupled ldpc codes constructed from protographs")
  Member "improvement of bp based cdma multiuser detection by spatial coupling":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "compressed coding amp based decoding and analog spatial coupling")

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)