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 "correcting a fraction of errors in nonbinary expander codes with linear programming"):
  Abstract: A linear-programming decoder for nonbinary expander codes is presented. It is shown that the proposed decoder has the nearest-neighbor certificate properties. It is also shown that this decoder corrects any pattern of errors of a relative weight up to approximately 1/4δAδB (where δA and δB are the relative minimum distances of the constituent codes).

Includes members:
  Member "linear programming decoding of nonbinary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adaptive linear programming decoding of nonbinary linear codes over prime fields")
  Member "codeword independent performance of nonbinary linear codes under linear programming and sum product decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a unified framework for linear programming based communication receivers")
  Member "improved nearly mds expander codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "linear time erasure list decoding of expander codes")
  Member "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes":
    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 "distance properties of expander codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "linear time erasure list decoding of expander 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)