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 "minimum pseudoweight analysis of 3 dimensional turbo codes"):
  Abstract: In this paper, we consider pseudocodewords of (relaxed) linear programming (LP) decoding of 3-dimensional turbo codes (3D-TCs). We present a relaxed LP decoder for 3D-TCs, adapting the relaxed LP decoder for conventional turbo codes proposed by Feldman in his thesis. We show that the 3D-TC polytope is proper and $C$-symmetric and make a connection to finite graph covers of the 3D-TC factor graph. This connection is used to show that the support set of any pseudocodeword is a stopping set of iterative decoding of 3D-TCs using maximum a posteriori constituent decoders on the binary erasure channel. Furthermore, we compute ensemble-average pseudoweight enumerators of 3D-TCs and perform a finite-length minimum pseudoweight analysis for small cover degrees. Moreover, an explicit description of the fundamental cone of the 3D-TC polytope is given. Finally, we present an extensive numerical study of small-to-medium block length 3D-TCs, which shows that 1) typically (i.e., in most cases), when the minimum distance $d_{min}$ and/or the stopping distance $h_{min}$ is high, the minimum pseudoweight (on the additive white Gaussian noise channel) is strictly smaller than both $d_{min}$ and $h_{min}$ and that 2) the minimum pseudoweight grows with the block length, at least for small-to-medium block lengths.

Includes members:
  Member "counting in graph covers a combinatorial characterization of the bethe entropy function":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "pseudocodeword based decoding of quantum stabilizer codes")
  Member "analysis and design of tuned turbo codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "spatially coupled turbo like codes")
  Member "polytope of correct linear programming decoding and low weight pseudo codewords":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the admm penalized decoder for ldpc codes")
  Member "exposing pseudoweight layers in regular ldpc code ensembles":
    also connected through other hyperedges:
      (none)
  Member "turbo decoding on the binary erasure channel finite length analysis and turbo stopping sets":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "edge coloring and stopping sets analysis in product codes with mds components")
  Member "on maximum contention free interleavers and permutation polynomials over integer rings":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "parallel interleaver design for a high throughput hspa lte multi standard turbo decoder")
  Member "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis")

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)