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 "minimum degree up to local complementation bounds parameterized complexity and exact algorithms"):
  Abstract: The local minimum degree of a graph is the minimum degree that can be reached by means of local complementation. For any n, there exist graphs of order n which have a local minimum degree at least 0.189n, or at least 0.110n when restricted to bipartite graphs. Regarding the upper bound, we show that the local minimum degree is at most \(\frac{3}{8}n+o(n)\) for general graphs and \(\frac{n}{4}+o(n)\) for bipartite graphs, improving the known \(\frac{n}{2}\) upper bound. We also prove that the local minimum degree is smaller than half of the vertex cover number (up to a logarithmic term). The local minimum degree problem is NP-Complete and hard to approximate. We show that this problem, even when restricted to bipartite graphs, is in W[2] and FPT-equivalent to the EvenSet problem, whose W[1]-hardness is a long standing open question. Finally, we show that the local minimum degree is computed by a \(\mathcal O^*(1.938^n)\)-algorithm, and a \(\mathcal O^*(1.466^n)\)-algorithm for the bipartite graphs.

Includes members:
  Member "on weak odd domination and graph based quantum secret sharing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the complexity of finding large odd induced subgraphs and odd colorings")
  Member "the parameterized complexity of domination type problems and application to linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new algorithms for weighted k domination and total k domination problems in proper interval graphs")
  Member "parameterized complexity of weak odd domination problems":
    also connected through other hyperedges:
      (none)
  Member "on the minimum degree up to local complementation bounds and complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterized complexity of weak odd domination 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.DM(Discrete Mathematics)