human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding"):
  with members:
    - "sparse regression codes"
    - "the error probability of sparse superposition codes with approximate message passing decoding"
    - "spatially coupled sparse regression codes design and state evolution analysis"
    - "finite sample analysis of approximate message passing algorithms"
    - "techniques for improving the finite length performance of sparse superposition codes"
    - "approximate message passing decoder and capacity achieving sparse superposition codes"
    - "capacity achieving sparse superposition codes via approximate message passing decoding"
    - "universal sparse superposition codes with spatial coupling and gamp decoding"

Connected through hyperedge HE-2 (induced by source paper "compressed coding amp based decoding and analog spatial coupling"):
  with members:
    - "analysis of approximate message passing with non separable denoisers and markov random field priors"
    - "approximate message passing decoder and capacity achieving sparse superposition codes"
    - "capacity achieving sparse superposition codes via approximate message passing decoding"
    - "universal sparse superposition codes with spatial coupling and gamp decoding"
    - "state evolution for approximate message passing with non separable functions"
    - "generalized approximate message passing decoder for universal sparse superposition codes"
    - "threshold saturation of spatially coupled sparse superposition codes for all memoryless channels"
    - "approximate message passing with spatially coupled structured operators with applications to compressed sensing and sparse superposition codes"

Connected through hyperedge HE-3 (induced by source paper "analysis and optimization of tail biting spatially coupled protograph ldpc codes for bicm id systems"):
  with members:
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
    - "efficient search of compact qc ldpc and sc ldpc convolutional codes with large girth"
    - "improving the decoding threshold of tailbiting spatially coupled ldpc codes by energy shaping"
    - "compact qc ldpc block and sc ldpc convolutional codes for low latency communications"
    - "design and analysis of time invariant sc ldpc convolutional codes with small constraint length"
    - "wave like decoding of tail biting spatially coupled ldpc codes through iterative demapping"
    - "finite length analysis of spatially coupled regular ldpc ensembles on burst erasure channels"
    - "efficient multi dimensional mapping using qam constellations for bicm id"

Connected through hyperedge HE-4 (induced by source paper "sparse regression codes"):
  with members:
    - "the error probability of sparse superposition codes with approximate message passing decoding"
    - "sparcs for unsourced random access"
    - "spatially coupled sparse regression codes design and state evolution analysis"
    - "techniques for improving the finite length performance of sparse superposition codes"
    - "approximate message passing decoder and capacity achieving sparse superposition codes"
    - "capacity achieving sparse superposition codes via approximate message passing decoding"
    - "the rate distortion function and excess distortion exponent of sparse regression codes with optimal encoding"
    - "universal sparse superposition codes with spatial coupling and gamp decoding"

Connected through hyperedge HE-5 (induced by source paper "a combinatorial methodology for optimizing non binary graph based codes theoretical analysis and applications in data storage"):
  with members:
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
    - "spatially coupled code design for partial response channels optimal object minimization approach"
    - "a generalized algebraic approach to optimizing sc ldpc codes"
    - "high performance non binary spatially coupled codes for flash memories"
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "iterative decoding of ldpc codes over the q ary partial erasure channel"
    - "thresholds of absorbing sets in low density parity check codes"

Connected through hyperedge HE-6 (induced by source paper "spatially coupled ldpc codes with sub block locality"):
  with members:
    - "ldpc codes with local and global decoding"
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
    - "multi block interleaved codes for local and global read access"
    - "integrated interleaved codes as locally recoverable codes properties and performance"
    - "a family of optimal locally recoverable codes"
    - "multi dimensional spatially coupled codes"
    - "new codes on graphs constructed by connecting spatially coupled chains"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"

Connected through hyperedge HE-7 (induced by source paper "spatially coupled generalized ldpc codes asymptotic analysis and finite length scaling"):
  with members:
    - "a refined scaling law for spatially coupled ldpc codes over the binary erasure channel"
    - "design of ldpc code ensembles with fast convergence properties"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "on the minimum distance of generalized spatially coupled ldpc codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding"

Connected through hyperedge HE-8 (induced by source paper "spatially coupled ldpc codes with non uniform coupling for improved decoding speed"):
  with members:
    - "avoiding burst like error patterns in windowed decoding of spatially coupled ldpc codes"
    - "non uniformly coupled ldpc codes better thresholds smaller rate loss and less complexity"
    - "the velocity of the decoding wave for spatially coupled codes on bms channels"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "on the convergence speed of spatially coupled ldpc ensembles"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "windowed decoding of spatially coupled codes"

Question: Please tell me which class the center node 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)