human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis"):
  with members:
    - "minimum polytope based linear programming decoder for ldpc codes via admm approach"
    - "the admm penalized decoder for ldpc codes"
    - "hardware based linear program decoding with the alternating direction method of multipliers"
    - "hardware based projection onto the parity polytope and probability simplex"
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "improved linear programming decoding of ldpc codes and bounds on the minimum and fractional distance"
    - "efficient linear programming decoding of hdpc codes"
    - "a separation algorithm for improved lp decoding of linear block codes"

Connected through hyperedge HE-2 (induced by source paper "adaptive linear programming decoding of nonbinary linear codes over prime fields"):
  with members:
    - "hardware based linear program decoding with the alternating direction method of multipliers"
    - "on the finite length scaling of ternary polar codes"
    - "low complexity lp decoding of nonbinary linear codes"
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "decomposition methods for large scale lp decoding"
    - "efficient implementation of linear programming decoding"
    - "linear programming decoding of nonbinary linear codes"
    - "a separation algorithm for improved lp decoding of linear block codes"

Connected through hyperedge HE-3 (induced by source paper "the admm penalized decoder for ldpc codes"):
  with members:
    - "hierarchical and high girth qc ldpc codes"
    - "linear programming decoding of spatially coupled codes"
    - "an improved three weight message passing algorithm"
    - "counting in graph covers a combinatorial characterization of the bethe entropy function"
    - "error floor approximation for ldpc codes in the awgn channel"
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "decomposition methods for large scale lp decoding"
    - "instantons causing iterative decoding to cycle"

Connected through hyperedge HE-4 (induced by source paper "introduction to mathematical programming based error correction decoding"):
  with members:
    - "efficient maximum likelihood decoding of linear block codes on binary memoryless channels"
    - "towards combinatorial lp turbo decoding"
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "polytope of correct linear programming decoding and low weight pseudo codewords"
    - "efficient implementation of linear programming decoding"
    - "a decomposition theory for binary linear codes"
    - "linear programming decoding of nonbinary linear codes"
    - "a separation algorithm for improved lp decoding of linear block codes"

Connected through hyperedge HE-5 (induced by source paper "efficient maximum likelihood decoding of linear block codes on binary memoryless channels"):
  with members:
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "adaptive methods for linear programming decoding"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-6 (induced by source paper "towards combinatorial lp turbo decoding"):
  with members:
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-7 (induced by source paper "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"):
  with members:
    - "efficient implementation of linear programming decoding"
    - "a cutting plane method based on redundant rows for improving fractional distance"
    - "a separation algorithm for improved lp decoding of linear block codes"
    - "pseudo codeword landscape"
    - "adaptive methods for linear programming decoding"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-8 (induced by source paper "improved linear programming decoding using frustrated cycles"):
  with members:
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "probabilistic analysis of linear programming decoding"
    - "guessing facets polytope structure and improved lp decoder"
    - "adaptive methods for linear programming decoding"
    - "lagrangian relaxation for map estimation in graphical models"
    - "reducing the error floor"

Question: Please tell me which class the center node 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)