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: "pseudocodeword weights for non binary ldpc codes"
  Abstract: Pseudocodewords of q-ary LDPC codes are examined and the weight of a pseudocodeword on the q-ary symmetric channel is defined. The weight definition of a pseudocodeword on the AWGN channel is also extended to two-dimensional q-ary modulation such as q-PAM and q-PSK. The tree-based lower bounds on the minimum pseudocodeword weight are shown to also hold for q-ary LDPC codes on these channels.

Connected through hyperedge HE-1 (induced by source paper "a unified framework for linear programming based communication receivers"):
  with members:
    - "joint decoding of ldpc codes and finite state channels via linear programming"
    - "graph based decoding in the presence of isi"
    - "interior point decoding for linear vector channels"
    - "interior point algorithms for linear programming decoding"
    - "linear programming decoding of nonbinary linear codes"
    - "codeword independent performance of nonbinary linear codes under linear programming and sum product decoding"
    - "towards low complexity linear programming decoding"
    - "characterizations of pseudo codewords of ldpc codes"

Connected through hyperedge HE-2 (induced by source paper "linear programming decoding of nonbinary linear codes"):
  with members:
    - "lower bounds on the minimum pseudodistance for linear codes with q ary psk modulation over awgn"
    - "codeword independent performance of nonbinary linear codes under linear programming and sum product decoding"
    - "pseudo codeword landscape"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "lower bounds on the minimum pseudodistance for linear codes with q ary psk modulation over awgn"):
  with members:
    - "polytope representations for linear programming decoding of non binary linear codes"
    - "linear programming decoding of nonbinary linear codes"
    - "codeword independent performance of nonbinary linear codes under linear programming and sum product decoding"
    - "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)