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 "beating the generator enumeration bound for p group isomorphism"):
  Abstract: We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G cong H. For several decades, the n^(log_p n + O(1)) generator-enumeration bound (where p is the smallest prime dividing the order of the group) has been the best worst-case result for general groups. In this work, we show the first improvement over the generator-enumeration bound for p-groups, which are believed to be the hard case of the group isomorphism problem. We start by giving a Turing reduction from group isomorphism to n^((1 / 2) log_p n + O(1)) instances of p-group composition-series isomorphism. By showing a Karp reduction from p-group composition-series isomorphism to testing isomorphism of graphs of degree at most p + O(1) and applying algorithms for testing isomorphism of graphs of bounded degree, we obtain an n^(O(p)) time algorithm for p-group composition-series isomorphism. Combining these two results yields an algorithm for p-group isomorphism that takes at most n^((1 / 2) log_p n + O(p)) time. This algorithm is faster than generator-enumeration when p is small and slower when p is large. Choosing the faster algorithm based on p and n yields an upper bound of n^((1 / 2 + o(1)) log n) for p-group isomorphism.

Includes members:
  Member "beating the generator enumeration bound for solvable group isomorphism":
    also connected through other hyperedges:
      (none)
  Member "bidirectional collision detection and faster deterministic isomorphism testing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "isomorphism problems for tensors groups and cubic forms completeness and reductions")
  Member "algorithms for group isomorphism via group extensions and cohomology":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "isomorphism problems for tensors groups and cubic forms completeness and reductions")
  Member "breaking the n log n barrier for solvable group isomorphism":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "isomorphism problems for tensors groups and cubic forms completeness and reductions")
  Member "efficient isomorphism testing for a class of group extensions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the group and color isomorphism problems")

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)