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 "optimizing the number of fog nodes for cloud fog thing networks"):
  Abstract: Going from theory to practice in fog networking raises the question of the optimum number of fog nodes that will be upgraded from the existing nodes. This paper finds the optimum number of fog nodes for a given total number of ordinary nodes residing in the area of interest for different channel conditions. Determining the optimum number of fog nodes is quite beneficial, because it can strongly affect the SINR, and thus the average data rate and transmission delay. The numerical results indicate that the average data rate increases nearly an order of magnitude for an optimized number of fog nodes in case of shadowing and fading. It is further shown that the optimum number of fog nodes does not increase in direct proportion to the increase in the total number of nodes. Furthermore, the optimum number of fog nodes decreases when channels have high path loss exponents. These findings suggest that the fog nodes must be selected among those that have the highest computation capability for densely deployed networks and high path loss exponents channels.

Includes members:
  Member "a survey on mobile edge computing the communication perspective":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")
  Member "fog computing based radio access networks issues and challenges":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mode selection and resource allocation in sliced fog radio access networks a reinforcement learning approach")
  Member "fog computing focusing on mobile users at the edge":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "priority based fair scheduling in edge computing")
  Member "analyzing the impact of access point density on the performance of finite area networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "temporal correlation of interference and outage in mobile networks over one dimensional finite regions")
  Member "overlapping multihop clustering for wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hierarchical overlapping clustering of network data using cut metrics")
  Member "distance distributions in finite uniformly random networks theory and applications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "air to air communications beyond 5g a novel 3d comp transmission scheme")

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)