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: "towards low complexity linear programming decoding"
  Abstract: We consider linear-programming (LP) decoding of low-density parity-check (LDPC) codes. While it is clear that one can use any general-purpose LP solver to solve the LP that appears in the decoding problem, we argue in this paper that the LP at hand is equipped with a lot of structure that one should take advantage of. Towards this goal, we study the dual LP and show how coordinate-ascent methods lead to very simple update rules that are tightly connected to the min-sum algorithm. Moreover, replacing minima in the formula of the dual LP with soft-minima one obtains update rules that are tightly connected to the sum-product algorithm. This shows that LP solvers with complexity similar to the min-sum algorithm and the sum-product algorithm are feasible. Finally, we also discuss some sub-gradient-based methods.

Connected through hyperedge HE-1 (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-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 "hardware based linear program decoding with the alternating direction method of multipliers"):
  with members:
    - "1 bit massive mu mimo precoding in vlsi"
    - "hardware based projection onto the parity polytope and probability simplex"
    - "lp decodable multipermutation codes"
    - "hierarchical and high girth qc ldpc codes"
    - "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"
    - "adaptive methods for linear programming decoding"

Connected through hyperedge HE-4 (induced by source paper "hardware based admm lp decoding"):
  with members:
    - "the admm penalized decoder for ldpc codes"
    - "hardware based projection onto the parity polytope and probability simplex"
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "decomposition methods for large scale lp decoding"
    - "adaptive methods for linear programming decoding"

Connected through hyperedge HE-5 (induced by source paper "hardware based projection onto the parity polytope and probability simplex"):
  with members:
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "decomposition methods for large scale lp decoding"
    - "adaptive methods for linear programming decoding"

Connected through hyperedge HE-6 (induced by source paper "admm lp decoding of non binary ldpc codes in mathbb f _ 2 m"):
  with members:
    - "the admm penalized decoder for ldpc codes"
    - "low complexity lp decoding of nonbinary linear codes"
    - "linear programming decoding of spatially coupled codes"
    - "online alternating direction method"
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "decomposition methods for large scale lp decoding"
    - "lp decoding of regular ldpc codes in memoryless channels"
    - "efficient implementation of linear programming decoding"

Connected through hyperedge HE-7 (induced by source paper "message passing algorithms reparameterizations and splittings"):
  with members:
    - "loopy belief propagation for approximate inference an empirical study"
    - "counting in graph covers a combinatorial characterization of the bethe entropy function"
    - "map estimation linear programming and belief propagation with convex free energies"
    - "convergent message passing algorithms a unifying view"
    - "on the optimality of tree reweighted max product message passing"
    - "message passing for maximum weight independent set"
    - "norm product belief propagation primal dual message passing for approximate inference"
    - "convergence of the min sum message passing algorithm for quadratic optimization"

Connected through hyperedge HE-8 (induced by source paper "belief propagation for linear programming"):
  with members:
    - "the cutting plane method is polynomial for perfect matchings"
    - "map estimation linear programming and belief propagation with convex free energies"
    - "improved linear programming decoding using frustrated cycles"
    - "belief propagation for min cost network flow convergence and correctness"
    - "message passing for maximum weight independent set"
    - "max product for maximum weight matching convergence correctness and lp duality"
    - "guessing facets polytope structure and improved lp decoder"
    - "adaptive methods for 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)