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 "characterization and efficient search of non elementary trapping sets of ldpc codes with applications to stopping sets"):
  Abstract: In this paper, we propose a characterization for non-elementary trapping sets (NETSs) of low-density parity-check (LDPC) codes. The characterization is based on viewing a NETS as a hierarchy of embedded graphs starting from an ETS. The characterization corresponds to an efficient search algorithm that under certain conditions is exhaustive. As an application of the proposed characterization/search, we obtain lower and upper bounds on the stopping distance $s_{min}$ of LDPC codes. #R##N#We examine a large number of regular and irregular LDPC codes, and demonstrate the efficiency and versatility of our technique in finding lower and upper bounds on, and in many cases the exact value of, $s_{min}$. Finding $s_{min}$, or establishing search-based lower or upper bounds, for many of the examined codes are out of the reach of any existing algorithm.

Includes members:
  Member "on the tanner graph cycle distribution of random ldpc random protograph based ldpc and random quasi cyclic ldpc code ensembles":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "perm2vec graph permutation selection for decoding of error correction codes using self attention")
  Member "characterization and efficient exhaustive search algorithm for elementary trapping sets of irregular ldpc codes":
    also connected through other hyperedges:
      (none)
  Member "on the minimum stopping distance of array low density parity check codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "failure analysis of the interval passing algorithm for compressed sensing")
  Member "on characterization of elementary trapping sets of variable regular ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a combinatorial methodology for optimizing non binary graph based codes theoretical analysis and applications in data storage")
  Member "bounds on the minimum distance of punctured quasi cyclic ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "design of improved quasi cyclic protograph based raptor like ldpc codes for short block lengths")

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)