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 "efficient scheduling and power allocation for d2d assisted wireless caching networks"):
  Abstract: We study an one-hop device-to-device (D2D) assisted wireless caching network, where popular files are randomly and independently cached in the memory of end-users. Each user may obtain the requested files from its own memory without any transmission, or from a helper through an one-hop D2D transmission, or from the base station (BS). We formulate a joint D2D link scheduling and power allocation problem to maximize the system throughput. However, the problem is non-convex and obtaining an optimal solution is computationally hard. Alternatively, we decompose the problem into a D2D link scheduling problem and an optimal power allocation problem. To solve the two subproblems, we first develop a D2D link scheduling algorithm to select the largest number of D2D links satisfying both the signal to interference plus noise ratio (SINR) and the transmit power constraints. Then, we develop an optimal power allocation algorithm to maximize the minimum transmission rate of the scheduled D2D links. Numerical results indicate that both the number of the scheduled D2D links and the system throughput can be improved simultaneously with the Zipf-distribution caching scheme, the proposed D2D link scheduling algorithm, and the proposed optimal power allocation algorithm compared with the state of arts.

Includes members:
  Member "wireless device to device caching networks basic principles and system performance":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "caching in wireless multihop device to device networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cache placement in two tier hetnets with limited storage capacity cache or buffer")
  Member "content caching and delivery over heterogeneous wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adding transmitters dramatically boosts coded caching gains for finite file sizes")
  Member "caching aided coded multicasting with multiple random requests":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on optimal load memory tradeoff of cache aided scalar linear function retrieval")
  Member "order optimal rate of caching and coded multicasting with random demands":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "fundamental limits of caching with secure delivery":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on coded caching with private demands")
  Member "adaptive video streaming for wireless networks with multiple users and helpers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "wireless caching helper system with heterogeneous traffic and random availability")
  Member "coded caching for delay sensitive content":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "decentralized asynchronous coded caching design and performance analysis in fog radio access networks")

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