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 "exact crossing number parameterized by vertex cover"):
  Abstract: We prove that the exact crossing number of a graph can be efficiently computed for simple graphs having bounded vertex cover. In more precise words, Crossing Number is in FPT when parameterized by the vertex cover size. This is a notable advance since we know only very few nontrivial examples of graph classes with unbounded and yet efficiently computable crossing number. Our result can be viewed as a strengthening of a previous result of Lokshtanov [arXiv, 2015] that Optimal Linear Arrangement is in FPT when parameterized by the vertex cover size, and we use a similar approach of reducing the problem to a tractable instance of Integer Quadratic Programming as in Lokshtanov's paper.

Includes members:
  Member "crossing minimization in perturbed drawings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "homotopic curve shortening and the affine curve shortening flow")
  Member "approximating the rectilinear crossing number":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "crossing numbers and stress of random graphs")
  Member "crossing number for graphs with bounded pathwidth":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "crossing numbers and stress of random graphs")
  Member "parameterized integer quadratic programming variables and coefficients":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stable marriage with groups of similar agents")
  Member "adding one edge to planar graphs makes crossing number and 1 planarity hard":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an experimental study of a 1 planarity testing and embedding algorithm")
  Member "hardness of approximation for crossing number":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "crossing numbers and stress of random graphs")
  Member "an algorithm for the graph crossing number problem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "crossing numbers and stress of random graphs")
  Member "computing crossing numbers in quadratic time":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "maximum cut parameterized by crossing number")

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)