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: "design of finite length irregular protograph codes with low error floors over the binary input awgn channel using cyclic liftings"
  Abstract: We propose a technique to design finite-length irregular low-density parity-check (LDPC) codes over the binary-input additive white Gaussian noise (AWGN) channel with good performance in both the waterfall and the error floor region. The design process starts from a protograph which embodies a desirable degree distribution. This protograph is then lifted cyclically to a certain block length of interest. The lift is designed carefully to maximize the components of the approximate cycle extrinsic message degree (ACE) spectrum of the code's Tanner graph in a greedy fashion. As a consequence, the designed code would perform well in the error floor region. Moreover, the proposed construction results in quasi-cyclic codes which are attractive in practice due to simple encoder and decoder implementation. Simulation results are provided to demonstrate the effectiveness of the proposed construction in comparison with similar existing constructions.

Connected through hyperedge HE-1 (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"
    - "lowering the error floor of ldpc codes using cyclic liftings"
    - "on the dynamics of the error floor behavior in regular ldpc codes"

Connected through hyperedge HE-2 (induced by source paper "a new multi edge metric constrained peg algorithm for designing binary ldpc code with improved cycle structure"):
  with members:
    - "quasi cyclic ldpc codes based on pre lifted protographs"
    - "design of multiple edge protographs for qc ldpc codes avoiding short inevitable cycles"
    - "searching for voltage graph based ldpc tailbiting codes with large girth"

Connected through hyperedge HE-3 (induced by source paper "characterization and efficient exhaustive search algorithm for elementary trapping sets of irregular ldpc codes"):
  with members:
    - "on characterization of elementary trapping sets of variable regular ldpc codes"
    - "the trapping redundancy of linear block codes"

Connected through hyperedge HE-4 (induced by source paper "new characterization and efficient exhaustive search algorithm for elementary trapping sets of variable regular ldpc codes"):
  with members:
    - "on characterization of elementary trapping sets of variable regular ldpc codes"
    - "practical graph isomorphism ii"
    - "the trapping redundancy of linear block codes"

Connected through hyperedge HE-5 (induced by source paper "design of non binary quasi cyclic ldpc codes by ace optimization"):
  with members:
    - "lowering the error floor of ldpc codes using cyclic liftings"

Connected through hyperedge HE-6 (induced by source paper "the cycle consistency matrix approach to absorbing sets in separable circulant based ldpc codes"):
  with members:
    - "absorbing set spectrum approach for practical code design"
    - "cyclic and quasi cyclic ldpc codes on row and column constrained parity check matrices and their trapping sets"
    - "lowering the error floor of ldpc codes using cyclic liftings"
    - "structured ldpc codes from permutation matrices free of small trapping sets"
    - "shortened array codes of large girth"

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)