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: "characterizations of pseudo codewords of ldpc codes"
  Abstract: An important property of high-performance, low complexity codes is the existence of highly efficient algorithms for their decoding. Many of the most efficient, recent graph-based algorithms, e.g. message passing algorithms and decoding based on linear programming, crucially depend on the efficient representation of a code in a graphical model. In order to understand the performance of these algorithms, we argue for the characterization of codes in terms of a so called fundamental cone in Euclidean space which is a function of a given parity check matrix of a code, rather than of the code itself. We give a number of properties of this fundamental cone derived from its connection to unramified covers of the graphical models on which the decoding algorithms operate. For the class of cycle codes, these developments naturally lead to a characterization of the fundamental polytope as the Newton polytope of the Hashimoto edge zeta function of the underlying graph.

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"
    - "pseudocodeword weights for non binary ldpc codes"

Connected through hyperedge HE-2 (induced by source paper "on the pseudocodeword redundancy"):
  with members:
    - "a decomposition theory for binary linear codes"
    - "pseudo codeword analysis of tanner graphs from projective and euclidean planes"
    - "on the stopping distance and the stopping redundancy of 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 "the trapping redundancy of linear block codes"):
  with members:
    - "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes"
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "on the hardness of approximating stopping and trapping sets in ldpc codes"
    - "shortened array codes of large girth"
    - "improving convergence of belief propagation decoding"
    - "a general computation rule for lossy summaries messages with examples from equalization"
    - "on the stopping distance and the stopping redundancy of codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "a cutting plane method based on redundant rows for improving fractional distance"):
  with members:
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "pseudo codeword landscape"
    - "guessing facets polytope structure and improved lp decoder"
    - "adaptive methods for linear programming decoding"
    - "minimum pseudo weight and minimum pseudo codewords of ldpc codes"
    - "on the stopping distance and the stopping redundancy of codes"
    - "improved upper bounds on stopping redundancy"

Connected through hyperedge HE-5 (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"
    - "pseudocodeword weights for non binary ldpc codes"
    - "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-6 (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"
    - "pseudocodeword weights for non binary ldpc codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-7 (induced by source paper "linear programming receivers"):
  with members:
    - "graph based decoding in the presence of isi"
    - "linear programming decoding of nonbinary linear codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-8 (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"
    - "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"
    - "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"

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)