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: "on the minimal pseudo codewords of codes from finite geometries"
  Abstract: In order to understand the performance of a code under maximum-likelihood (ML) decoding, it is crucial to know the minimal codewords. In the context of linear programming (LP) decoding, it turns out to be necessary to know the minimal pseudo-codewords. This paper studies the minimal codewords and minimal pseudo-codewords of some families of codes derived from projective and Euclidean planes. Although our numerical results are only for codes of very modest length, they suggest that these code families exhibit an interesting property. Namely, all minimal pseudo-codewords that are not multiples of a minimal codeword have an AWGNC pseudo-weight that is strictly larger than the minimum Hamming weight of the code. This observation has positive consequences not only for LP decoding but also for iterative decoding

Connected through hyperedge HE-1 (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"
    - "pseudo codeword analysis of tanner graphs from projective and euclidean planes"
    - "the extraction and complexity limits of graphical models for linear codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-2 (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"
    - "tree based construction of ldpc codes having good pseudocodeword weights"
    - "pseudo codewords of cycle codes via zeta functions"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-3 (induced by source paper "bounds on the threshold of linear programming decoding"):
  with members:
    - "on the block error probability of lp decoding 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"

Connected through hyperedge HE-4 (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"
    - "bounds on the pseudo weight of minimal pseudo codewords of projective geometry codes"
    - "the benefit of thresholding in lp decoding of ldpc codes"
    - "pseudo codewords of cycle codes via zeta functions"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-5 (induced by source paper "on minimal pseudo codewords of tanner graphs from projective planes"):
  with members:
    - "pseudo codewords of cycle codes via zeta functions"

Connected through hyperedge HE-6 (induced by source paper "bounds on the pseudo weight of minimal pseudo codewords of projective geometry codes"):
  with members:
    - "on minimal pseudo codewords of tanner graphs from projective planes"

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)