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 of expander codes a simpler proof"):
  Abstract: A code $C \subseteq \F_2^n$ is a $(c,\epsilon,\delta)$-expander code if it has a Tanner graph, where every variable node has degree $c$, and every subset of variable nodes $L_0$ such that $|L_0|\leq \delta n$ has at least $\epsilon c |L_0|$ neighbors. Feldman et al. (IEEE IT, 2007) proved that LP decoding corrects $\frac{3\epsilon-2}{2\epsilon-1} \cdot (\delta n-1)$ errors of $(c,\epsilon,\delta)$-expander code, where $\epsilon > 2/3+\frac{1}{3c}$. In this paper, we provide a simpler proof of their result and show that this result holds for every expansion parameter $\epsilon > 2/3$.

Includes members:
  Member "lp decoding of regular ldpc codes in memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the admm penalized decoder for ldpc codes")
  Member "efficient implementation of 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 "interior point algorithms for linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mathematical programming decoding of binary linear codes theory and algorithms")
  Member "on the block error probability of lp decoding of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "impact of redundant checks on the lp decoding thresholds of ldpc codes")
  Member "towards low complexity linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "adaptive linear programming decoding of nonbinary linear codes over prime fields")
  Member "bounds on the threshold of linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "impact of redundant checks on the lp decoding thresholds of ldpc codes")
  Member "some applications of coding theory in computational complexity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a lower bound for relaxed locally decodable codes")

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)