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: "low delay random linear coding and scheduling over multiple interfaces"
  Abstract: Multipath transport protocols like MPTCP transfer data across multiple routes in parallel and deliver it in order at the receiver. When the delay on one or more of the paths is variable, as is commonly the case, out of order arrivals are frequent and head of line blocking leads to high latency. This is exacerbated when packet loss, which is also common with wireless links, is tackled using ARQ. This paper introduces Stochastic Earliest Delivery Path First (S-EDPF), a resilient low delay packet scheduler for multipath transport protocols. S-EDPF takes explicit account of the stochastic nature of paths and uses this to minimise in-order delivery delay. S-EDPF also takes account of FEC, jointly scheduling transmission of information and coded packets and in this way allows lossy links to reduce delay and improve resiliency, rather than degrading performance as usually occurs with existing multipath systems. We implement S-EDPF as a multi-platform application that does not require administration privileges nor modifications to the operating system and has negligible impact on energy consumption. We present a thorough experimental evaluation in both controlled environments and into the wild, revealing dramatic gains in delay performance compared to existing approaches.

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"
    - "homa a receiver driven low latency transport protocol using network priorities"
    - "machine learning for networking workflow advances and opportunities"

Connected through hyperedge HE-2 (induced by source paper "regulating queueing delay in 802 11ac wlans nonlinear controller analysis and design"):
  with members:
    - "quick and plenty achieving low delay and high rate in 802 11ac edge networks"
    - "control theoretic optimization of 802 11 wlans implementation and experimental evaluation"

Connected through hyperedge HE-3 (induced by source paper "multipath communication with finite sliding window network coding for ultra reliability and low latency"):
  with members:
    - "decoding delay performance of random linear network coding for broadcast"
    - "wireless access for ultra reliable low latency communication urllc principles and building blocks"
    - "multi path low delay network codes"
    - "low delay random linear coding over a stream"

Connected through hyperedge HE-4 (induced by source paper "mptcp meets fec supporting latency sensitive applications over heterogeneous networks"):
  with members:
    - "ctcp coded tcp using multiple paths"
    - "network coded tcp ctcp"

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)