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 "graph isomorphism in quasipolynomial time parameterized by treewidth"):
  Abstract: We extend Babai's quasipolynomial-time graph isomorphism test (STOC 2016) and develop a quasipolynomial-time algorithm for the multiple-coset isomorphism problem. The algorithm for the multiple-coset isomorphism problem allows to exploit graph decompositions of the given input graphs within Babai's group theoretic framework. #R##N#We use it to develop a graph isomorphism test that runs in time $n^{\operatorname{polylog}(k)}$ where $n$ is the number of vertices and $k$ is the maximum treewidth of the given graphs and $\operatorname{polylog}(k)$ is some polynomial in $\operatorname{log}(k)$. Our result generalizes Babai's quasipolynomial-time graph isomorphism test.

Includes members:
  Member "hypergraph isomorphism for groups with restricted composition factors":
    also connected through other hyperedges:
      (none)
  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 faster isomorphism test for graphs of small degree":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "hypergraph isomorphism for groups with restricted composition factors")
  Member "minimum circuit size graph isomorphism and related problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a unifying method for the design of algorithms canonizing combinatorial objects")
  Member "canonizing graphs of bounded tree width in logspace":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal in place algorithms for basic graph problems")
  Member "graph isomorphism in quasipolynomial time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hypergraph isomorphism for groups with restricted composition factors")
  Member "graph isomorphism for bounded genus graphs in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hypergraph isomorphism for groups with restricted composition factors")

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)