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 "sharpedge an asynchronous and core agnostic solution to guarantee bounded delays"):
  Abstract: What are the key properties that a network should have to provide bounded-delay guarantees for the packets? In this paper, we attempt to answer this question. To that end, we explore the theory of bounded-delay networks and provide the necessary and the sufficient conditions required to have deterministic bounded-delays in the network. #R##N#We prove that as long as a network is work-conserving, independent of the packet scheduling and queue management algorithms used in the switches, it is sufficient to shape the traffic~\textit{properly} at the edge of the network to meet hard bounded-delays in the network. #R##N#Using the derived theorems, we present SharpEdge, a novel design to meet deterministic bounded-delays in the network. To the best of our knowledge, SharpEdge is the first scheme that can meet all following key properties: 1) it supports coexistence of different classes of traffic, while it can guarantee their different required bounded-delays 2) it does not require any changes in the core of the network, 3) it supports both periodic and bursty traffic patterns, and 4) it does not require any time synchronization between network devices.

Includes members:
  Member "bounding queue delay in cellular networks to support ultra low latency applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "make tcp great again in cellular networks a deep reinforcement learning approach")
  Member "make tcp great again in cellular networks a deep reinforcement learning approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "to schedule or not to schedule when no scheduling can beat the best known flow scheduling algorithm in datacenter networks")
  Member "toward optimal performance with network assisted tcp at mobile edge":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "to schedule or not to schedule when no scheduling can beat the best known flow scheduling algorithm in datacenter networks")
  Member "hyline a simple and practical flow scheduling for commodity datacenters":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "to schedule or not to schedule when no scheduling can beat the best known flow scheduling algorithm in datacenter networks")
  Member "cellular controlled delay tcp c2tcp":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "to schedule or not to schedule when no scheduling can beat the best known flow scheduling algorithm in datacenter networks")
  Member "c2tcp a flexible cellular tcp to meet stringent delay requirements":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "to schedule or not to schedule when no scheduling can beat the best known flow scheduling algorithm in datacenter networks")
  Member "finishing flows quickly with preemptive scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "to schedule or not to schedule when no scheduling can beat the best known flow scheduling algorithm in datacenter networks")

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)