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 "lp decoding meets lp decoding a connection between channel coding and compressed sensing"):
  Abstract: This is a tale of two linear programming decoders, namely channel coding linear programming decoding (CC-LPD) and compressed sensing linear programming decoding (CS-LPD). So far, they have evolved quite independently. The aim of the present paper is to show that there is a tight connection between, on the one hand, CS-LPD based on a zero-one measurement matrix over the reals and, on the other hand, CC-LPD of the binary linear code that is obtained by viewing this measurement matrix as a binary parity-check matrix. This connection allows one to translate performance guarantees from one setup to the other.

Includes members:
  Member "absdet pseudo codewords and perm pseudo codewords definitions and properties":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "bounding the bethe and the degree m bethe permanents")
  Member "on the iterative decoding of high rate ldpc codes with applications in compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ldpc codes for compressed sensing")
  Member "probabilistic analysis of linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the admm penalized decoder for ldpc codes")
  Member "a decomposition theory for binary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the number of circuits in regular matroids with connections to lattices and codes")
  Member "combining geometry and combinatorics a unified approach to sparse signal recovery":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sublinear time non adaptive group testing with o k log n tests via bit mixing coding")
  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")
  Member "pseudocodewords of tanner graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "free pseudodistance growth rates for spatially coupled ldpc codes over the bec")

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)