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 "slim fly a cost effective low diameter network topology"):
  Abstract: We introduce a high-performance cost-effective network topology called Slim Fly that approaches the theoretically optimal network diameter. Slim Fly is based on graphs that approximate the solution to the degree-diameter problem. We analyze Slim Fly and compare it to both traditional and state-of-the-art networks. Our analysis shows that Slim Fly has significant advantages over other topologies in latency, bandwidth, resiliency, cost, and power consumption. Finally, we propose deadlock-free routing schemes and physical layouts for large computing centers as well as a detailed cost and power model. Slim Fly enables constructing cost effective and highly resilient datacenter and HPC networks that offer low latency and high bandwidth under different HPC workloads such as stencil or graph computations.

Includes members:
  Member "demystifying graph databases analysis and taxonomy of data organization system designs and graph queries":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")
  Member "graph processing on fpgas taxonomy survey challenges":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")
  Member "red blue pebbling revisited near optimal parallel matrix matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "flexible communication avoiding matrix multiplication on fpga with high level synthesis")
  Member "a modular benchmarking infrastructure for high performance and reproducible deep learning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")
  Member "network accelerated non contiguous memory transfers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")
  Member "communication efficient jaccard similarity for high performance distributed genome comparisons":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the parallelism motifs of genomic data analysis")
  Member "slim graph practical lossy graph compression for approximate graph processing storage and analytics":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")
  Member "survey and taxonomy of lossless graph compression and space efficient graph representations":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "structural indexing for conjunctive path queries")

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)