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: "profit maximization for geographically dispersed green data centers"
  Abstract: This paper aims at maximizing the profit associated with running geographically dispersed green data centers, which offer multiple classes of service. To this end, we formulate an optimization framework which relies on the accuracy of the G/D/1 queue in characterizing the workload distribution, and taps on the merits of the workload’s decomposition into green and brown workloads served by green and brown energy resources, respectively. Moreover, we take into account not only the service level agreements between the data centers and clients but also different deregulated electricity markets of data centers located at different regions. We prove the convexity of our optimization problem, and the performance of the proposed workload distribution strategy is evaluated via extensive simulations.

Connected through hyperedge HE-1 (induced by source paper "hierarchical capacity provisioning for fog computing"):
  with members:
    - "toward hierarchical mobile edge computing an auction based profit maximization approach"
    - "green cloudlet network a distributed green mobile cloud network"
    - "primal profit maximization avatar placement for mobile edge computing"
    - "an auction mechanism for resource allocation in mobile cloud computing systems"

Connected through hyperedge HE-2 (induced by source paper "toward hierarchical mobile edge computing an auction based profit maximization approach"):
  with members:
    - "primal profit maximization avatar placement for mobile edge computing"
    - "inter layer per mobile optimization of cloud mobile computing a message passing approach"
    - "an auction mechanism for resource allocation in mobile cloud computing systems"

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)