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: "multistage vertex cover"
  Abstract: Covering all edges of a graph by a minimum number of vertices, this is the NP-hard Vertex Cover problem, is among the most fundamental algorithmic tasks. Following a recent trend in studying dynamic and temporal graphs, we initiate the study of Multistage Vertex Cover. Herein, having a series of graphs with same vertex set but over time changing edge sets (known as temporal graph consisting of various layers), the goal is to find for each layer of the temporal graph a small vertex cover and to guarantee that the two vertex cover sets between two subsequent layers differ not too much (specified by a given parameter). We show that, different from classic Vertex Cover and some other dynamic or temporal variants of it, Multistage Vertex Cover is computationally hard even in fairly restricted settings. On the positive side, however, we also spot several fixed-parameter tractability results based on some of the most natural parameterizations.

Connected through hyperedge HE-1 (induced by source paper "multistage graph problems on a global budget"):
  with members:
    - "temporal matching"
    - "computing maximum matchings in temporal graphs"
    - "online multistage subset maximization problems"
    - "multistage knapsack"
    - "changing bases multistage optimization for matroids and matchings"
    - "facility location in evolving metrics"
    - "contracting graphs to paths and trees"

Connected through hyperedge HE-2 (induced by source paper "approximating multistage matching problems"):
  with members:
    - "online multistage subset maximization problems"
    - "temporal vertex cover with a sliding time window"
    - "fully dynamic matching in bipartite graphs"
    - "changing bases multistage optimization for matroids and matchings"

Connected through hyperedge HE-3 (induced by source paper "lp based algorithms for multistage minimization problems"):
  with members:
    - "online multistage subset maximization problems"
    - "multistage knapsack"
    - "changing bases multistage optimization for matroids and matchings"
    - "facility location in evolving metrics"
    - "dynamic facility location via exponential clocks"
    - "the power of deferral maintaining a constant competitive steiner tree online"
    - "on the tradeoff between stability and fit"
    - "a new multilayered pcp and the hardness of hypergraph vertex cover"

Connected through hyperedge HE-4 (induced by source paper "multistage problems on a global budget"):
  with members:
    - "online multistage subset maximization problems"
    - "multistage knapsack"
    - "changing bases multistage optimization for matroids and matchings"
    - "facility location in evolving metrics"
    - "contracting graphs to paths and trees"

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)