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 resource allocation in multicast device to device communications underlaying lte networks"):
  Abstract: In this paper, we present a framework for resource allocations for multicast device-to-device (D2D) communications underlaying the uplink of a Long-Term Evolution (LTE) network. The objective is to maximize the sum throughput of active cellular users (CUs) and feasible D2D multicast groups in a cell, while meeting a certain signal-to-interference-plus-noise ratio (SINR) constraint for both the CUs and the D2D groups. We formulate the general problem of power and channel allocation as a mixed integer nonlinear programming (MINLP) problem, where one D2D group can reuse the channels of multiple CUs and where the channel of each CU can be reused by multiple D2D groups. Distinct from existing approaches in the literature, our formulation and solution methods provide an effective and flexible means to utilize radio resources in cellular networks and share them with multicast groups without causing harmful interference to each other. The MINLP problem is transformed so that it can be solved optimally by a variant of the generalized Bender decomposition method with provable convergence. A greedy algorithm and a low-complexity heuristic solution are then devised. The performance of all schemes is evaluated through extensive simulations. Numerical results demonstrate that the proposed greedy algorithm can achieve close-to-optimal performance and that the heuristic algorithm provides good performance, even though it is inferior than that of the greedy, with much lower complexity.

Includes members:
  Member "a survey on device to device communication in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "simultaneous energy harvesting and information transmission in a mimo full duplex system a machine learning based design")
  Member "modeling analysis and optimization of multicast device to device transmissions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "d2d multicast in underlay cellular networks with exclusion zones")
  Member "efficiency resource allocation for device to device underlay communication systems a reverse iterative combinatorial auction based approach":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sub channel allocation for device to device underlaying full duplex mmwave small cells using coalition formation games")

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)