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 "mathematical programming decoding of binary linear codes theory and algorithms"):
  Abstract: Mathematical programming is a branch of applied mathematics and has recently been used to derive new decoding approaches, challenging established but often heuristic algorithms based on iterative message passing. Concepts from mathematical programming used in the context of decoding include linear, integer, and nonlinear programming, network flows, notions of duality as well as matroid and polyhedral theory. This paper reviews and categorizes decoding methods based on mathematical programming approaches for binary linear codes over binary-input memoryless symmetric channels.

Includes members:
  Member "polytope of correct linear programming decoding and low weight pseudo codewords":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the admm penalized decoder for ldpc codes")
  Member "efficient linear programming decoding of hdpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis")
  Member "error bounds for repeat accumulate codes decoded via linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "local optimality guarantees for optimal decoding based on paths")
  Member "efficient implementation of linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "adaptive linear programming decoding of nonbinary linear codes over prime fields")
  Member "a decomposition theory for binary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the number of circuits in regular matroids with connections to lattices and codes")
  Member "max product for maximum weight matching convergence correctness and lp duality":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "my fair bandit distributed learning of max min fairness with multi player bandits")
  Member "interior point algorithms for linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "decomposition methods for large scale lp decoding")
  Member "a cutting plane method based on redundant rows for improving fractional distance":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "impact of redundant checks on the lp decoding thresholds of ldpc 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)