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 "fatpaths routing in supercomputers data centers and clouds with low diameter networks when shortest paths fall short"):
  Abstract: We introduce FatPaths: a simple, generic, and robust routing architecture for Ethernet stacks. FatPaths enables state-of-the-art low-diameter topologies such as Slim Fly to achieve unprecedented performance, targeting both HPC supercomputers as well as data centers and clusters used by cloud computing. FatPaths exposes and exploits the rich ("fat") diversity of both minimal and non-minimal paths for high-performance multi-pathing. Moreover, FatPaths features a redesigned "purified" transport layer, based on recent advances in data center networking, that removes virtually all TCP performance issues (e.g., the slow start). FatPaths also uses flowlet switching, a technique used to prevent packet reordering in TCP networks, to enable very simple and effective load balancing. Our design enables recent low-diameter topologies to outperform powerful Clos designs, achieving 15% higher net throughput at 2x lower latency for comparable cost. FatPaths will significantly accelerate Ethernet clusters that form more than 50% of the Top500 list and it may become a standard routing scheme for modern topologies.

Includes members:
  Member "slim fly a cost effective low diameter network topology":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")
  Member "expander datacenters from theory to practice":
    also connected through other hyperedges:
      (none)
  Member "homa a receiver driven low latency transport protocol using network priorities":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on recent advances in transport layer protocols")
  Member "revisiting network support for rdma":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "scaling distributed machine learning with in network aggregation")
  Member "a survey and evaluation of data center network topologies":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal dynamic cloud network control")
  Member "measuring and understanding throughput of network topologies":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "metteor robust multi traffic topology engineering for commercial data center networks")
  Member "enabling highly scalable remote memory access programming with mpi 3 one sided":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "practice of streaming and dynamic graphs concepts models systems and parallelism")
  Member "jellyfish networking data centers randomly":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "metteor robust multi traffic topology engineering for commercial data center networks")

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)