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 codewords of cycle codes via zeta functions"
  Abstract: Cycle codes are a special case of low-density parity-check (LDPC) codes and as such can be decoded using an iterative message-passing decoding algorithm on the associated Tanner graph. The existence of pseudo-codewords is known to cause the decoding algorithm to fail in certain instances. In this paper, we draw a connection between pseudo-codewords of cycle codes and the so-called edge zeta function of the associated normal graph and show how the Newton polyhedron of the zeta function equals the fundamental cone of the code, which plays a crucial role in characterizing the performance of iterative decoding algorithms.

Connected through hyperedge HE-1 (induced by source paper "on characterization of elementary trapping sets of variable regular ldpc codes"):
  with members:
    - "lowering the error floor of ldpc codes using cyclic liftings"
    - "on the dynamics of the error floor behavior in regular ldpc codes"
    - "trapping set enumerators for repeat multiple accumulate code ensembles"
    - "the trapping redundancy of linear block codes"
    - "a general method for finding low error rates of ldpc codes"

Connected through hyperedge HE-2 (induced by source paper "discrete geometric analysis of message passing algorithm on graphs"):
  with members:
    - "loopy belief propagation for approximate inference an empirical study"
    - "expectation propagation for approximate bayesian inference"
    - "belief optimization for binary networks a stable alternative to loopy belief propagation"
    - "graph zeta function in the bethe free energy and loopy belief propagation"
    - "approximate inference on planar graphs using loop calculus and belief propagation"
    - "gaussian belief propagation solver for systems of linear equations"
    - "belief propagation and beyond for particle tracking"
    - "polynomial linear programming with gaussian belief propagation"

Connected through hyperedge HE-3 (induced by source paper "graph zeta function in the bethe free energy and loopy belief propagation"):
  with members:
    - "loopy belief propagation for approximate inference an empirical study"
    - "sufficient conditions for convergence of the sum product algorithm"

Connected through hyperedge HE-4 (induced by source paper "pseudo codeword analysis of tanner graphs from projective and euclidean planes"):
  with members:
    - "minimum pseudo weight and minimum pseudo codewords of ldpc codes"
    - "bounds on the threshold of linear programming decoding"
    - "characterizations of pseudo codewords of ldpc codes"
    - "on minimal pseudo codewords of tanner graphs from projective planes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "bounds on the pseudo weight of minimal pseudo codewords of projective geometry codes"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-5 (induced by source paper "minimum pseudo weight and minimum pseudo codewords of ldpc codes"):
  with members:
    - "characterizations of pseudo codewords of ldpc codes"
    - "on minimal pseudo codewords of tanner graphs from projective planes"
    - "on the stopping distance and the stopping redundancy of codes"
    - "tree based construction of ldpc codes"
    - "on the minimal pseudo codewords of codes from finite geometries"
    - "tree based construction of ldpc codes having good pseudocodeword weights"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-6 (induced by source paper "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"):
  with members:
    - "characterizations of pseudo codewords of ldpc codes"
    - "on minimal pseudo codewords of tanner graphs from projective planes"
    - "on the minimal pseudo codewords of codes from finite geometries"
    - "bounds on the pseudo weight of minimal pseudo codewords of projective geometry codes"
    - "the benefit of thresholding in lp decoding of ldpc codes"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-7 (induced by source paper "pseudocodewords of tanner graphs"):
  with members:
    - "on the stopping distance and the stopping redundancy of codes"
    - "the benefit of thresholding in lp decoding of ldpc codes"

Connected through hyperedge HE-8 (induced by source paper "on minimal pseudo codewords of tanner graphs from projective planes"):
  with members:
    - "on the minimal pseudo codewords of codes from finite geometries"

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)