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 "temporal graph classes a view through temporal separators"):
  Abstract: We investigate the computational complexity of separating two distinct vertices s and z by vertex deletion in a temporal graph. In a temporal graph, the vertex set is fixed but the edges have (discrete) time labels. Since the corresponding Temporal (s, z)-Separation problem is NP-hard, it is natural to investigate whether relevant special cases exist that are computationally tractable. To this end, we study restrictions of the underlying (static) graph---there we observe polynomial-time solvability in the case of bounded treewidth---as well as restrictions concerning the "temporal evolution" along the time steps. Systematically studying partially novel concepts in this direction, we identify sharp borders between tractable and intractable cases.

Includes members:
  Member "the computational complexity of finding separators in temporal graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on polynomial time combinatorial algorithms for maximum l bounded flow")
  Member "the complexity of finding small separators in temporal graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multistage s t path confronting similarity with dissimilarity")
  Member "on the size and the approximability of minimum temporally connected subgraphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the computational complexity of finding temporal paths under waiting time constraints")
  Member "steiner network problems on temporal graphs":
    also connected through other hyperedges:
      (none)
  Member "an introduction to temporal graphs an algorithmic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "graph generators state of the art and open challenges")
  Member "on temporal graph exploration":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "live exploration with mobile robots in a dynamic ring revisited")
  Member "time varying graphs and dynamic networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "edge disjoint branchings in temporal graphs")

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)