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: "guessing facets polytope structure and improved lp decoder"
  Abstract: In this paper we investigate the structure of the fundamental polytope used in the Linear Programming decoding introduced by Feldman, Karger and Wainwright. We begin by showing that for expander codes, every fractional pseudocodeword always has at least a constant fraction of non-integral bits. We then prove that for expander codes, the active set of any fractional pseudocodeword is smaller by a constant fraction than the active set of any codeword. We further exploit these geometrical properties to devise an improved decoding algorithm with the same complexity order as LP decoding that provably performs better, for any blocklength. It proceeds by guessing facets of the polytope, and then resolving the linear program on these facets. While the LP decoder succeeds only if the ML codeword has the highest likelihood over all pseudocodewords, we prove that the proposed algorithm, when applied to suitable expander codes, succeeds unless there exist a certain number of pseudocodewords, all adjacent to the ML codeword on the LP decoding polytope, and with higher likelihood than the ML codeword. We then describe an extended algorithm, still with polynomial complexity, that succeeds as long as there are at most polynomially many pseudocodewords above the ML codeword.

Connected through hyperedge HE-1 (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"
    - "adaptive methods for linear programming decoding"
    - "towards low complexity linear programming decoding"

Connected through hyperedge HE-2 (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"
    - "a cutting plane method based on redundant rows for improving fractional distance"

Connected through hyperedge HE-3 (induced by source paper "polytope of correct linear programming decoding and low weight pseudo codewords"):
  with members:
    - "worst configurations instantons for compressed sensing over reals a channel coding approach"
    - "instanton based techniques for analysis and reduction of error floors of ldpc codes"
    - "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"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "improved linear programming decoding using frustrated cycles"):
  with members:
    - "mathematical programming decoding of binary linear codes theory and algorithms"
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "probabilistic analysis of linear programming decoding"
    - "adaptive methods for linear programming decoding"
    - "lagrangian relaxation for map estimation in graphical models"
    - "reducing the error floor"

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

Connected through hyperedge HE-6 (induced by source paper "decimation enhanced finite alphabet iterative decoders for ldpc codes on the bsc"):
  with members:
    - "multilevel decoders surpassing belief propagation on the binary symmetric channel"
    - "solving constraint satisfaction problems through belief propagation guided decimation"
    - "reducing the error floor"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-7 (induced by source paper "linear programming based detectors for two dimensional intersymbol interference channels"):
  with members:
    - "adaptive methods for linear programming decoding"
    - "lagrangian relaxation for map estimation in graphical models"
    - "on the achievable information rates of finite state input two dimensional channels with memory"
    - "joint equalization and decoding for nonlinear two dimensional intersymbol interference channels"

Connected through hyperedge HE-8 (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"
    - "a cutting plane method based on redundant rows for improving fractional distance"
    - "pseudo codeword landscape"
    - "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)