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: "improved linear programming decoding of ldpc codes and bounds on the minimum and fractional distance"
  Abstract: We examine LDPC codes decoded using linear programming (LP). Four contributions to the LP framework are presented. First, a new method of tightening the LP relaxation, and thus improving the LP decoder, is proposed. Second, we present an algorithm which calculates a lower bound on the minimum distance of a specific code. This algorithm exhibits complexity which scales quadratically with the block length. Third, we propose a method to obtain a tight lower bound on the fractional distance, also with quadratic complexity, and thus less than previously-existing methods. Finally, we show how the fundamental LP polytope for generalized LDPC codes and nonbinary LDPC codes can be obtained.

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"
    - "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 "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-3 (induced by source paper "impact of redundant checks on the lp decoding thresholds of ldpc codes"):
  with members:
    - "lp sdp hierarchy lower bounds for decoding random ldpc codes"
    - "linear programming decoding of spatially coupled codes"
    - "probabilistic analysis of linear programming decoding"
    - "a decomposition theory for binary linear codes"
    - "a cutting plane method based on redundant rows for improving fractional distance"
    - "adaptive methods for linear programming decoding"
    - "on the block error probability of lp decoding of ldpc codes"
    - "bounds on the threshold of linear programming decoding"

Connected through hyperedge HE-4 (induced by source paper "decomposition methods for large scale lp decoding"):
  with members:
    - "hierarchical and high girth qc ldpc codes"
    - "counting in graph covers a combinatorial characterization of the bethe entropy function"
    - "online alternating direction method"
    - "error floor approximation for ldpc codes in the awgn channel"
    - "l1 projections with box constraints"
    - "efficient implementation of linear programming decoding"
    - "probabilistic analysis of linear programming decoding"
    - "interior point algorithms for linear programming decoding"

Connected through hyperedge HE-5 (induced by source paper "the approximate maximum likelihood certificate"):
  with members:
    - "linear programming decoding of nonbinary linear codes"
    - "guessing facets polytope structure and improved lp decoder"
    - "adaptive methods for linear programming decoding"
    - "on the asymptotic weight and stopping set distribution of regular ldpc ensembles"
    - "towards low complexity linear programming decoding"

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)