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 "parameterized complexity of weak odd domination problems"):
  Abstract: Given a graph G=(V,E), a subset B⊆V of vertices is a weak odd dominated (WOD) set if there exists D⊆V∖B such that every vertex in B has an odd number of neighbours in D. κ(G) denotes the size of the largest WOD set, and κ′(G) the size of the smallest non-WOD set. The maximum of κ(G) and |V|−κ′(G), denoted κQ(G), plays a crucial role in quantum cryptography. In particular deciding, given a graph G and k>0, whether κQ(G)≤k is of practical interest in the design of graph-based quantum secret sharing schemes. The decision problems associated with the quantities κ, κ′ and κQ are known to be NP-Complete. In this paper, we consider the approximation of these quantities and the parameterized complexity of the corresponding problems. We mainly prove the fixed-parameter intractability (W[1]-hardness) of these problems. Regarding the approximation, we show that κQ, κ and κ′ admit a constant factor approximation algorithm, and that κ and κ′ have no polynomial approximation scheme unless P=NP.

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 "on the minimum degree up to local complementation bounds and complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "minimum degree up to local complementation bounds parameterized complexity and exact algorithms")

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.CC(Computational Complexity)