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 "normalizers and permutational isomorphisms in simply exponential time"):
  Abstract: We show that normalizers and permutational isomorphisms of permutation groups given by generating sets can be computed in time simply exponential in the degree of the groups. The result is obtained by exploiting canonical forms for permutation groups (up to permutational isomorphism).

Includes members:
  Member "an improved isomorphism test for bounded tree width graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hypergraph isomorphism for groups with restricted composition factors")
  Member "a unifying method for the design of algorithms canonizing combinatorial objects":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hypergraph isomorphism for groups with restricted composition factors")
  Member "beating the generator enumeration bound for p group isomorphism":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "incorporating weisfeiler leman into algorithms for group isomorphism")
  Member "algorithms for group isomorphism via group extensions and cohomology":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "isomorphism problems for tensors groups and cubic forms completeness and reductions")

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)