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: "a separation algorithm for improved lp decoding of linear block codes"
  Abstract: Maximum Likelihood (ML) decoding is the optimal decoding algorithm for arbitrary linear block codes and can be written as an Integer Programming (IP) problem. Feldman et al. relaxed this IP problem and presented Linear Programming (LP) based decoding algorithm for linear block codes. In this paper, we propose a new IP formulation of the ML decoding problem and solve the IP with generic methods. The formulation uses indicator variables to detect violated parity checks. We derive Gomory cuts from our formulation and use them in a separation algorithm to find ML codewords. We further propose an efficient method of finding cuts induced by redundant parity checks (RPC). Under certain circumstances we can guarantee that these RPC cuts are valid and cut off the fractional optimal solutions of LP decoding. We demonstrate on two LDPC codes and one BCH code that our separation algorithm performs significantly better than LP decoding.

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"
    - "mathematical programming decoding of binary linear codes theory and algorithms"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "a branch price and cut algorithm for optimal decoding of ldpc codes"):
  with members:
    - "nash codes for noisy channels"
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "decomposition methods for large scale lp decoding"
    - "budget optimal task allocation for reliable crowdsourcing systems"
    - "adaptive methods for linear programming decoding"

Connected through hyperedge HE-3 (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"
    - "mathematical programming decoding of binary linear codes theory and algorithms"
    - "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"

Connected through hyperedge HE-4 (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"
    - "mathematical programming decoding of binary linear codes theory and algorithms"
    - "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"

Connected through hyperedge HE-5 (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"
    - "mathematical programming decoding of binary linear codes theory and algorithms"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "performance and analysis of quadratic residue codes of lengths less than 100"):
  with members:
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "a cutting plane method based on redundant rows for improving fractional distance"
    - "adaptive methods for linear programming decoding"

Connected through hyperedge HE-7 (induced by source paper "mathematical programming decoding of binary linear codes theory and algorithms"):
  with members:
    - "polytope of correct linear programming decoding and low weight pseudo codewords"
    - "efficient linear programming decoding of hdpc codes"
    - "error bounds for repeat accumulate codes decoded via linear programming"
    - "efficient implementation of linear programming decoding"
    - "a decomposition theory for binary linear codes"
    - "max product for maximum weight matching convergence correctness and lp duality"
    - "interior point algorithms for linear programming decoding"
    - "a cutting plane method based on redundant rows for improving fractional distance"

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

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)