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 "throughput optimal multi hop broadcast algorithms"):
  Abstract: In this paper we design throughput-optimal dynamic broadcast algorithms for multi-hop networks with arbitrary topologies. Most of the previous broadcast algorithms route packets along spanning trees, rooted at the source node. For large dynamic networks, computing and maintaining a set of spanning trees is not efficient, as the network-topology may change frequently. In this paper we design a class of dynamic algorithms which makes packet-by-packet scheduling and routing decisions and thus obviates the need for maintaining any global topological structures, such as spanning trees. Our algorithms may be conveniently understood as a non-trivial generalization of the familiar back-pressure algorithm which makes unicast packet routing and scheduling decisions, based on queue-length information, without maintaining end-to-end paths. However, in the broadcast problem, it is hard to define queuing structures due to absence of a work-conservation principle which results from packet duplications. We design and prove the optimality of a virtual-queue based algorithm, where a virtual-queue is defined for subsets of vertices. We then propose a multi-class broadcast policy which combines the above scheduling algorithm with a class-based in-order packet delivery constraint, resulting in significant reduction in complexity. Finally, we evaluate performance of the proposed algorithms via extensive numerical simulations.

Includes members:
  Member "throughput optimal broadcast in wireless networks with dynamic topology":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "broadcasting real time flows in integrated backhaul and access 5g networks")
  Member "throughput optimal multihop broadcast on directed acyclic wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "broadcast age of information in csma ca based wireless networks")
  Member "throughput optimal broadcast on directed acyclic graphs":
    also connected through other hyperedges:
      (none)

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)