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 task offloading and resource allocation for fog computing"):
  Abstract: We propose a novel multi-tier fog and cloud computing architecture that enables edge nodes to cooperate in sharing computing and radio resources so as to minimize the total energy consumption of mobile users subject to their delay requirements. We first formulate the joint task offloading and resource allocation optimization problem as a mixed integer non-linear programming (MINLP). Due to the combination of binary (offloading decisions) and real variables (resource allocations), the problem is an NP-hard and computationally intractable. To circumvent, we relax the binary decision variables to transform the MINLP to a relaxed optimization problem with real variables. After proving that the relaxed problem is a convex one, we propose three solutions namely ROP, IBBA, and FFBD. In ROP, the solution of the relaxing problem is converted to the integer one and used as the final solution. In IBBA, the branch-and-bound method is combined with different offloading priority policies yielding two variants IBBA-LFC and IBBA-LCF. Note that the branch and bound method like IBBA may require exponential complexity in the worst case. As such, we develop a distributed approach, namely feasibility-finding Benders decomposition (FFBD), that decomposes the original problem into a master problem for the offloading decision and subproblems for resource allocation. These (simpler) subproblems can be solved in parallel at fog nodes, thus help reduce both the complexity and the computational time. FFBD has two different versions (FFBD-S and FFBD-F) is a distributed algorithm based on Benders decomposition. The numerical results show that IBBA-LFC/LCF and FFBD-S/F gain the optimal solution minimizing the total energy consumption and meet all delay requirements for mobile users. The FFBD-F with the fast solution detection method also has the least computation time of four algorithms IBBA-LFC/LCF and FFBD-S/F.

Includes members:
  Member "multi user multi task offloading and resource allocation in mobile cloud systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "energy efficient proactive caching for fog computing with correlated task arrivals")
  Member "joint energy minimization and resource allocation in c ran with mobile cloud":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy efficient resource allocation in uav enabled mobile edge computing networks")
  Member "resource sharing of a computing access point for multi user mobile cloud offloading with delay constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online resource procurement and allocation in a hybrid edge cloud computing system")
  Member "a survey on mobile edge networks convergence of computing caching and communications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fog computing systems state of the art research issues and future trends")
  Member "a survey on mobile edge computing the communication perspective":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "5g network slicing using sdn and nfv a survey of taxonomy architectures and future challenges")

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)