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: "interior point algorithms for linear programming decoding"
  Abstract: Interior-point algorithms constitute a very interesting class of algorithms for solving linear-programming problems. In this paper we study efficient implementations of such algorithms for solving the linear program that appears in the linear-programming decoder formulation.

Connected through hyperedge HE-1 (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"
    - "a cutting plane method based on redundant rows for improving fractional distance"
    - "linear programming decoding of nonbinary linear codes"

Connected through hyperedge HE-2 (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"
    - "improved linear programming decoding of ldpc codes and bounds on the minimum and fractional distance"
    - "l1 projections with box constraints"
    - "efficient implementation of linear programming decoding"
    - "probabilistic analysis of linear programming decoding"

Connected through hyperedge HE-3 (induced by source paper "lp decoding of expander codes a simpler proof"):
  with members:
    - "lp decoding of regular ldpc codes in memoryless channels"
    - "efficient implementation of linear programming decoding"
    - "on the block error probability of lp decoding of ldpc codes"
    - "towards low complexity linear programming decoding"
    - "bounds on the threshold of linear programming decoding"
    - "some applications of coding theory in computational complexity"

Connected through hyperedge HE-4 (induced by source paper "a unified framework for linear programming based communication receivers"):
  with members:
    - "joint decoding of ldpc codes and finite state channels via linear programming"
    - "graph based decoding in the presence of isi"
    - "interior point decoding for linear vector channels"
    - "linear programming decoding of nonbinary linear codes"
    - "codeword independent performance of nonbinary linear codes under linear programming and sum product decoding"
    - "towards low complexity linear programming decoding"
    - "pseudocodeword weights for non binary ldpc codes"
    - "characterizations of pseudo codewords of ldpc codes"

Connected through hyperedge HE-5 (induced by source paper "joint decoding of ldpc codes and finite state channels via linear programming"):
  with members:
    - "a unified framework for linear programming based communication receivers"
    - "graph based decoding in the presence of isi"
    - "an iterative joint linear programming decoding of ldpc codes and finite state channels"
    - "low complexity linear programming decoding of nonbinary linear codes"
    - "linear programming receivers"
    - "linear programming decoding of nonbinary linear codes"
    - "adaptive methods for linear programming decoding"
    - "towards low complexity linear programming decoding"

Connected through hyperedge HE-6 (induced by source paper "an iterative joint linear programming decoding of ldpc codes and finite state channels"):
  with members:
    - "a unified framework for linear programming based communication receivers"
    - "joint decoding of ldpc codes and finite state channels via linear programming"
    - "low complexity linear programming decoding of nonbinary linear codes"
    - "interior point decoding for linear vector channels"
    - "linear programming decoding of nonbinary linear codes"
    - "adaptive methods for linear programming decoding"
    - "towards low complexity linear programming decoding"

Connected through hyperedge HE-7 (induced by source paper "efficient implementation of linear programming decoding"):
  with members:
    - "pseudo codeword landscape"
    - "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"
    - "map estimation via agreement on hyper trees message passing and linear programming"

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)