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: "polytope of correct linear programming decoding and low weight pseudo codewords"
  Abstract: We analyze Linear Programming (LP) decoding of graphical binary codes operating over soft-output, symmetric and log-concave channels. We show that the error-surface, separating domain of the correct decoding from domain of the erroneous decoding, is a polytope. We formulate the problem of finding the lowest-weight pseudo-codeword as a non-convex optimization (maximization of a convex function) over a polytope, with the cost function defined by the channel and the polytope defined by the structure of the code. This formulation suggests new provably convergent heuristics for finding the lowest weight pseudo-codewords improving in quality upon previously discussed. The algorithm performance is tested on the example of the Tanner [155,64,20] code over the Additive White Gaussian Noise (AWGN) channel.

Connected through hyperedge HE-1 (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-2 (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"
    - "efficient implementation of linear programming decoding"
    - "a decomposition theory for binary linear codes"
    - "linear programming decoding of nonbinary linear codes"
    - "a separation algorithm for improved lp decoding of linear block codes"

Connected through hyperedge HE-3 (induced by source paper "minimum pseudoweight analysis of 3 dimensional turbo codes"):
  with members:
    - "counting in graph covers a combinatorial characterization of the bethe entropy function"
    - "analysis and design of tuned turbo codes"
    - "exposing pseudoweight layers in regular ldpc code ensembles"
    - "turbo decoding on the binary erasure channel finite length analysis and turbo stopping sets"
    - "on maximum contention free interleavers and permutation polynomials over integer rings"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "mathematical programming decoding of binary linear codes theory and algorithms"):
  with members:
    - "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"
    - "linear programming decoding of nonbinary linear codes"

Connected through hyperedge HE-5 (induced by source paper "on pseudocodewords and decision regions of linear programming decoding of hdpc codes"):
  with members:
    - "lower bounds on the minimum pseudodistance for linear codes with q ary psk modulation over awgn"
    - "a decomposition theory for binary linear codes"
    - "reducing the error floor"
    - "pseudo codeword analysis of tanner graphs from projective and euclidean planes"
    - "the extraction and complexity limits of graphical models for linear codes"
    - "on the minimal pseudo codewords of codes from finite geometries"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "pseudocodewords of tanner graphs"

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)