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: "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.

Connected through hyperedge HE-1 (induced by source paper "pseudocodeword free criterion for codes with cycle free tanner graph"):
  with members:
    - "on the pseudocodeword redundancy of binary linear codes"
    - "a decomposition theory for binary linear codes"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-2 (induced by source paper "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"):
  with members:
    - "searching for voltage graph based ldpc tailbiting codes with large girth"
    - "deriving good ldpc convolutional codes from ldpc block codes"
    - "lowering the error floor of ldpc codes using cyclic liftings"
    - "on distance properties of quasi cyclic protograph based ldpc codes"
    - "absdet pseudo codewords and perm pseudo codewords definitions and properties"
    - "adaptive methods for linear programming decoding"
    - "a new construction for ldpc codes using permutation polynomials over integer rings"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-3 (induced by source paper "on pseudocodewords and improved union bound of linear programming decoding of hdpc codes"):
  with members:
    - "on pseudocodewords and decision regions of linear programming decoding of hdpc codes"
    - "new techniques for upper bounding the ml decoding performance of binary linear codes"
    - "lower bounds on the minimum pseudodistance for linear codes with q ary psk modulation over awgn"
    - "relaxation bounds on the minimum pseudo weight of linear block codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "on pseudocodewords and decision regions of linear programming decoding of hdpc codes"):
  with members:
    - "polytope of correct linear programming decoding and low weight pseudo codewords"
    - "lower bounds on the minimum pseudodistance for linear codes with q ary psk modulation over awgn"
    - "a decomposition theory for binary linear codes"
    - "reducing the error floor"
    - "the extraction and complexity limits of graphical models for linear codes"
    - "on the minimal pseudo codewords of codes from finite geometries"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-5 (induced by source paper "on the pseudocodeword redundancy of binary linear codes"):
  with members:
    - "the trapping redundancy of linear block codes"
    - "a decomposition theory for binary linear codes"
    - "bounds on the threshold of linear programming decoding"
    - "on the stopping distance and the stopping redundancy of codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "improved upper bounds on stopping redundancy"

Connected through hyperedge HE-6 (induced by source paper "on the pseudocodeword redundancy"):
  with members:
    - "a decomposition theory for binary linear codes"
    - "characterizations of pseudo codewords of ldpc codes"
    - "on the stopping distance and the stopping redundancy of codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-7 (induced by source paper "instanton based techniques for analysis and reduction of error floors of ldpc codes"):
  with members:
    - "on trapping sets and guaranteed error correction capability of ldpc codes and gldpc codes"
    - "error correction capability of column weight three ldpc codes"
    - "probabilistic analysis of linear programming decoding"
    - "ldpc codes which can correct three errors under iterative decoding"
    - "error correction capability of column weight three ldpc codes"
    - "instanton analysis of low density parity check codes in the error floor regime"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-8 (induced by source paper "error bounds for repeat accumulate codes decoded via linear programming"):
  with members:
    - "probabilistic analysis of linear programming decoding"
    - "towards low complexity linear programming decoding"
    - "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)