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: "lower bounds on the lifting degree of single edge and multiple edge qc ldpc codes by difference matrices"
  Abstract: In this paper, we define two matrices named as "difference matrices", denoted by $D$ and $DD$ which significantly contribute to achieve regular single-edge QC-LDPC codes with the shortest length and the certain girth as well as regular and irregular multiple-edge QC-LDPC codes. #R##N#Making use of these matrices, we obtain necessary and sufficient conditions to have single-edge $(m,n)$-regular QC-LDPC codes with girth 6, 10 and 12. Additionally, for girth 6, we achieve all non-isomorphic codes with the minimum lifting degree, $N$, for $m=4$ and $5\leq n\leq 11$, and present an exponent matrix for each minimum distance. For girth 10, we provide a lower bound on the lifting degree which is tighter than the existing bound. More important, for an exponent matrix whose first row and first column are all-zero, we demonstrate that the non-existence of 8-cycles proves the non-existence of 6-cycles related to the first row of the exponent matrix too. All non-isomorphic QC-LDPC codes with girth 10 and $n=5,6$ whose numbers are more than those presented in the literature are provided. For $n=7,8$ we decrease the lifting degrees from 159 and 219 to 145 and 211, repectively. For girth 12, a lower bound on the lifting degree is achieved. #R##N#For multiple-edge category, for the first time a lower bound on the lifting degree for both regular and irregular QC-LDPC codes with girth 6 is achieved. We also demonstrate that the achieved lower bounds on multiple-edge $(4,n)$-regular QC-LDPC codes with girth 6 are tight and the resultant codes have shorter length compared to their counterparts in single-edge codes. Additionally, difference matrices help to reduce the conditions of considering 6-cycles from seven states to five states. We obtain multiple-edge $(4,n)$-regular QC-LDPC codes with girth 8 and $n=4,6,8$ with the shortest length.

Connected through hyperedge HE-1 (induced by source paper "compact qc ldpc block and sc ldpc convolutional codes for low latency communications"):
  with members:
    - "efficient search of compact qc ldpc and sc ldpc convolutional codes with large girth"
    - "design and analysis of time invariant sc ldpc convolutional codes with small constraint length"
    - "searching for voltage graph based ldpc tailbiting codes with large girth"
    - "terminated ldpc convolutional codes with thresholds close to capacity"

Connected through hyperedge HE-2 (induced by source paper "efficient search of compact qc ldpc and sc ldpc convolutional codes with large girth"):
  with members:
    - "design and analysis of time invariant sc ldpc convolutional codes with small constraint length"
    - "searching for voltage graph based ldpc tailbiting codes with large girth"
    - "terminated ldpc convolutional codes with thresholds close to capacity"

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)