human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "instanton based techniques for analysis and reduction of error floors of ldpc codes"):
  Abstract: We describe a family of instanton-based optimization methods developed recently for the analysis of the error floors of low-density parity-check (LDPC) codes. Instantons are the most probable configurations of the channel noise which result in decoding failures. We show that the general idea and the respective optimization technique are applicable broadly to a variety of channels, discrete or continuous, and variety of sub-optimal decoders. Specifically, we consider: iterative belief propagation (BP) decoders, Gallager type decoders, and linear programming (LP) decoders performing over the additive white Gaussian noise channel (AWGNC) and the binary symmetric channel (BSC). The instanton analysis suggests that the underlying topological structures of the most probable instanton of the same code but different channels and decoders are related to each other. Armed with this understanding of the graphical structure of the instanton and its relation to the decoding failures, we suggest a method to construct codes whose Tanner graphs are free of these structures, and thus have less significant error floors.

Includes members:
  Member "on trapping sets and guaranteed error correction capability of ldpc codes and gldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "check hybrid gldpc codes systematic elimination of trapping sets and guaranteed error correction capability")
  Member "error correction capability of column weight three ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "thresholds of absorbing sets in low density parity check codes")
  Member "probabilistic analysis of linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the admm penalized decoder for ldpc codes")
  Member "ldpc codes which can correct three errors under iterative decoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finite alphabet iterative decoders part ii towards guaranteed error correction of ldpc codes via iterative decoder diversity")
  Member "error correction capability of column weight three ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "thresholds of absorbing sets in low density parity check codes")
  Member "pseudo codeword analysis of tanner graphs from projective and euclidean planes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "pseudocodeword free criterion for codes with cycle free tanner graph")
  Member "instanton analysis of low density parity check codes in the error floor regime":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the admm penalized decoder for ldpc codes")
  Member "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis")

Question: Please tell me which class the source paper 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)