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 minimal pseudo codewords of tanner graphs from projective planes"
  Abstract: We would like to better understand the fundamental cone of Tanner graphs derived from finite projective planes. Towards this goal, we discuss bounds on the AWGNC and BSC pseudo-weight of minimal pseudo-codewords of such Tanner graphs, on one hand, and study the structure of minimal pseudo-codewords, on the other.

Connected through hyperedge HE-1 (induced by source paper "spectral graph analysis of quasi cyclic codes"):
  with members:
    - "pseudo codeword analysis of tanner graphs from projective and euclidean planes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

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

Connected through hyperedge HE-3 (induced by source paper "minimum pseudo weight and minimum pseudo codewords of ldpc codes"):
  with members:
    - "characterizations of pseudo codewords of ldpc codes"
    - "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"
    - "pseudo codewords of cycle codes via zeta functions"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-4 (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 the minimal pseudo codewords of codes from finite geometries"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

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

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 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)