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: "lower bounds on the minimum pseudodistance for linear codes with q ary psk modulation over awgn"
  Abstract: We present lower bounds on the minimum pseudocodeword effective Euclidean distance (or minimum "pseudodistance") for coded modulation systems using linear codes with $q$-ary phase-shift keying (PSK) modulation over the additive white Gaussian noise (AWGN) channel. These bounds apply to both binary and nonbinary coded modulation systems which use direct modulation mapping of coded symbols. The minimum pseudodistance may serve as a first-order measure of error-correcting performance for both linear-programming and message-passing based receivers. In the case of a linear-programming based receiver, the minimum pseudodistance may be used to form an exact bound on the codeword error rate of the system.

Connected through hyperedge HE-1 (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"
    - "pseudo codeword analysis of tanner graphs from projective and euclidean planes"
    - "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-2 (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"
    - "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"
    - "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-3 (induced by source paper "linear programming decoding of nonbinary linear codes"):
  with members:
    - "codeword independent performance of nonbinary linear codes under linear programming and sum product decoding"
    - "pseudo codeword landscape"
    - "pseudocodeword weights for non binary ldpc codes"
    - "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"
    - "characterizations of pseudo codewords of ldpc codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

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)