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: "lowering the error floor of ldpc codes using cyclic liftings"
  Abstract: Cyclic liftings are proposed to lower the error floor of low-density parity-check (LDPC) codes. The liftings are designed to eliminate dominant trapping sets of the base code by removing the short cycles which form the trapping sets. We derive a necessary and sufficient condition for the cyclic permutations assigned to the edges of a cycle $c$ of length $\ell(c)$ in the base graph such that the inverse image of $c$ in the lifted graph consists of only cycles of length strictly larger than $\ell(c)$. The proposed method is universal in the sense that it can be applied to any LDPC code over any channel and for any iterative decoding algorithm. It also preserves important properties of the base code such as degree distributions, encoder and decoder structure, and in some cases, the code rate. The proposed method is applied to both structured and random codes over the binary symmetric channel (BSC). The error floor improves consistently by increasing the lifting degree, and the results show significant improvements in the error floor compared to the base code, a random code of the same degree distribution and block length, and a random lifting of the same degree. Similar improvements are also observed when the codes designed for the BSC are applied to the additive white Gaussian noise (AWGN) channel.

Connected through hyperedge HE-1 (induced by source paper "integer ring sieve irs for constructing compact qc ldpc codes with large girth"):
  with members:
    - "efficient search of compact qc ldpc and sc ldpc convolutional codes with large girth"
    - "compact qc ldpc block and sc ldpc convolutional codes for low latency communications"
    - "design and analysis of time invariant sc ldpc convolutional codes with small constraint length"
    - "the cycle consistency matrix approach to absorbing sets in separable circulant based ldpc codes"
    - "searching for voltage graph based ldpc tailbiting codes with large girth"

Connected through hyperedge HE-2 (induced by source paper "construction of qc ldpc codes with low error floor by efficient systematic search and elimination of trapping sets"):
  with members:
    - "edge coloring technique to remove small elementary trapping sets from tanner graph of qc ldpc codes with column weight 4"
    - "efficient search of qc ldpc codes with girths 6 and 8 and free of elementary trapping sets with small size"
    - "thresholds of absorbing sets in low density parity check codes"
    - "the cycle consistency matrix approach to absorbing sets in separable circulant based ldpc codes"
    - "design of finite length irregular protograph codes with low error floors over the binary input awgn channel using cyclic liftings"
    - "on the dynamics of the error floor behavior in regular ldpc codes"

Connected through hyperedge HE-3 (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"
    - "on characterization of elementary trapping sets of variable regular ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "on computing the multiplicity of cycles in bipartite graphs using the degree distribution and the spectrum of the graph"):
  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"
    - "on characterization of elementary trapping sets of variable regular ldpc codes"

Connected through hyperedge HE-5 (induced by source paper "from cages to trapping sets and codewords a technique to derive tight upper bounds on the minimum size of trapping sets and minimum distance of ldpc codes"):
  with members:
    - "on the minimum stopping distance of array low density parity check codes"
    - "on characterization of elementary trapping sets of variable regular ldpc codes"
    - "practical graph isomorphism ii"
    - "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"
    - "searching for voltage graph based ldpc tailbiting codes with large girth"
    - "error floor approximation for ldpc codes in the awgn channel"
    - "on the dynamics of the error floor behavior in regular ldpc codes"
    - "shortened array codes of large girth"

Connected through hyperedge HE-6 (induced by source paper "hardness results on finding leafless elementary trapping sets and elementary absorbing sets of ldpc codes"):
  with members:
    - "characterization and efficient search of non elementary trapping sets of ldpc codes with applications to stopping sets"
    - "on the tanner graph cycle distribution of random ldpc random protograph based ldpc and random quasi cyclic ldpc code ensembles"
    - "asymptotic average number of different categories of trapping sets absorbing sets and stopping sets in random regular and irregular ldpc code ensembles"
    - "on characterization of elementary trapping sets of variable regular ldpc codes"
    - "error floor approximation for ldpc codes in the awgn channel"
    - "a general method for finding low error rates of ldpc codes"

Connected through hyperedge HE-7 (induced by source paper "bp led decoding algorithm for ldpc codes over awgn channels"):
  with members:
    - "new techniques for upper bounding the ml decoding performance of binary linear codes"
    - "weight distributions of regular low density parity check codes over finite fields"
    - "tree structure expectation propagation for decoding ldpc codes over binary erasure channels"
    - "tightened upper bounds on the ml decoding error probability of binary linear block codes"

Connected through hyperedge HE-8 (induced by source paper "on the tanner graph cycle distribution of random ldpc random protograph based ldpc and random quasi cyclic ldpc code ensembles"):
  with members:
    - "asymptotic average number of different categories of trapping sets absorbing sets and stopping sets in random regular and irregular ldpc code ensembles"
    - "on characterization of elementary trapping sets of variable regular 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)