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: "homa a receiver driven low latency transport protocol using network priorities"
  Abstract: Homa is a new transport protocol for datacenter networks. It provides exceptionally low latency, especially for workloads with a high volume of very short messages, and it also supports large messages and high network utilization. Homa uses in-network priority queues to ensure low latency for short messages; priority allocation is managed dynamically by each receiver and integrated with a receiver-driven flow control mechanism. Homa also uses controlled overcommitment of receiver downlinks to ensure efficient bandwidth utilization at high load. Our implementation of Homa delivers 99th percentile round-trip times less than 15 μs for short messages on a 10 Gbps network running at 80% load. These latencies are almost 100x lower than the best published measurements of an implementation. In simulations, Homa's latency is roughly equal to pFabric and significantly better than pHost, PIAS, and NDP for almost all message sizes and workloads. Homa can also sustain higher network loads than pFabric, pHost, or PIAS.

Connected through hyperedge HE-1 (induced by source paper "a survey on recent advances in transport layer protocols"):
  with members:
    - "a quic implementation for ns 3"
    - "beyond socket options making the linux tcp stack truly extensible"
    - "low delay scheduling of objects over multiple wireless paths"
    - "elasticity detection a building block for delay sensitive congestion control"
    - "datacenter traffic control understanding techniques and tradeoffs"
    - "qaware a cross layer approach to mptcp scheduling"
    - "machine learning for networking workflow advances and opportunities"
    - "mptcp meets fec supporting latency sensitive applications over heterogeneous networks"

Connected through hyperedge HE-2 (induced by source paper "cross layer design for mission critical iot in mobile edge computing systems"):
  with members:
    - "improving network availability of ultra reliable and low latency communications with multi connectivity"
    - "asynchronous mobile edge computation offloading energy efficient resource management"
    - "energy efficient joint offloading and wireless resource allocation strategy in multi mec server systems"
    - "joint uplink and downlink resource configuration for ultra reliable and low latency communications"
    - "performance optimization in mobile edge computing via deep reinforcement learning"
    - "a survey on mobile edge computing the communication perspective"
    - "latency and reliability aware task offloading and resource allocation for mobile edge computing"
    - "delay optimal computation task scheduling for mobile edge computing systems"

Connected through hyperedge HE-3 (induced by source paper "fatpaths routing in supercomputers data centers and clouds with low diameter networks when shortest paths fall short"):
  with members:
    - "slim fly a cost effective low diameter network topology"
    - "expander datacenters from theory to practice"
    - "revisiting network support for rdma"
    - "a survey and evaluation of data center network topologies"
    - "measuring and understanding throughput of network topologies"
    - "enabling highly scalable remote memory access programming with mpi 3 one sided"
    - "jellyfish networking data centers randomly"

Connected through hyperedge HE-4 (induced by source paper "λ nic interactive serverless compute on programmable smartnics"):
  with members:
    - "scalable methods for 8 bit training of neural networks"
    - "comparative study of deep learning software frameworks"
    - "8 bit approximations for parallelism in deep learning"

Connected through hyperedge HE-5 (induced by source paper "tiny buffer tcp for data center networks"):
  with members:
    - "pcc re architecting congestion control for consistent high performance"
    - "finishing flows quickly with preemptive scheduling"

Connected through hyperedge HE-6 (induced by source paper "load balancing guardrails keeping your heavy traffic on the road to low response times"):
  with members:
    - "flexible load balancing with multi dimensional state space collapse throughput and heavy traffic delay optimality"

Connected through hyperedge HE-7 (induced by source paper "backpressure flow control"):
  with members:
    - "revisiting network support for rdma"

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)