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 "flows in temporal networks"):
  Abstract: We introduce temporal flows on temporal networks, i.e., networks the links of which exist only at certain moments of time. Temporal networks were defined by Kempe et al. STOC'00 (see also Mertzios et al. ICALP'13). Our flow model is new and differs substantially from the "Flows over time" model, also called "dynamic flows" in the literature. We show that the problem of finding the maximum amount of flow that can pass from a source vertex s to a sink vertex t up to a given time is solvable in Polynomial time, even when node buffers are bounded. We then examine mainly the case of unbounded node buffers. We provide a (simplified) static Time-Extended network, which is of polynomial size to the input and whose static flow rates are equivalent to the respective temporal flow of the temporal network; via that, we prove that the maximum temporal flow is equal to the minimum temporal s-t cut. We further show that temporal flows can always be decomposed into flows, each of which is "pushed" only through a journey, i.e., a directed path whose successive edges have strictly increasing moments of existence. Using the latter, we provide linear expected time algorithms for the maximum s-t temporal flow problem in networks of bounded node degrees with uniform, random, unique availabilities of edges. We then consider mixed temporal networks, which have some edges with specified availabilities and some edges with random availabilities; we show that it is #P-complete to compute the tails and expectations of the maximum temporal flow (which is now a random variable) in a mixed temporal network. Finally, we examine a Ford-Fulkerson inspired algorithm for maximum temporal flow in networks with a single availability for every edge and show that it computes the maximum temporal flow, i.e., there is an extension of the traditional algorithm for our model.

Includes members:
  Member "temporal network optimization subject to connectivity constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed computation and reconfiguration in actively dynamic networks")
  Member "on temporal graph exploration":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "live exploration with mobile robots in a dynamic ring revisited")
  Member "fast approximation algorithms for cut based problems in undirected graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a deterministic algorithm for balanced cut with applications to dynamic connectivity flows and beyond")
  Member "time varying graphs and dynamic networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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.DS(Data Structures and Algorithms)