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 "a separation algorithm for improved lp decoding of linear block codes"):
  Abstract: Maximum Likelihood (ML) decoding is the optimal decoding algorithm for arbitrary linear block codes and can be written as an Integer Programming (IP) problem. Feldman et al. relaxed this IP problem and presented Linear Programming (LP) based decoding algorithm for linear block codes. In this paper, we propose a new IP formulation of the ML decoding problem and solve the IP with generic methods. The formulation uses indicator variables to detect violated parity checks. We derive Gomory cuts from our formulation and use them in a separation algorithm to find ML codewords. We further propose an efficient method of finding cuts induced by redundant parity checks (RPC). Under certain circumstances we can guarantee that these RPC cuts are valid and cut off the fractional optimal solutions of LP decoding. We demonstrate on two LDPC codes and one BCH code that our separation algorithm performs significantly better than LP decoding.

Includes members:
  Member "efficient implementation of linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adaptive linear programming decoding of nonbinary linear codes over prime fields")
  Member "probabilistic analysis of linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the admm penalized decoder for ldpc codes")
  Member "a cutting plane method based on redundant rows for improving fractional distance":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "impact of redundant checks on the lp decoding thresholds of ldpc codes")
  Member "pseudo codeword landscape":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis")
  Member "guessing facets polytope structure and improved lp decoder":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "belief propagation for linear programming")
  Member "adaptive methods for linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis")
  Member "reducing the error floor":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "mathematical programming decoding of binary linear codes theory and algorithms")
  Member "loop calculus helps to improve belief propagation and linear programming decodings of low density parity check codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "belief propagation bethe approximation and polynomials")

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)