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 caching in mobile hetnets a throughput delay trade off perspective"):
  Abstract: We analyze the optimal throughput--delay trade-off in content-centric mobile heterogeneous networks (HetNets), where each node moves according to the random walk mobility model and requests a content object from the library independently at random, according to a Zipf popularity distribution. Instead of allowing access to all content objects via costly backhaul, we consider a more practical scenario where mobile nodes and base stations (BSs), each having a finite-size cache space, are able to cache a subset of content objects so that each request is served by other mobile nodes or BSs via multihop transmissions. Under a given caching strategy, we first characterize a fundamental throughput--delay trade-off in terms of scaling laws by introducing a general content delivery multihop routing protocol. Then, the optimal throughput--delay trade-off is characterized by presenting the optimal cache allocation strategy, which jointly finds the replication sets at mobile nodes and BSs via nontrivial variable decoupling. In addition, computer simulations are performed to validate our analytical results. We also show that the optimal strategy strictly outperforms a baseline approach, where the replication sets at mobile nodes and BSs are optimized separately.

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 "throughput delay tradeoffs in content centric wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal caching placement for wireless femto caching network")
  Member "parallel opportunistic routing in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the effects of subpacketization in content centric mobile networks")
  Member "the throughput outage tradeoff of wireless one hop caching networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mobile communications computing and caching resources optimization for coded caching with device computing")
  Member "asymptotic laws for joint content replication and delivery in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "decentralized coded caching attains order optimal memory rate tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "fundamental limits of caching":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)