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 "deltapath dataflow based high performance incremental routing"):
  Abstract: Routing controllers must react quickly to failures, reconfigurations and workload or policy changes, to ensure service performance and cost-efficient network operation. We propose a general execution model which views routing as an incremental data-parallel computation on a graph-based network model plus a continuous stream of network changes. Our approach supports different routing objectives with only minor re-configuration of its core algorithm, and easily accomodates dynamic user-defined routing policies. Moreover, our prototype demonstrates excellent performance: on Google Jupiter topology it reacts with a median time of 350ms to link failures and serves more than two million path requests per second each with latency under 1ms. This is three orders-of-magnitude faster than the popular ONOS open-source SDN controller.

Includes members:
  Member "lying your way to better traffic engineering":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "memento making sliding windows efficient for heavy hitters")
  Member "kulfi robust traffic engineering using semi oblivious routing":
    also connected through other hyperedges:
      (none)
  Member "lightweight asynchronous snapshots for distributed dataflows":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "aion better late than never in event time streams")
  Member "flexible network bandwidth and latency provisioning in the datacenter":
    also connected through other hyperedges:
      (none)
  Member "merlin a language for provisioning network resources":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "viscr intuitive conflict free automation for securing the dynamic consumer iot infrastructures")
  Member "jellyfish networking data centers randomly":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "metteor robust multi traffic topology engineering for commercial data center networks")
  Member "bidirectional heuristic search reconsidered":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "adaptively informed trees ait fast asymptotically optimal path planning through adaptive heuristics")

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)