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 multiple edge protographs for qc ldpc codes avoiding short inevitable cycles"
  Abstract: There have been lots of efforts on the construction of quasi-cyclic (QC) low-density parity-check (LDPC) codes with large girth. However, most of them focus on protographs with single edges and little research has been done for the construction of QC LDPC codes lifted from protographs with multiple (i.e., parallel) edges. Compared to single-edge protographs, multiple-edge protographs have benefits such that QC LDPC codes lifted from them can potentially have larger minimum Hamming distance. In this paper, all subgraph patterns of multiple-edge protographs, which prevent QC LDPC codes from having large girth by inducing inevitable cycles, are fully investigated based on a graph-theoretic approach. By using combinatorial designs, a systematic construction method of multiple-edge protographs is proposed for regular QC LDPC codes with girth at least 12 and another method is proposed for regular QC LDPC codes with girth at least 14. Moreover, a construction algorithm of QC LDPC codes based on certain liftings of multiple-edge protographs is proposed and it is shown that the resulting QC LDPC codes have larger upper bounds on the minimum Hamming distance than those lifted from single-edge protographs. Simulation results are provided to compare the performance of the proposed QC LDPC codes with progressive edge-growth (PEG) LDPC codes and with PEG QC LDPC codes.

Connected through hyperedge HE-1 (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"
    - "searching for voltage graph based ldpc tailbiting codes with large girth"
    - "design of finite length irregular protograph codes with low error floors over the binary input awgn channel using cyclic liftings"

Connected through hyperedge HE-2 (induced by source paper "bounding the bethe and the degree m bethe permanents"):
  with members:
    - "hierarchical and high girth qc ldpc codes"
    - "the bethe permanent of a nonnegative matrix"
    - "bounds on the minimum distance of punctured quasi cyclic ldpc codes"
    - "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"
    - "the bethe partition function of log supermodular graphical models"
    - "computing the permanent with belief propagation"
    - "absdet pseudo codewords and perm pseudo codewords definitions and properties"
    - "approximating the permanent with belief propagation"

Connected through hyperedge HE-3 (induced by source paper "quasi cyclic ldpc codes based on pre lifted protographs"):
  with members:
    - "hierarchical and high girth qc ldpc codes"
    - "bounds on the minimum distance of punctured quasi cyclic ldpc codes"
    - "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"
    - "lowering the error floor of ldpc codes using cyclic liftings"

Connected through hyperedge HE-4 (induced by source paper "pseudocodewords from bethe permanents"):
  with members:
    - "hierarchical and high girth qc ldpc codes"
    - "bounds on the minimum distance of punctured quasi cyclic ldpc codes"
    - "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"
    - "absdet pseudo codewords and perm pseudo codewords definitions and properties"
    - "approximating the permanent with belief propagation"
    - "belief propagation and beyond for particle tracking"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of 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)