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 "optimal routing for a family of scalable interconnection networks"):
  Abstract: Scalability of interconnection networks for the supercomputers, particularly, for next-generation exascale systems with tens of millions of cores, is one of the essential features for enhancement of performance. One of the required properties of the scalable and low-radix for interconnection networks is the minimum-diameter-based scalable (MDBs) network. The MDBs network combines the desired features of some optimal topologies with different orders, such as small diameter, high connectivity, symmetry, and regularity. The diameter of the MDBs network grows up linearly while the size of the network measured in nodes increases exponentially. We designed the vertex-balanced routing algorithm for the base network by considering the pressure of the data transit in each node. The benchmarks on a real small-scale cluster show amazing improvements in performance after adapting the new routing algorithm. Each node of MDBs generated from base topologies can also sustain balanced transit loading if we apply the optimized routing algorithm to the base network. The simulation results show that our algorithm can substantially enhance communication performance for MDBs.

Includes members:
  Member "a new record of enumeration of regular graphs by parallel processing":
    also connected through other hyperedges:
      (none)
  Member "optimal low latency network topologies for cluster performance enhancement":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a new record of graph enumeration enabled by parallel processing")
  Member "a heuristic method of generating diameter 3 graphs for order degree problem invited paper":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal low latency network topologies for cluster performance enhancement")

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)