human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on weak odd domination and graph based quantum secret sharing"
  Abstract: A weak odd dominated (WOD) set in a graph is a subset B of vertices for which there exists a distinct set of vertices C such that every vertex in B has an odd number of neighbors in C. We point out the connections of weak odd domination with odd domination, ? , ? -domination, and perfect codes. We introduce bounds on ? ( G ) , the maximum size of WOD sets of a graph G, and on ? ' ( G ) , the minimum size of non-WOD sets of G. Moreover, we prove that the corresponding decision problems are NP-complete.The study of weak odd domination is mainly motivated by the design of graph-based quantum secret sharing protocols: a graph G of order n corresponds to a secret sharing protocol whose threshold is ? Q ( G ) = max ? ( ? ( G ) , n - ? ' ( G ) ) . These graph-based protocols are very promising in terms of physical implementation, however all such graph-based protocols studied in the literature have quasi-unanimity thresholds (i.e. ? Q ( G ) = n - o ( n ) where n is the order of the graph G underlying the protocol). In this paper, we show using probabilistic methods the existence of graphs with smaller ? Q (i.e. ? Q ( G ) ? 0.811 n where n is the order of G). We also prove that deciding for a given graph G whether ? Q ( G ) ? k is NP-complete, which means that one cannot efficiently double check that a graph randomly generated has actually a ? Q smaller than 0.811n.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of finding large odd induced subgraphs and odd colorings"):
  with members:
    - "slightly superexponential parameterized problems"
    - "rank based approach on graphs with structured neighborhood"
    - "finding even subgraphs even faster"
    - "better algorithms for satisfiability problems for formulas of bounded rank width"
    - "known algorithms on graphs of bounded treewidth are probably optimal"

Connected through hyperedge HE-2 (induced by source paper "minimum degree up to local complementation bounds parameterized complexity and exact algorithms"):
  with members:
    - "the parameterized complexity of domination type problems and application to linear codes"
    - "parameterized complexity of weak odd domination problems"
    - "on the minimum degree up to local complementation bounds and complexity"

Connected through hyperedge HE-3 (induced by source paper "parameterized complexity of weak odd domination problems"):
  with members:
    - "the parameterized complexity of domination type problems and application to linear codes"
    - "on the minimum degree up to local complementation bounds and complexity"

Question: Please tell me which class the center node 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)