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 "cache assisted broadcast relay wireless networks a delivery time cache memory tradeoff"):
  Abstract: An emerging trend of next generation communication systems is to provide network edges with additional capabilities such as storage resources in the form of caches to reduce file delivery latency. To investigate this aspect, we study the fundamental limits of a cache-aided broadcast-relay wireless network consisting of one central base station, $M$ cache-equipped transceivers and $K$ receivers from a latency-centric perspective. We use the normalized delivery time (NDT) to capture the per-bit latency for the worst-case file request pattern, normalized with respect to a reference interference-free system with unlimited transceiver cache capabilities. The objective is to design the schemes for cache placement and file delivery in order to minimize the NDT. To this end, we establish a novel converse and two types of achievability schemes applicable to both time-variant and invariant channels. The first scheme is a general one-shot scheme for any $M$ and $K$ that synergistically exploits both multicasting (coded) caching and distributed zero-forcing opportunities. We show that the proposed one-shot scheme (i) attains gains attributed to both individual and collective transceiver caches (ii) is NDT-optimal for various parameter settings, particularly at higher cache sizes. The second scheme, on the other hand, designs beamformers to facilitate both subspace interference alignment and zero-forcing at lower cache sizes. Exploiting both schemes, we are able to characterize for various special cases of $M$ and $K$ which satisfy $K+M\leq 4$ the optimal tradeoff between cache storage and latency. The tradeoff illustrates that the NDT is the preferred choice to capture the latency of a system rather than the commonly used sum degrees-of-freedom (DoF). In fact, our optimal tradeoff refutes the popular belief that increasing cache sizes translates to increasing the achievable sum DoF.

Includes members:
  Member "fog aided wireless networks for content delivery fundamental latency tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "fundamental limits on latency in transceiver cache aided hetnets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "delivery time minimization in cache assisted broadcast relay wireless networks with imperfect csi")
  Member "fundamental tradeoff between storage and latency in cache aided wireless interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "waveform and spectrum management for unmanned aerial systems beyond 2025":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an autonomous spectrum management scheme for unmanned aerial vehicle networks in disaster relief operations")
  Member "cache aided interference management in partially connected wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "content caching and delivery in wireless radio access networks")
  Member "decentralized caching and coded delivery with distinct cache capacities":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "content caching and delivery in wireless radio access networks")
  Member "content centric sparse multicast beamforming for cache enabled cloud ran":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "fundamental limits of cache aided wireless bc interplay of coded caching and csit feedback":
    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)