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 "induced minor free graphs isomorphism and clique width"):
  Abstract: Given two graphs $G$ and $H$, we say that $G$ contains $H$ as an induced minor if a graph isomorphic to $H$ can be obtained from $G$ by a sequence of vertex deletions and edge contractions. We study the complexity of Graph Isomorphism on graphs that exclude a fixed graph as an induced minor. More precisely, we determine for every graph $H$ that Graph Isomorphism is polynomial-time solvable on $H$-induced-minor-free graphs or that it is GI-complete. Additionally, we classify those graphs $H$ for which $H$-induced-minor-free graphs have bounded clique-width. These two results complement similar dichotomies for graphs that exclude a fixed graph as an induced subgraph, minor, or subgraph.

Includes members:
  Member "graph isomorphism in quasipolynomial time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hypergraph isomorphism for groups with restricted composition factors")
  Member "isomorphism testing for graphs of bounded rank width":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hypergraph isomorphism for groups with restricted composition factors")
  Member "clique width of graph classes defined by two forbidden induced subgraphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "theta triangle free and even hole k 4 free graphs part 2 bounds on treewidth")
  Member "reduction techniques for graph isomorphism in the context of width parameters":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an improved isomorphism test for bounded tree width graphs")
  Member "classifying the clique width of h free bipartite graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on efficient domination for some classes of h free bipartite graphs")
  Member "towards an isomorphism dichotomy for hereditary graph classes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "graph isomorphism for h_1 h_2 free graphs an almost complete dichotomy")
  Member "fixed parameter tractable canonization and isomorphism test for graphs of bounded treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "computing the frechet distance of trees and graphs of bounded tree width")
  Member "clique width and edge contraction":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the behavior of clique width under graph operations and graph transformations")

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.DM(Discrete Mathematics)