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: "scheduling for optimal rate allocation in ad hoc networks with heterogeneous delay constraints"
  Abstract: This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fraction of packets must be transmitted before the end of the deadline. Using optimization and stochastic network theory we propose a framework to model the quality of service (QoS) requirements under delay constraints. The model allows for fairly general arrival models with heterogeneous constraints. The framework results in an optimal scheduling algorithm which fairly allocates data rates to all flows while meeting long-term delay demands. We also prove that under a simplified scenario our solution translates into a greedy strategy that makes optimal decisions with low complexity.

Connected through hyperedge HE-1 (induced by source paper "on the power of randomization for scheduling real time traffic in wireless networks"):
  with members:
    - "on the effect of channel fading on greedy scheduling"
    - "internet of things iot a vision architectural elements and future directions"
    - "one to rule them all a general randomized algorithm for buffer management with bounded delay"
    - "on the design of efficient csma algorithms for wireless networks"
    - "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks"
    - "optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic"
    - "scheduling heterogeneous real time traffic over fading wireless channels"

Connected through hyperedge HE-2 (induced by source paper "on the credibility of information flows in real time wireless networks"):
  with members:
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "optimizing age of information in wireless networks with perfect channel state information"
    - "timely throughput of heterogeneous wireless networks fundamental limits and algorithms"

Connected through hyperedge HE-3 (induced by source paper "technique report scheduling flows with multiple service frequency constraints"):
  with members:
    - "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks"
    - "optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic"

Connected through hyperedge HE-4 (induced by source paper "utility optimal dynamic rate allocation under average end to end delay requirements"):
  with members:
    - "utility maximization for delay constrained qos in wireless"

Connected through hyperedge HE-5 (induced by source paper "a framework for quality of service with a multiple access strategy"):
  with members:
    - "a fast csma algorithm for deadline constrained scheduling over wireless fading channels"
    - "utility maximization for delay constrained qos in wireless"
    - "scheduling heterogeneous real time traffic over fading wireless channels"

Connected through hyperedge HE-6 (induced by source paper "capacity and scheduling of access points for multiple live video streams"):
  with members:
    - "scheduling periodic real time tasks with heterogeneous reward requirements"
    - "optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic"

Connected through hyperedge HE-7 (induced by source paper "adaptive network coding for scheduling real time traffic with hard deadlines"):
  with members:
    - "effective delay control in online network coding"
    - "arq for network coding"

Connected through hyperedge HE-8 (induced by source paper "optimal deadline scheduling with commitment"):
  with members:
    - "optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic"
    - "scheduling heterogeneous real time traffic over fading wireless channels"

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)