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: "bounds on the pseudo weight of minimal pseudo codewords of projective geometry codes"
  Abstract: In this paper we focus our attention on a family of finite geometry codes, called type-I projective geometry low-density parity-check (PG-LDPC) codes, that are constructed based on the projective planes PG{2,q). In particular, we study their minimal codewords and pseudo-codewords, as it is known that these vectors characterize completely the code performance under maximum-likelihood decoding and linear programming decoding, respectively. The main results of this paper consist of upper and lower bounds on the pseudo-weight of the minimal pseudo-codewords of type-I PG-LDPC codes.

Connected through hyperedge HE-1 (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"
    - "pseudo codewords of cycle codes via zeta functions"
    - "pseudocodewords of tanner graphs"

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

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)