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: "improved delay bound for a service curve element with known transmission rate"
  Abstract: In deterministic and time-sensitive networking, it is important to bound delays of network elements in the worst case. Network calculus is often used to formally prove such delay bounds, based on arrival and service curves characterizations. In this letter, we provide a delay bound for a FIFO system with rate-latency service curve. Our delay bound improves on the network calculus one by exploiting information on the transmission rate. We prove that our bound is tight.

Connected through hyperedge HE-1 (induced by source paper "on time synchronization issues in time sensitive networks with regulators and nonideal clocks"):
  with members:
    - "a theory of traffic regulators for deterministic networks with application to interleaved regulators"

Connected through hyperedge HE-2 (induced by source paper "tsn algorithms for large scale networks a survey and conceptual comparison"):
  with members:
    - "ultra low latency ull networks the ieee tsn and ietf detnet standards and related 5g ull research"
    - "end to end latency and backlog bounds in time sensitive networking with credit based shapers and asynchronous traffic shaping"
    - "a theory of traffic regulators for deterministic networks with application to interleaved regulators"
    - "on the fly erasure coding for real time video applications"

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)