human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "generating random graphs with large girth"):
  Abstract: We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity -Check (LDPC) codes. For any constant k, alpha<1/2k(k+3) and m=O(n^{1+alpha}), our algorithm generate s an asymptotically uniform random graph with n vertices, m edges, and girth larger tha n k in polynomial time. To the best of our knowledge this is the first polynomial-algorith m for the problem. #R##N#Our algorithm generates a graph by sequentially adding m edges to an empty graph with n vertices. Recently, these types of sequential methods for counting and random generation have been very successful.

Includes members:
  Member "a sequential algorithm for generating random graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "random features strengthen graph neural networks")
  Member "how to find good finite length codes from art towards science":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "effects of single cycle structure on iterative decoding of low density parity check codes")

Question: Please tell me which class the source paper 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.DS(Data Structures and Algorithms)