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 "reducing the error floor"):
  Abstract: We discuss how the loop calculus approach of [Chertkov, Chernyak '06], enhanced by the pseudo-codeword search algorithm of [Chertkov, Stepanov '06] and the facet-guessing idea from [Dimakis, Wainwright '06], improves decoding of graph based codes in the error-floor domain. The utility of the new, Linear Programming based, decoding is demonstrated via analysis and simulations of the model $[155,64,20]$ code.

Includes members:
  Member "pseudo codeword landscape":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "belief propagation for linear programming")
  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-3 (induced by source paper "belief propagation bethe approximation and polynomials")
  Member "an efficient pseudo codeword search algorithm for linear programming decoding of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "searching for low weight pseudo codewords")
  Member "improving convergence of belief propagation decoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a two stage selective averaging ldpc decoding")
  Member "how to find good finite length codes from art towards science":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "effects of single cycle structure on iterative decoding of low density parity check codes")
  Member "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis")
  Member "the error floor of ldpc codes in the laplacian channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "searching for low weight pseudo codewords")

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)