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 characterization of elementary trapping sets of variable regular ldpc codes"
  Abstract: In this paper, we study the graphical structure of elementary trapping sets (ETS) of variable-regular low-density parity-check (LDPC) codes. ETSs are known to be the main cause of error floor in LDPC coding schemes. For the set of LDPC codes with a given variable node degree $d_l$ and girth $g$, we identify all the non-isomorphic structures of an arbitrary class of $(a,b)$ ETSs, where $a$ is the number of variable nodes and $b$ is the number of odd-degree check nodes in the induced subgraph of the ETS. Our study leads to a simple characterization of dominant classes of ETSs (those with relatively small values of $a$ and $b$) based on short cycles in the Tanner graph of the code. For such classes of ETSs, we prove that any set ${\cal S}$ in the class is a layered superset (LSS) of a short cycle, where the term "layered" is used to indicate that there is a nested sequence of ETSs that starts from the cycle and grows, one variable node at a time, to generate ${\cal S}$. This characterization corresponds to a simple search algorithm that starts from the short cycles of the graph and finds all the ETSs with LSS property in a guaranteed fashion. Specific results on the structure of ETSs are presented for $d_l = 3, 4, 5, 6$, $g = 6, 8$ and $a, b \leq 10$ in this paper. The results of this paper can be used for the error floor analysis and for the design of LDPC codes with low error floors.

Connected through hyperedge HE-1 (induced by source paper "a combinatorial methodology for optimizing non binary graph based codes theoretical analysis and applications in data storage"):
  with members:
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
    - "spatially coupled code design for partial response channels optimal object minimization approach"
    - "a generalized algebraic approach to optimizing sc ldpc codes"
    - "high performance non binary spatially coupled codes for flash memories"
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "spatially coupled ldpc codes constructed from protographs"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "iterative decoding of ldpc codes over the q ary partial erasure channel"

Connected through hyperedge HE-2 (induced by source paper "multi dimensional spatially coupled code design enhancing the cycle properties"):
  with members:
    - "efficient search and elimination of harmful objects in optimized qc sc ldpc codes"
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
    - "multi dimensional spatially coupled code design through informed relocation of circulants"
    - "spatially coupled code design for partial response channels optimal object minimization approach"
    - "high performance non binary spatially coupled codes for flash memories"
    - "hierarchical and high girth qc ldpc codes"
    - "multi dimensional spatially coupled codes"
    - "new codes on graphs constructed by connecting spatially coupled chains"

Connected through hyperedge HE-3 (induced by source paper "efficient search and elimination of harmful objects in optimized qc sc ldpc codes"):
  with members:
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
    - "design and analysis of time invariant sc ldpc convolutional codes with small constraint length"
    - "a generalized algebraic approach to optimizing sc ldpc codes"
    - "spatially coupled ldpc codes constructed from protographs"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Connected through hyperedge HE-4 (induced by source paper "performance bounds and estimates for quantized ldpc decoders"):
  with members:
    - "thresholds of absorbing sets in low density parity check codes"
    - "controlling the error floor in ldpc decoding"
    - "error floor approximation for ldpc codes in the awgn channel"
    - "quantized iterative message passing decoders with low error floor for ldpc codes"
    - "the trapping redundancy of linear block codes"

Connected through hyperedge HE-5 (induced by source paper "cospectral bipartite graphs with the same degree sequences but with different number of large cycles"):
  with members:
    - "on computing the multiplicity of cycles in bipartite graphs using the degree distribution and the spectrum of the graph"
    - "on the tanner graph cycle distribution of random ldpc random protograph based ldpc and random quasi cyclic ldpc code ensembles"
    - "on short cycle enumeration in biregular bipartite graphs"
    - "lowering the error floor of ldpc codes using cyclic liftings"

Connected through hyperedge HE-6 (induced by source paper "on computing the number of short cycles in bipartite graphs using the spectrum of the directed edge matrix"):
  with members:
    - "on the tanner graph cycle distribution of random ldpc random protograph based ldpc and random quasi cyclic ldpc code ensembles"
    - "on short cycle enumeration in biregular bipartite graphs"

Connected through hyperedge HE-7 (induced by source paper "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"):
  with members:
    - "high performance non binary spatially coupled codes for flash memories"
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "spatially coupled ldpc codes constructed from protographs"
    - "design of spatially coupled ldpc codes over gf q for windowed decoding"
    - "performance comparison of ldpc block and spatially coupled codes over gf q"
    - "design of non binary quasi cyclic ldpc codes by ace optimization"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "the cycle consistency matrix approach to absorbing sets in separable circulant based ldpc codes"

Connected through hyperedge HE-8 (induced by source paper "characterization and efficient search of non elementary trapping sets of ldpc codes with applications to stopping sets"):
  with members:
    - "on the tanner graph cycle distribution of random ldpc random protograph based ldpc and random quasi cyclic ldpc code ensembles"
    - "characterization and efficient exhaustive search algorithm for elementary trapping sets of irregular ldpc codes"
    - "on the minimum stopping distance of array low density parity check codes"
    - "bounds on the minimum distance of punctured quasi cyclic 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)