human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "on pseudocodewords and decision regions of linear programming decoding of hdpc codes"):
  Abstract: In this paper we explore the decision regions of Linear Programming (LP) decoding. We compare the decision regions of an LP decoder, a Belief Propagation (BP) decoder and the optimal Maximum Likelihood (ML) decoder. We study the effect of minimal-weight pseudocodewords on LP decoding. We present global optimization as a method for finding the minimal pseudoweight of a given code as well as the number of minimal-weight generators. We present a complete pseudoweight distribution for the [24; 12; 8] extended Golay code, and provide justifications of why the pseudoweight distribution alone cannot be used for obtaining a tight upper bound on the error probability.

Includes members:
  Member "polytope of correct linear programming decoding and low weight pseudo codewords":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the admm penalized decoder for ldpc codes")
  Member "lower bounds on the minimum pseudodistance for linear codes with q ary psk modulation over awgn":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on pseudocodewords and improved union bound of linear programming decoding of hdpc codes")
  Member "a decomposition theory for binary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the number of circuits in regular matroids with connections to lattices and codes")
  Member "reducing the error floor":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mathematical programming decoding of binary linear codes theory and algorithms")
  Member "pseudo codeword analysis of tanner graphs from projective and euclidean planes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "pseudocodeword free criterion for codes with cycle free tanner graph")
  Member "the extraction and complexity limits of graphical models for linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the treewidth of mds and reed muller codes")
  Member "on the minimal pseudo codewords of codes from finite geometries":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "minimum pseudo weight and minimum pseudo codewords of ldpc codes")
  Member "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis")

Question: Please tell me which class the source paper 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)