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: "uplink resource allocation for multiple access computational offloading"
  Abstract: The opportunity to offload computational tasks that is provided by the mobile edge computing framework enables mobile users to broaden the range of tasks that they can execute. When multiple users with different requirements seek to offload their tasks, the available communication and computation resources need to be efficiently allocated. The nature of the computational tasks, whether they are divisible or indivisible, and the choice of the multiple access scheme employed by the system have a fundamental impact on the total energy consumption of the offloading users. In this paper, we show that using the full capabilities of the multiple access channel can significantly reduce the energy consumption, and that the required resource allocation can be efficiently computed. In particular, we provide a closed-form optimal solution of the energy minimization problem when a set of users with different latency constraints are completely offloading their computational tasks, and a tailored greedy search algorithm for a good set of users. We also consider "data-partitionable" computational tasks and develop a low-complexity iterative algorithm to find a stationary solution to the energy minimization problem in that case. In addition, we develop low-complexity optimal algorithms for the energy minimization problem under the Time Division Multiple Access (TDMA) scheme in the binary offloading and partial offloading scenarios. Our numerical experiments show that the proposed algorithms outperform existing algorithms in terms of energy consumption and computational cost.

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.IT(Information Theory)