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 "building fastest broadcast trees in periodically varying graphs"):
  Abstract: Delay-tolerant networks (DTNs) are characterized by a possible absence of end-to-end communica- tion routes at any instant. Still, connectivity can general ly be established over time and space. The optimality of a temporal path (journey) in this context can be defined in s everal terms, including topological (e.g. shortest in hops) and temporal (e.g. fastest, foremost). The combinatorial problem of computing shortest, foremost, and fastest journeys given full knowledge of the network schedule was addressed a decade ago (Bui-Xuan et al., 2003). A recent line of research has focused on the distributed version of this problem, where foremost, shortest or fastest broadcast are performed without knowing the schedule beforehand. In this paper we show how to build fastest broadcast trees (i.e., trees that minimize the global duration of the broadcast, however late the departure is) in Time-Varying Graphs where intermittent edges are available periodically (it is known that the problem is infeasible in the general case even if various parameters of the graph are know). We address the general case where contacts between nodes can have arbitrary durations and thus fastest routes may consist of a mixture of continuous and discontinuous segments (a more complex scenario than when contacts are punctual and thus routes are only discontinuous). Using the abstraction of T- CLOCKS to compute the temporal distances, we solve the fastest broadcast problem by first learning, at the emitt er, what is its time of minimum temporal eccentricity (i.e. the fastest time to reach all the other nodes), and second by building a foremost broadcast tree relative to this particular emission date.

Includes members:
  Member "characterizing topological assumptions of distributed algorithms in dynamic networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed online data aggregation in dynamic graphs")
  Member "on the treewidth of dynamic graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finding structure in dynamic networks")
  Member "time varying graphs and dynamic networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "edge disjoint branchings in temporal graphs")
  Member "information propagation speed in mobile and delay tolerant networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "diffusion on dynamic contact networks with indirect transmission links")
  Member "exploration of periodically varying graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "temporal vertex cover with a sliding time window")

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.DC(Distributed, Parallel, and Cluster Computing)