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: "on trapping sets and guaranteed error correction capability of ldpc codes and gldpc codes"
  Abstract: The relation between the girth and the guaranteed error correction capability of ? -left-regular low-density parity-check (LDPC) codes when decoded using the bit flipping (serial and parallel) algorithms is investigated. A lower bound on the size of variable node sets which expand by a factor of at least 3 ?/4 is found based on the Moore bound. This bound, combined with the well known expander based arguments, leads to a lower bound on the guaranteed error correction capability. The decoding failures of the bit flipping algorithms are characterized using the notions of trapping sets and fixed sets. The relation between fixed sets and a class of graphs known as cage graphs is studied. Upper bounds on the guaranteed error correction capability are then established based on the order of cage graphs. The results are extended to left-regular and right-uniform generalized LDPC codes. It is shown that this class of generalized LDPC codes can correct a linear number of worst case errors (in the code length) under the parallel bit flipping algorithm when the underlying Tanner graph is a good expander. A lower bound on the size of variable node sets which have the required expansion is established.

Connected through hyperedge HE-1 (induced by source paper "check hybrid gldpc codes systematic elimination of trapping sets and guaranteed error correction capability"):
  with members:
    - "spectral shape of check hybrid gldpc codes"

Connected through hyperedge HE-2 (induced by source paper "majority logic decoding under data dependent logic gate failures"):
  with members:
    - "modeling and energy optimization of ldpc decoder circuits with timing violations"
    - "density evolution and functional threshold for the noisy min sum decoder"
    - "density evolution for min sum decoding of ldpc codes under unreliable message storage"
    - "state dependent statistical timing model for voltage scaled circuits"
    - "performance of ldpc codes under faulty iterative decoding"

Connected through hyperedge HE-3 (induced by source paper "thresholds of absorbing sets in low density parity check codes"):
  with members:
    - "the cycle consistency matrix approach to absorbing sets in separable circulant based ldpc codes"
    - "error floor approximation for ldpc codes in the awgn channel"
    - "two bit bit flipping decoding of ldpc codes"
    - "instanton based techniques for analysis and reduction of error floors of ldpc codes"
    - "on the dynamics of the error floor behavior in regular ldpc codes"
    - "error correction capability of column weight three ldpc codes"
    - "error correction capability of column weight three ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "ldpc codes from latin squares free of small trapping sets"):
  with members:
    - "a message passing algorithm for counting short cycles in a graph"
    - "instanton based techniques for analysis and reduction of error floors of ldpc codes"
    - "ldpc codes which can correct three errors under iterative decoding"
    - "shortened array codes of large girth"
    - "pseudocodewords of tanner graphs"

Connected through hyperedge HE-5 (induced by source paper "cyclic and quasi cyclic ldpc codes on row and column constrained parity check matrices and their trapping sets"):
  with members:
    - "structured ldpc codes from permutation matrices free of small trapping sets"
    - "on the hardness of approximating stopping and trapping sets in ldpc codes"
    - "instanton analysis of low density parity check codes in the error floor regime"
    - "a general method for finding low error rates of ldpc codes"

Connected through hyperedge HE-6 (induced by source paper "instanton based techniques for analysis and reduction of error floors of ldpc codes"):
  with members:
    - "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"
    - "instanton analysis of low density parity check codes in the error floor regime"
    - "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)