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 "pseudo codeword analysis of tanner graphs from projective and euclidean planes"):
  Abstract: In order to understand the performance of a code under maximum-likelihood (ML) decoding, one studies the codewords, in particular the minimal codewords, and their Hamming weights. In the context of linear programming (LP) decoding, one's attention needs to be shifted to the pseudo-codewords, in particular to the minimal pseudo-codewords, and their pseudo-weights. In this paper we investigate some families of codes that have good properties under LP decoding, namely certain families of low-density parity-check (LDPC) codes that are derived from projective and Euclidean planes: we study the structure of their minimal pseudo-codewords and give lower bounds on their pseudo-weight.

Includes members:
  Member "minimum pseudo weight and minimum pseudo codewords of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a cutting plane method based on redundant rows for improving fractional distance")
  Member "bounds on the threshold of linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "impact of redundant checks on the lp decoding thresholds of ldpc codes")
  Member "characterizations of pseudo codewords of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a unified framework for linear programming based communication receivers")
  Member "on minimal pseudo codewords of tanner graphs from projective planes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "spectral graph analysis of quasi cyclic codes")
  Member "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis")
  Member "bounds on the pseudo weight of minimal pseudo codewords of projective geometry codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes")
  Member "pseudo codewords of cycle codes via zeta functions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on characterization of elementary trapping sets of variable regular ldpc codes")
  Member "pseudocodewords of tanner graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "free pseudodistance growth rates for spatially coupled ldpc codes over the bec")

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)