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 "degrees of freedom of cache aided wireless cellular networks"):
  Abstract: This work investigates the degrees of freedom (DoF) of a downlink cache-aided cellular network where the locations of base stations (BSs) are modeled as a grid topology and users within a grid cell can only communicate with four nearby BSs. We adopt a cache placement method with uncoded prefetching tailored for the network with partial connectivity. According to the overlapped degree of cached contents among BSs, we propose transmission schemes with no BS cooperation, partial BS cooperation, and full BS cooperation, respectively, for different cache sizes. In specific, the common cached contents among BSs are utilized to cancel some undesired signals by interference neutralization while interference alignment is used to coordinate signals of distinct cached contents. Our achievable results indicate that the reciprocal of per-user DoF of the cellular network decreases piecewise linearly with the normalized cache size $\mu$ at each BS, and the gain of BS caching is more significant for the small cache region. Under the given cache placement scheme, we also provide an upper bound of per-user DoF and show that our achievable DoF is optimal when $\mu\in\left[\frac{1}{2},1\right]$, and within an additive gap of $\frac{4}{39}$ to the optimum when $\mu\in\left[\frac{1}{4},\frac{1}{2}\right)$.

Includes members:
  Member "content caching and delivery in wireless radio access networks":
    also connected through other hyperedges:
      (none)
  Member "adding transmitters dramatically boosts coded caching gains for finite file sizes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "cache aided fog radio access networks with partial connectivity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "content caching and delivery in wireless radio access networks")
  Member "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "fog aided wireless networks for content delivery fundamental latency tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "fundamental tradeoff between storage and latency in cache aided wireless interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "scalable content delivery with coded caching in multi antenna fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "on heterogeneous coded distributed computing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery")

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)