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: "reducing the error floor"
  Abstract: We discuss how the loop calculus approach of [Chertkov, Chernyak '06], enhanced by the pseudo-codeword search algorithm of [Chertkov, Stepanov '06] and the facet-guessing idea from [Dimakis, Wainwright '06], improves decoding of graph based codes in the error-floor domain. The utility of the new, Linear Programming based, decoding is demonstrated via analysis and simulations of the model $[155,64,20]$ code.

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"
    - "interior point algorithms for linear programming decoding"
    - "a cutting plane method based on redundant rows for improving fractional distance"

Connected through hyperedge HE-2 (induced by source paper "on pseudocodewords and decision regions of linear programming decoding of hdpc codes"):
  with members:
    - "polytope of correct linear programming decoding and low weight pseudo codewords"
    - "lower bounds on the minimum pseudodistance for linear codes with q ary psk modulation over awgn"
    - "a decomposition theory for binary linear codes"
    - "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"

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"
    - "guessing facets polytope structure and improved lp decoder"
    - "adaptive methods for linear programming decoding"
    - "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"
    - "guessing facets polytope structure and improved lp decoder"
    - "adaptive methods for linear programming decoding"
    - "lagrangian relaxation for map estimation in graphical models"

Connected through hyperedge HE-5 (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"
    - "guessing facets polytope structure and improved lp decoder"
    - "solving constraint satisfaction problems through belief propagation guided decimation"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "pseudocodewords of tanner graphs"

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"
    - "a cutting plane method based on redundant rows for improving fractional distance"
    - "pseudo codeword landscape"
    - "guessing facets polytope structure and improved lp decoder"
    - "adaptive methods for linear programming decoding"
    - "loop calculus helps to improve belief propagation and linear programming decodings of low density parity check codes"
    - "towards low complexity linear programming decoding"

Connected through hyperedge HE-7 (induced by source paper "probabilistic analysis of linear programming decoding"):
  with members:
    - "eigenvalue bounds on the pseudocodeword weight of expander codes"
    - "guessing facets polytope structure and improved lp decoder"
    - "towards low complexity linear programming decoding"
    - "bounds on the threshold of linear programming decoding"

Connected through hyperedge HE-8 (induced by source paper "guessing facets polytope structure and improved lp decoder"):
  with members:
    - "probabilistic analysis of linear programming decoding"
    - "solving constraint satisfaction problems through belief propagation guided decimation"
    - "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)