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: "scheduling storms and streams in the cloud"
  Abstract: Motivated by emerging big streaming data processing paradigms (e.g., Twitter Storm, Streaming MapReduce), we investigate the problem of scheduling graphs over a large cluster of servers. Each graph is a job, where nodes represent compute tasks and edges indicate data-flows between these compute tasks. Jobs (graphs) arrive randomly over time, and upon completion, leave the system. When a job arrives, the scheduler needs to partition the graph and distribute it over the servers to satisfy load balancing and cost considerations. Specifically, neighboring compute tasks in the graph that are mapped to different servers incur load on the network; thus a mapping of the jobs among the servers incurs a cost that is proportional to the number of "broken edges". We propose a low complexity randomized scheduling algorithm that, without service preemptions, stabilizes the system with graph arrivals/departures; more importantly, it allows a smooth trade-off between minimizing average partitioning cost and average queue lengths. Interestingly, to avoid service preemptions, our approach does not rely on a Gibbs sampler; instead, we show that the corresponding limiting invariant measure has an interpretation stemming from a loss system.

Connected through hyperedge HE-1 (induced by source paper "allocation of computation intensive graph jobs over vehicular clouds in iov"):
  with members:
    - "power aware allocation of graph jobs in geo distributed cloud networks"
    - "allocation of graph jobs in geo distributed cloud networks"
    - "joint task offloading scheduling and transmit power allocation for mobile edge computing systems"
    - "software defined space air ground integrated vehicular networks challenges and solutions"
    - "a survey on low latency towards 5g ran core network and caching solutions"

Connected through hyperedge HE-2 (induced by source paper "delay optimal distributed edge computing in wireless edge networks"):
  with members:
    - "efficient multi user computation offloading for mobile edge cloud computing"

Connected through hyperedge HE-3 (induced by source paper "multi task offloading over vehicular clouds under graph based representation"):
  with members:
    - "allocation of computation intensive graph jobs over vehicular clouds in iov"
    - "power aware allocation of graph jobs in geo distributed cloud networks"
    - "multi user multi task offloading and resource allocation in mobile cloud systems"

Connected through hyperedge HE-4 (induced by source paper "power aware allocation of graph jobs in geo distributed cloud networks"):
  with members:
    - "on non preemptive vm scheduling in the cloud"
    - "a two stage auction mechanism for cloud resource allocation"

Connected through hyperedge HE-5 (induced by source paper "scaling stream processing with transactional state management on multicores"):
  with members:
    - "oltp on hardware islands"

Connected through hyperedge HE-6 (induced by source paper "on non preemptive vm scheduling in the cloud"):
  with members:
    - "research directions in network service chaining"
    - "randomized scheduling algorithm for queueing networks"

Connected through hyperedge HE-7 (induced by source paper "allocation of graph jobs in geo distributed cloud networks"):
  with members:
    - "a two stage auction mechanism for cloud resource allocation"

Connected through hyperedge HE-8 (induced by source paper "iot stream processing and analytics in the fog"):
  with members:
    - "dynamic service migration in mobile edge clouds"

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)