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 short cycle enumeration in biregular bipartite graphs"
  Abstract: A number of recent works have used a variety of combinatorial constructions to derive Tanner graphs for LDPC codes and some of these have been shown to perform well in terms of their probability of error curves and error floors. Such graphs are bipartite and many of these constructions yield biregular graphs where the degree of left vertices is a constant $c+1$ and that of the right vertices is a constant $d+1$. Such graphs are termed $(c+1,d+1)$ biregular bipartite graphs here. One property of interest in such work is the girth of the graph and the number of short cycles in the graph, cycles of length either the girth or slightly larger. Such numbers have been shown to be related to the error floor of the probability of error curve of the related LDPC code. Using known results of graph theory, it is shown how the girth and the number of cycles of length equal to the girth may be computed for these $(c+1,d+1)$ biregular bipartite graphs knowing only the parameters $c$ and $d$ and the numbers of left and right vertices. While numerous algorithms to determine the number of short cycles in arbitrary graphs exist, the reduction of the problem from an algorithm to a computation for these biregular bipartite graphs is of interest.

Connected through hyperedge HE-1 (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 characterization of elementary trapping sets of variable regular ldpc codes"
    - "lowering the error floor of ldpc codes using cyclic liftings"

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

Connected through hyperedge HE-3 (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 characterization of elementary trapping sets of variable regular ldpc codes"
    - "lowering the error floor of ldpc codes using cyclic liftings"

Connected through hyperedge HE-4 (induced by source paper "counting short cycles of c d regular bipartite graphs"):
  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"

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)