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 "loop calculus helps to improve belief propagation and linear programming decodings of low density parity check codes"):
  Abstract: We illustrate the utility of the recently developed loop calculus for improving the Belief Propagation (BP) algorithm. If the algorithm that minimizes the Bethe free energy fails we modify the free energy by accounting for a critical loop in a graphical representation of the code. The log-likelihood specific critical loop is found by means of the loop calculus. The general method is tested using an example of the Linear Programming (LP) decoding, that can be viewed as a special limit of the BP decoding. Considering the (155,64,20) code that performs over Additive-White-Gaussian-Noise channel we show that the loop calculus improves the LP decoding and corrects all previously found dangerous configurations of log-likelihoods related to pseudo-codewords with low effective distance, thus reducing the code's error-floor.

Includes members:
  Member "guessing facets polytope structure and improved lp decoder":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "belief propagation for linear programming")
  Member "towards low complexity linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adaptive linear programming decoding of nonbinary linear codes over prime fields")
  Member "instanton analysis of low density parity check codes in the error floor regime":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the admm penalized decoder for ldpc codes")
  Member "improving convergence of belief propagation decoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a two stage selective averaging ldpc decoding")
  Member "characterizations of pseudo codewords of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a unified framework for linear programming based communication receivers")
  Member "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes":
    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 "the benefit of thresholding in lp decoding of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "ldpc codes for compressed sensing")

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)