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 "on the power of randomization for scheduling real time traffic in wireless networks"):
  Abstract: In this paper, we consider the problem of scheduling real-time traffic in wireless networks under a conflict-graph interference model and single-hop traffic. The objective is to guarantee that at least a certain fraction of packets of each link are delivered within their deadlines, which is referred to as delivery ratio. This problem has been studied before under restrictive frame-based traffic models, or greedy maximal scheduling schemes like LDF (Largest-Deficit First) that provide poor delivery ratio for general traffic patterns. In this paper, we pursue a different approach through randomization over the choice of maximal links that can transmit at each time. We design randomized policies in collocated networks, multi-partite networks, and general networks, that can achieve delivery ratios much higher than what is achievable by LDF. Further, our results apply to traffic (arrival and deadline) processes that evolve as positive recurrent Markov Chains. Hence, this work is an improvement with respect to both efficiency and traffic assumptions compared to the past work. We further present extensive simulation results over various traffic patterns and interference graphs to illustrate the gains of our randomized policies over LDF variants.

Includes members:
  Member "on the effect of channel fading on greedy scheduling":
    also connected through other hyperedges:
      (none)
  Member "internet of things iot a vision architectural elements and future directions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "neuromemristive circuits for edge computing a review")
  Member "one to rule them all a general randomized algorithm for buffer management with bounded delay":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online algorithms for machine minimization")
  Member "scheduling for optimal rate allocation in ad hoc networks with heterogeneous delay constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the credibility of information flows in real time wireless networks")
  Member "on the design of efficient csma algorithms for wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "hybrid scheduling in heterogeneous half and full duplex wireless networks")
  Member "q csma queue length based csma ca algorithms for achieving maximum throughput and low delay in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "closed form whittle s index enabled random access for timely status update")
  Member "optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "is deadline oblivious scheduling efficient for controlling real time traffic in cellular downlink systems")
  Member "scheduling heterogeneous real time traffic over fading wireless channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "offloading deadline constrained cellular traffic")

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)