human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "decentralized throughput maximizing policies for deadline constrained wireless networks"
  Abstract: We consider multi-hop wireless networks serving multiple flows in which only packets that meet hard end-to-end deadline constraints are useful, i.e., if a packet is not delivered to its destination node by its deadline, it is dropped from the network. We design decentralized scheduling policies for such multi-hop networks that attain the maximum throughput of useful packets. The resulting policy is decentralized in the sense that in order to make a transmission decision, a node only needs to know the "time-till-deadline" of the packets that are currently present at that node, and not the state of the entire network. The key to obtaining an easy-to-implement and highly decentralized policy is to replace the hard constraint on the number of simultaneous packet transmissions that can take place on the outgoing links of a node, by a time-average constraint on the number of transmissions. The policy thus obtained is guaranteed to provide maximum throughput. Analysis can be extended to the case of time-varying channel conditions in a straightforward manner. #R##N#Simulations showing significant improvement over existing policies for deadline based scheduling, such as Earliest Deadline First, and supporting the theory, are presented.

Connected through hyperedge HE-1 (induced by source paper "optimal information updating based on value of information"):
  with members:
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "age optimal information updates in multihop networks"
    - "remote estimation of the wiener process over a channel with random delay"
    - "index policies for optimal mean variance trade off of inter delivery times in real time sensor networks"
    - "optimizing quality of experience of dynamic video streaming over fading wireless networks"
    - "a high reliability asymptotic approach for packet inter delivery time optimization in cyber physical systems"
    - "pathwise performance of debt based policies for wireless networks with hard delay constraints"

Connected through hyperedge HE-2 (induced by source paper "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees"):
  with members:
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "low latency short packet transmissions fixed length or harq"
    - "5g wireless network slicing for embb urllc and mmtc a communication theoretic view"
    - "delay and peak age violation probability in short packet transmissions"
    - "content based status updates"
    - "short packets over block memoryless fading channels pilot assisted or noncoherent transmission"
    - "status updates through m g 1 1 queues with harq"
    - "age optimal information updates in multihop networks"

Connected through hyperedge HE-3 (induced by source paper "queue aware joint dynamic interference coordination and heterogeneous qos provisioning in ofdma networks"):
  with members:
    - "throughput optimization in multichannel cognitive radios with hard deadline constraints"
    - "utility optimal dynamic rate allocation under average end to end delay requirements"
    - "partially distributed resource allocation in small cell networks"
    - "resource allocation optimization for delay sensitive traffic in fronthaul constrained cloud radio access networks"
    - "distributed interference management policies for heterogeneous small cell networks"

Connected through hyperedge HE-4 (induced by source paper "delay and peak age violation probability in short packet transmissions"):
  with members:
    - "update or wait how to keep your data fresh"
    - "cross layer transmission design for tactile internet"
    - "on the age of information in status update systems with packet management"

Connected through hyperedge HE-5 (induced by source paper "timely throughput optimal scheduling with prediction"):
  with members:
    - "a new backpressure algorithm for joint rate control and routing with vanishing utility optimality gaps and finite queue lengths"
    - "online convex optimization using predictions"
    - "power delay tradeoff with predictive scheduling in integrated cellular and wi fi networks"
    - "scheduling periodic real time tasks with heterogeneous reward requirements"
    - "novel architectures and algorithms for delay reduction in back pressure scheduling and routing"

Connected through hyperedge HE-6 (induced by source paper "joint routing scheduling and power control providing hard deadline in wireless multihop networks"):
  with members:
    - "energy efficient scheduling of delay constrained traffic over fading channels"
    - "scheduling for stable and reliable communication over multiaccess channels and degraded broadcast channels"

Connected through hyperedge HE-7 (induced by source paper "optimizing quality of experience of dynamic video streaming over fading wireless networks"):
  with members:
    - "index policies for optimal mean variance trade off of inter delivery times in real time sensor networks"
    - "a high reliability asymptotic approach for packet inter delivery time optimization in cyber physical systems"
    - "analysis of buffer starvation with application to objective qoe optimization of streaming services"
    - "pathwise performance of debt based policies for wireless networks with hard delay constraints"

Question: Please tell me which class the center node 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)