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 "spatially coupled ldpc codes constructed from protographs"):
  Abstract: In this paper, we construct protograph-based spatially coupled low-density parity-check (LDPC) codes by coupling together a series of    $L$    disjoint, or uncoupled, LDPC code Tanner graphs into a single coupled chain. By varying    $L$   , we obtain a flexible family of code ensembles with varying rates and frame lengths that can share the same encoding and decoding architecture for arbitrary    $L$   . We demonstrate that the resulting codes combine the best features of optimized irregular and regular codes in one design: capacity approaching iterative belief propagation (BP) decoding thresholds and linear growth of minimum distance with block length. In particular, we show that, for sufficiently large    $L$   , the BP thresholds on both the binary erasure channel and the binary-input additive white Gaussian noise channel saturate to a particular value significantly better than the BP decoding threshold and numerically indistinguishable from the optimal maximum  a posteriori  decoding threshold of the uncoupled LDPC code. When all variable nodes in the coupled chain have degree greater than two, asymptotically the error probability converges at least doubly exponentially with decoding iterations and we obtain sequences of asymptotically good LDPC codes with fast convergence rates and BP thresholds close to the Shannon limit. Further, the gap to capacity decreases as the density of the graph increases, opening up a new way to construct capacity achieving codes on memoryless binary-input symmetric-output channels with low-complexity BP decoding.

Includes members:
  Member "performance comparison of ldpc block and spatially coupled codes over gf q":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting")
  Member "deterministic constructions for large girth protograph ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures")
  Member "spatially coupled ensembles universally achieve capacity under belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "lossy source coding via spatially coupled ldgm ensembles":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")
  Member "spatially coupled random access on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reliability latency performance of frameless aloha with and without feedback")
  Member "windowed decoding of protograph based ldpc convolutional codes over erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")
  Member "threshold saturation on channels with memory via spatial coupling":
    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 "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)