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 cutting plane method based on redundant rows for improving fractional distance"
  Abstract: In this paper, an idea of the cutting plane method is employed to improve the fractional distance of a given binary parity check matrix. The fractional distance is the minimum weight (with respect to l1-distance) of vertices of the fundamental polytope. The cutting polytope is defined based on redundant rows of the parity check matrix and it plays a key role to eliminate unnecessary fractional vertices in the fundamental polytope. We propose a greedy algorithm and its efficient implementation for improving the fractional distance based on the cutting plane method.

Connected through hyperedge HE-1 (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"
    - "improved linear programming decoding of ldpc codes and bounds on the minimum and fractional distance"
    - "probabilistic analysis of linear programming decoding"
    - "a decomposition theory for binary linear codes"
    - "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-2 (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 separation algorithm for improved lp decoding of linear block codes"
    - "adaptive methods for linear programming decoding"

Connected through hyperedge HE-3 (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"
    - "linear programming decoding of nonbinary linear codes"

Connected through hyperedge HE-4 (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 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-5 (induced by source paper "improved linear programming decoding of ldpc codes and bounds on the minimum and fractional distance"):
  with members:
    - "characterization of graph cover pseudocodewords of codes over f_3"
    - "linear programming decoding of nonbinary linear codes"
    - "adaptive methods for linear programming decoding"
    - "towards low complexity 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 "a separation algorithm for improved lp decoding of linear block codes"):
  with members:
    - "efficient implementation of linear programming decoding"
    - "probabilistic analysis of linear programming decoding"
    - "pseudo codeword landscape"
    - "guessing facets polytope structure and improved lp decoder"
    - "adaptive methods for linear programming decoding"
    - "reducing the error floor"
    - "loop calculus helps to improve belief propagation and linear programming decodings of low density parity check codes"
    - "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)