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: "instanton analysis of low density parity check codes in the error floor regime"
  Abstract: In this paper we develop instanton method introduced in [1], [2], [3] to analyze quantitatively performance of Low-Density-Parity-Check (LDPC) codes decoded iteratively in the so-called error-floor regime. We discuss statistical properties of the numerical instanton-amoeba scheme focusing on detailed analysis and comparison of two regular LDPC codes: Tanner's (155, 64, 20) and Margulis' (672, 336, 16) codes. In the regime of moderate values of the signal-to-noise ratio we critically compare results of the instanton-amoeba evaluations against the standard Monte-Carlo calculations of the Frame-Error-Rate.

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 "cyclic and quasi cyclic ldpc codes on row and column constrained parity check matrices and their trapping sets"):
  with members:
    - "on trapping sets and guaranteed error correction capability of ldpc codes and gldpc codes"
    - "structured ldpc codes from permutation matrices free of small trapping sets"
    - "on the hardness of approximating stopping and trapping sets in ldpc codes"
    - "a general method for finding low error rates of ldpc codes"

Connected through hyperedge HE-3 (induced by source paper "lowering the error floor of ldpc codes using cyclic liftings"):
  with members:
    - "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"
    - "instanton based techniques for analysis and reduction of error floors of ldpc codes"
    - "code annealing and the suppressing effect of the cyclically lifted ldpc code ensemble"
    - "a general method for finding low error rates of ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "instanton based techniques for analysis and reduction of error floors of ldpc codes"):
  with members:
    - "on trapping sets and guaranteed error correction capability of ldpc codes and gldpc codes"
    - "error correction capability of column weight three ldpc codes"
    - "probabilistic analysis of linear programming decoding"
    - "ldpc codes which can correct three errors under iterative decoding"
    - "error correction capability of column weight three ldpc codes"
    - "pseudo codeword analysis of tanner graphs from projective and euclidean planes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-5 (induced by source paper "eliminating trapping sets in low density parity check codes by using tanner graph covers"):
  with members:
    - "code annealing and the suppressing effect of the cyclically lifted ldpc code ensemble"

Connected through hyperedge HE-6 (induced by source paper "searching for low weight pseudo codewords"):
  with members:
    - "pseudo codeword landscape"
    - "guessing facets polytope structure and improved lp decoder"
    - "loop calculus helps to improve belief propagation and linear programming decodings of low density parity check codes"
    - "towards low complexity linear programming decoding"
    - "an efficient pseudo codeword search algorithm for linear programming decoding of ldpc codes"
    - "improving convergence of belief propagation decoding"
    - "how to find good finite length codes from art towards science"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-7 (induced by source paper "pseudo codeword landscape"):
  with members:
    - "loop calculus helps to improve belief propagation and linear programming decodings of low density parity check codes"
    - "towards low complexity linear programming decoding"
    - "an efficient pseudo codeword search algorithm for linear programming decoding of ldpc codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-8 (induced by source paper "on the hardness of approximating stopping and trapping sets in ldpc codes"):
  with members:
    - "error correction capability of column weight three ldpc codes"
    - "error correction capability of column weight three ldpc codes"
    - "a general method for finding low error rates of ldpc codes"
    - "exhausting error prone patterns in ldpc codes"

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)