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 "the computational complexity of finding temporal paths under waiting time constraints"):
  Abstract: Computing a (shortest) path between two vertices in a graph is one of the most fundamental primitive in graph algorithmics. In recent years, the study of paths in temporal graphs, that is, graphs where the vertex set remains static but the edge set may change over time, gained more and more attention. In a nutshell, temporal paths have to respect time, that is, they may only move forward in time. More formally, the time edges used by a temporal path either need to have increasing or non-decreasing time stamps. In is well known that computing temporal paths is polynomial-time solvable. We study a natural variant, where temporal paths may only dwell a certain given amount of time steps in any vertex, which we call restless temporal paths. This small modification creates a significant change in the computational complexity of the task of finding temporal paths. We show that finding restless temporal paths is NP-complete and give a thorough analysis of the (parameterized) computational complexity of this problem. In particular, we show that problem remains computationally hard on temporal graphs with three layers and is W[1]-hard when parameterized by the feedback vertex number of the underlying graph. On the positive side, we give an efficient (FPT) algorithm to find short restless temporal paths that has an asymptotically optimal running time assuming the Exponential Time Hypothesis.

Includes members:
  Member "an adaptive version of brandes algorithm for betweenness centrality":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "data reduction for maximum matching on real world graphs theory and experiments")
  Member "efficient computation of optimal temporal walks under waiting time constraints":
    also connected through other hyperedges:
      (none)
  Member "how fast can we reach a target vertex in stochastic temporal graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computing maximum matchings in temporal graphs")
  Member "temporal cliques admit sparse spanners":
    also connected through other hyperedges:
      (none)
  Member "fixed parameter algorithms for maximum profit facility location under matroid constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computing maximum matchings in temporal graphs")
  Member "the temporal explorer who returns to the base":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "temporal vertex cover with a sliding time window")
  Member "changing times to minimise reachability in temporal graphs":
    also connected through other hyperedges:
      (none)
  Member "deleting edges to restrict the size of an epidemic in temporal networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed computation and reconfiguration in actively dynamic networks")

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)