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: "turbo decoding on the binary erasure channel finite length analysis and turbo stopping sets"
  Abstract: This paper is devoted to the finite-length analysis of turbo decoding over the binary erasure channel (BEC). The performance of iterative belief-propagation (BP) decoding of low-density parity-check (LDPC) codes over the BEC can be characterized in terms of stopping sets. We describe turbo decoding on the BEC which is simpler than turbo decoding on other channels. We then adapt the concept of stopping sets to turbo decoding and state an exact condition for decoding failure. Apply turbo decoding until the transmitted codeword has been recovered, or the decoder fails to progress further. Then the set of erased positions that will remain when the decoder stops is equal to the unique maximum-size turbo stopping set which is also a subset of the set of erased positions. Furthermore, we present some improvements of the basic turbo decoding algorithm on the BEC. The proposed improved turbo decoding algorithm has substantially better error performance as illustrated by the given simulation results. Finally, we give an expression for the turbo stopping set size enumerating function under the uniform interleaver assumption, and an efficient enumeration algorithm of small-size turbo stopping sets for a particular interleaver. The solution is based on the algorithm proposed by Garello et al. in 2001 to compute an exhaustive list of all low-weight codewords in a turbo code.

Connected through hyperedge HE-1 (induced by source paper "edge coloring and stopping sets analysis in product codes with mds components"):
  with members:
    - "a bound on rate of codes with locality with sequential recovery from multiple erasures"
    - "reed muller codes achieve capacity on erasure channels"
    - "reed muller codes achieve capacity on the binary erasure channel under map decoding"
    - "codes with locality for two erasures"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "irregular product codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-2 (induced by source paper "asymptotic analysis and spatial coupling of counter braids"):
  with members:
    - "spatially coupled turbo like codes"
    - "deterministic and ensemble based spatially coupled product codes"
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "spatially coupled ldpc codes for decode and forward relaying of two correlated sources over the bec"
    - "approaching the rate distortion limit with spatial coupling belief propagation and decimation"
    - "threshold saturation in spatially coupled constraint satisfaction problems"
    - "lossy source coding via spatially coupled ldgm ensembles"
    - "approaching capacity at high rates with iterative hard decision decoding"

Connected through hyperedge HE-3 (induced by source paper "fountain uncorrectable sets and finite length analysis"):
  with members:
    - "complete enumeration of stopping sets of full rank parity check matrices of hamming codes"

Connected through hyperedge HE-4 (induced by source paper "minimum pseudoweight analysis of 3 dimensional turbo codes"):
  with members:
    - "counting in graph covers a combinatorial characterization of the bethe entropy function"
    - "analysis and design of tuned turbo codes"
    - "polytope of correct linear programming decoding and low weight pseudo codewords"
    - "exposing pseudoweight layers in regular ldpc code ensembles"
    - "on maximum contention free interleavers and permutation polynomials over integer rings"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-5 (induced by source paper "good concatenated code ensembles for the binary erasure channel"):
  with members:
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "on the stopping distance and the stopping redundancy of codes"

Connected through hyperedge HE-6 (induced by source paper "irregular turbo code design for the binary erasure channel"):
  with members:
    - "minimum delay decoding of turbo codes for upper layer fec"
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"

Connected through hyperedge HE-7 (induced by source paper "minimum delay decoding of turbo codes for upper layer fec"):
  with members:
    - "on quasi cyclic interleavers for parallel turbo codes"
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"

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)