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 "introduction to mathematical programming based error correction decoding"):
  Abstract: Decoding error-correctiong codes by methods of mathematical optimization, most importantly linear programming, has become an important alternative approach to both algebraic and iterative decoding methods since its introduction by Feldman et al. At first celebrated mainly for its analytical powers, real-world applications of LP decoding are now within reach thanks to most recent research. This document gives an elaborate introduction into both mathematical optimization and coding theory as well as a review of the contributions by which these two areas have found common ground.

Includes members:
  Member "efficient maximum likelihood decoding of linear block codes on binary memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deep learning methods for improved decoding of linear codes")
  Member "towards combinatorial lp turbo decoding":
    also connected through other hyperedges:
      (none)
  Member "mathematical programming decoding of binary linear codes theory and algorithms":
    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 "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "admm based decoder for binary linear codes aided by deep learning")
  Member "polytope of correct linear programming decoding and low weight pseudo codewords":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (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-6 (induced by source paper "on the number of circuits in regular matroids with connections to lattices and codes")
  Member "linear programming decoding of nonbinary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adaptive linear programming decoding of nonbinary linear codes over prime fields")

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)