human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "energy delay cost tradeoff for task offloading in imbalanced edge cloud based computing"
  Abstract: In this paper, the imbalance edge cloud based computing offloading for multiple mobile users (MUs) with multiple tasks per MU is studied. In which, several edge cloud servers (ECSs) are shared and accessed by multiple wireless access points (APs) with the backhaul links, and each MU has multiple computing intensive and latency critical tasks should be offloaded to execute, which involves both the AP association and ECS selection, with the objective of minimizing the offloading cost. Distinguished with existing research, besides the transmission delay and energy consumption from MU to AP, the ECS access-cost which characterizes the ECS access delay and (or) resource using cost is introduced, thus finally formulates the delay-energy-cost tradeoff based offloading cost criteria, for the MUs' offloading decision and resource allocation problems. In specific, in our system, the ECS access-cost depends on both the AP and ECS, which reflects the effects of different backhaul techniques used by these APs, and their negotiated payments of ECS resource using under different service level agreements. Both problems of minimizing the sum offloading costs for all MUs (efficiency-based) and minimizing the maximal offloading cost per MU (fairness-based) are discussed. Since these problems are all NP-hard. Therefore, some centralized and distributed heuristic algorithms are proposed to find the suboptimal solutions. Further analysis and numerical results are presented at last to demonstrate the performance of these algorithms from several aspects, such as efficiency, complexity and fairness.

Question: Please tell me which class the center node 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)