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 decentralized scheduling of multi hop networks with end to end deadline constraints unreliable links"):
  Abstract: We consider unreliable multi-hop networks serving multiple flows in which packets not delivered to their destination nodes by their deadlines are dropped. We address the design of policies for routing and scheduling packets that optimize any specified weighted average of the throughputs of the flows. We provide a new approach which directly yields an optimal distributed scheduling policy that attains any desired maximal timely-throughput vector under average-power constraints on the nodes. It pursues a novel intrinsically stochastic decomposition of the Lagrangian of the constrained network-wide MDP rather than of the fluid model. All decisions regarding a packet's transmission scheduling, transmit power level, and routing, are completely distributed, based solely on the age of the packet, not requiring any knowledge of network state or queue lengths at any of the nodes. Global coordination is achieved through a tractably computable "price" for transmission energy. This price is different from that used to derive the backpressure policy where price corresponds to queue lengths. A quantifiably near-optimal policy is provided if nodes have peak-power constraints.

Includes members:
  Member "optimizing quality of experience of dynamic video streaming over fading wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal information updating based on value of information")
  Member "pathwise performance of debt based policies for wireless networks with hard delay constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal information updating based on value of information")
  Member "scheduling periodic real time tasks with heterogeneous reward requirements":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "timely throughput optimal scheduling with prediction")
  Member "fast mixing of parallel glauber dynamics and low delay csma scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "utility maximization for delay constrained qos in wireless":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "utility optimal dynamic rate allocation under average end to end delay requirements")
  Member "rethinking information theory for mobile ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "end to end simulation of integrated access and backhaul at mmwaves")

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.NI(Networking and Internet Architecture)